| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| airtit (0) - 42 freq pairtit (1) - 21 freq airtik (1) - 1 freq dairtit (1) - 1 freq cairtit (1) - 11 freq airmit (1) - 4 freq airtist (1) - 15 freq airtin (1) - 36 freq airtfu (2) - 1 freq airtins (2) - 8 freq fairdit (2) - 1 freq hairstit (2) - 4 freq ristit (2) - 5 freq airmie (2) - 15 freq hurtit (2) - 16 freq airpot (2) - 1 freq dirtie (2) - 1 freq mairit (2) - 11 freq giltit (2) - 3 freq airmpit (2) - 1 freq airt (2) - 297 freq pintit (2) - 14 freq awytit (2) - 1 freq airtists (2) - 20 freq tartit (2) - 1 freq |
airtit (0) - 42 freq airmit (2) - 4 freq airtist (2) - 15 freq cairtit (2) - 11 freq airtin (2) - 36 freq dairtit (2) - 1 freq pairtit (2) - 21 freq airtik (2) - 1 freq eairrit (3) - 3 freq pertit (3) - 2 freq fiytit (3) - 1 freq saitit (3) - 2 freq routit (3) - 1 freq hertit (3) - 18 freq yairnit (3) - 3 freq ditit (3) - 1 freq actit (3) - 9 freq alertit (3) - 2 freq airth (3) - 11 freq iftit (3) - 1 freq sertit (3) - 1 freq burtit (3) - 1 freq maitit (3) - 1 freq yirdit (3) - 29 freq citit (3) - 2 freq |
SoundEx code - A633 airted - 31 freq airtit - 42 freq airth-turned - 1 freq airy-heidit - 1 freq awarded - 6 freq awardit - 4 freq airt-oot - 2 freq awairdit - 2 freq |
MetaPhone code - ARTT airted - 31 freq airtit - 42 freq airt-oot - 2 freq |
AIRTIT |
| Time to execute Levenshtein function - 0.273703 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.532549 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.060565 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.037484 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.000966 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |