| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| airted (0) - 31 freq airmed (1) - 21 freq airned (1) - 1 freq cairted (1) - 5 freq hairted (1) - 2 freq pairted (1) - 5 freq sifted (2) - 1 freq wairned (2) - 2 freq gairter (2) - 1 freq birthed (2) - 3 freq bairbed (2) - 1 freq hairtet (2) - 1 freq biried (2) - 3 freq birled (2) - 69 freq mited (2) - 1 freq bairded (2) - 4 freq pirled (2) - 3 freq airtit (2) - 41 freq pinted (2) - 16 freq parted (2) - 1 freq abated (2) - 1 freq aimed (2) - 15 freq tirned (2) - 24 freq gairded (2) - 3 freq pirated (2) - 1 freq |
airted (0) - 31 freq pairted (2) - 5 freq rted (2) - 1 freq hairted (2) - 2 freq cairted (2) - 5 freq airned (2) - 1 freq airmed (2) - 21 freq airtik (3) - 1 freq airt (3) - 294 freq farted (3) - 3 freq armed (3) - 18 freq aird (3) - 3 freq airty (3) - 1 freq alerted (3) - 2 freq sorted (3) - 75 freq ecairted (3) - 1 freq darted (3) - 5 freq airtery (3) - 1 freq airth (3) - 11 freq airgued (3) - 3 freq raired (3) - 39 freq routed (3) - 2 freq hurted (3) - 2 freq ruited (3) - 4 freq waited (3) - 107 freq |
SoundEx code - A633 airted - 31 freq airtit - 41 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 - 41 freq airt-oot - 2 freq |
AIRTED |
| Time to execute Levenshtein function - 0.205390 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.347427 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.026840 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.065185 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.000830 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. |