| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fenellainnis (0) - 1 freq fellaini (4) - 1 freq fenella's (4) - 2 freq fenella (5) - 4 freq crenellations (5) - 1 freq feelin's (5) - 10 freq feelans (5) - 2 freq feelins (5) - 73 freq feelings (5) - 15 freq rebellion's (5) - 2 freq feillins (5) - 2 freq panellists (6) - 1 freq explainin (6) - 22 freq lakeelannia (6) - 1 freq loneliness (6) - 5 freq feelin' (6) - 21 freq facepaintin (6) - 1 freq englan's (6) - 2 freq heedlines (6) - 1 freq 'spellins (6) - 1 freq villains (6) - 3 freq flanns (6) - 1 freq levellin (6) - 5 freq tenentis (6) - 1 freq rebellious (6) - 4 freq |
fenellainnis (0) - 1 freq fenella's (6) - 2 freq feillins (7) - 2 freq fellaini (7) - 1 freq flanns (8) - 1 freq fillan's (8) - 1 freq fennins (8) - 1 freq fillings (8) - 2 freq fillins (8) - 2 freq fellness (8) - 1 freq rebellion's (8) - 2 freq feelins (8) - 73 freq feelin's (8) - 10 freq crenellations (8) - 1 freq fenella (8) - 4 freq feelings (8) - 15 freq feelans (8) - 2 freq lilyyinnes (9) - 1 freq unnerlinin (9) - 2 freq feenyins (9) - 2 freq fontaines (9) - 1 freq functionins (9) - 2 freq fellas (9) - 12 freq villainous (9) - 1 freq selliness (9) - 1 freq |
SoundEx code - F545 finland - 6 freq fummlin - 4 freq finlan - 1 freq fenellainnis - 1 freq finlaymcf - 1 freq |
MetaPhone code - FNLNS fenellainnis - 1 freq |
FENELLAINNIS |
| Time to execute Levenshtein function - 0.218282 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.360131 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.027726 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.037014 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.000871 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. |