| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eilins (0) - 4 freq heilins (1) - 1 freq eisins (1) - 1 freq ceilins (1) - 8 freq ailins (1) - 1 freq weelins (2) - 1 freq ettlins (2) - 26 freq millins (2) - 1 freq sidins (2) - 1 freq tellins (2) - 5 freq killins (2) - 1 freq eerins (2) - 6 freq eisin (2) - 1 freq piling (2) - 1 freq milin (2) - 2 freq erline (2) - 1 freq uplins (2) - 1 freq ceilings (2) - 1 freq ceilin (2) - 65 freq rilin (2) - 2 freq birlins (2) - 1 freq bilin (2) - 42 freq feelins (2) - 76 freq wilkins (2) - 1 freq heilin (2) - 1 freq |
eilins (0) - 4 freq ailins (1) - 1 freq lins (2) - 3 freq aalins (2) - 2 freq eisins (2) - 1 freq heilins (2) - 1 freq ceilins (2) - 8 freq yealins (2) - 1 freq lilies (3) - 19 freq linins (3) - 1 freq eilds (3) - 2 freq aiblins (3) - 282 freq eildons (3) - 1 freq yirlins (3) - 1 freq eins (3) - 2 freq eilers (3) - 1 freq eenins (3) - 2 freq dailins (3) - 4 freq lans (3) - 15 freq etins (3) - 5 freq pailins (3) - 4 freq eelits (3) - 1 freq railins (3) - 22 freq aisins (3) - 1 freq alans (3) - 2 freq |
SoundEx code - E452 ellen's - 6 freq eilins - 4 freq elaine's - 1 freq elms - 1 freq elongatit - 2 freq eelnogitfit - 1 freq ellons - 1 freq ellon's - 1 freq elemjay - 2 freq ellenjoywebster - 1 freq ellemaich - 1 freq ellemcelle - 1 freq |
MetaPhone code - ELNS ellen's - 6 freq eilins - 4 freq elaine's - 1 freq ellons - 1 freq ellon's - 1 freq |
EILINS |
| Time to execute Levenshtein function - 0.202286 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.371970 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.031988 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.040912 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.000907 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. |