| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| airpot (0) - 1 freq airport (1) - 20 freq aircht (2) - 1 freq airon (2) - 1 freq airmpit (2) - 1 freq tinpot (2) - 3 freq airtit (2) - 42 freq cairpet (2) - 21 freq hirplt (2) - 1 freq airports (2) - 3 freq firgot (2) - 9 freq firlot (2) - 2 freq airt (2) - 297 freq airmor (2) - 1 freq airnt (2) - 1 freq fairport (2) - 1 freq airmit (2) - 4 freq firgit (3) - 13 freq pairt (3) - 933 freq pirket (3) - 1 freq cairret (3) - 2 freq 'iron (3) - 2 freq air'll (3) - 2 freq birrit (3) - 3 freq cairvit (3) - 4 freq |
airpot (0) - 1 freq airport (2) - 20 freq cairpet (3) - 21 freq airnt (3) - 1 freq airtit (3) - 42 freq airmit (3) - 4 freq airt (3) - 297 freq airmpit (3) - 1 freq adapt (4) - 6 freq taypot (4) - 5 freq appt (4) - 1 freq wipit (4) - 5 freq giepit (4) - 5 freq spot (4) - 251 freq airty (4) - 1 freq carpet (4) - 52 freq arp (4) - 1 freq arrit (4) - 1 freq pot (4) - 209 freq rigoot (4) - 2 freq rot (4) - 39 freq depot (4) - 1 freq inpit (4) - 49 freq eairrit (4) - 3 freq roupit (4) - 1 freq |
SoundEx code - A613 arrived - 140 freq arrivit - 7 freq arbitration - 4 freq arbitrary - 4 freq arbiter - 2 freq arbiters - 1 freq arbitraetors - 1 freq arbeit - 1 freq arbitrar - 1 freq arbuthnot - 1 freq airpot - 1 freq arbuthnots - 1 freq arrivd - 1 freq arbehd - 1 freq |
MetaPhone code - ARPT airpot - 1 freq |
AIRPOT |
| Time to execute Levenshtein function - 0.289241 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.505122 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.028328 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.072698 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.000925 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. |