| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| exaltit (0) - 1 freq enactit (2) - 3 freq exploit (2) - 2 freq exastet (2) - 1 freq exalts (2) - 1 freq elatit (2) - 1 freq existit (2) - 18 freq expleit (2) - 1 freq exactin (2) - 2 freq exertit (2) - 2 freq exalted (2) - 1 freq haltit (2) - 3 freq excitit (2) - 31 freq eatit (2) - 1 freq chantit (3) - 8 freq seatit (3) - 7 freq extint (3) - 1 freq exact (3) - 57 freq wallit (3) - 1 freq expectit (3) - 34 freq pantit (3) - 2 freq electit (3) - 22 freq exerptit (3) - 1 freq soartit (3) - 1 freq wautit (3) - 1 freq |
exaltit (0) - 1 freq exertit (3) - 2 freq exalted (3) - 1 freq haltit (3) - 3 freq existit (3) - 18 freq excitit (3) - 31 freq exastet (3) - 1 freq exalts (3) - 1 freq elatit (3) - 1 freq excitet (4) - 6 freq tltit (4) - 1 freq meltit (4) - 26 freq wiltit (4) - 1 freq slatit (4) - 1 freq exploitit (4) - 2 freq exultant (4) - 1 freq exeestit (4) - 1 freq peltit (4) - 5 freq kiltit (4) - 4 freq tiltit (4) - 7 freq boltit (4) - 4 freq saltet (4) - 1 freq executit (4) - 10 freq haultit (4) - 1 freq vaultit (4) - 2 freq |
SoundEx code - E243 eagle-eyed - 2 freq eaglet - 14 freq ecouldnae - 1 freq equality - 34 freq escalator - 4 freq excelled - 1 freq exultation - 1 freq exhaled - 7 freq escalate - 3 freq escalates - 1 freq exalts - 1 freq excluded - 4 freq exclude - 4 freq ecaalt - 1 freq egalitarianism - 3 freq equality' - 1 freq excludet - 1 freq exiled - 6 freq ecouldna - 1 freq excludit - 7 freq equalitie - 4 freq equaility's - 1 freq excludit' - 1 freq ecalled - 1 freq easy-led - 1 freq eiggilt - 1 freq escalatit - 1 freq excludes - 1 freq egalitar-ian - 1 freq exultant - 1 freq exalted - 1 freq exaltit - 1 freq eagled - 1 freq excluding - 1 freq excludin - 1 freq eslidcmc - 1 freq |
MetaPhone code - EKSLTT exalted - 1 freq exaltit - 1 freq |
EXALTIT |
| Time to execute Levenshtein function - 0.314684 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.626998 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.063841 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.038840 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.000843 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. |