| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| undulatin (0) - 1 freq insulatin (2) - 2 freq undulate (2) - 1 freq unrelatit (3) - 2 freq indicatin (3) - 8 freq unduin (3) - 1 freq undain (3) - 1 freq educatin (3) - 4 freq adulation (3) - 1 freq unladin (3) - 1 freq uneducatit (3) - 2 freq undilutit (3) - 1 freq insultin (3) - 3 freq undaein (3) - 2 freq indulgin (3) - 1 freq updatin (3) - 4 freq undevalin (3) - 1 freq insulation (3) - 1 freq inflatin (3) - 1 freq endurin (4) - 6 freq indicatit (4) - 4 freq induction (4) - 2 freq undressin (4) - 1 freq calculatin (4) - 3 freq populatit (4) - 1 freq |
undulatin (0) - 1 freq insulatin (3) - 2 freq undulate (3) - 1 freq insultin (4) - 3 freq undilutit (4) - 1 freq inflatin (4) - 1 freq adulation (4) - 1 freq indulgin (4) - 1 freq insulation (4) - 1 freq indicatin (4) - 8 freq dilutin (5) - 10 freq unladin (5) - 1 freq induction (5) - 2 freq inflation (5) - 1 freq inhalation (5) - 2 freq indication (5) - 5 freq underataun (5) - 1 freq unrelatit (5) - 2 freq adulatioun (5) - 1 freq neducation (5) - 4 freq undain (5) - 1 freq educatin (5) - 4 freq uneducatit (5) - 2 freq undaein (5) - 2 freq unduin (5) - 1 freq |
SoundEx code - U534 until - 495 freq untholeable - 1 freq undulatin - 1 freq untellt - 2 freq untul - 1 freq undulate - 1 freq undelivered - 1 freq untelt - 2 freq untholable - 1 freq unutilised - 1 freq unadulterate - 1 freq undilutit - 1 freq unadulterated - 3 freq untold - 1 freq |
MetaPhone code - UNTLTN undulatin - 1 freq |
UNDULATIN |
| Time to execute Levenshtein function - 0.226731 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.527348 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.030407 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.042462 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.000883 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. |