| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fusslen (0) - 1 freq fusslin (1) - 8 freq fussled (1) - 7 freq fussle (1) - 8 freq fussles (1) - 1 freq fustle (2) - 3 freq fullen (2) - 1 freq fissle (2) - 3 freq fustlin (2) - 2 freq fisslin (2) - 1 freq fussed (2) - 13 freq fusskee (2) - 1 freq fursten (2) - 6 freq furlen (2) - 1 freq fussin (2) - 6 freq fustled (2) - 1 freq fissled (2) - 1 freq fessen (2) - 1 freq fessin (3) - 1 freq rustle (3) - 11 freq susset (3) - 1 freq lissen (3) - 10 freq mullen (3) - 1 freq fausslie (3) - 1 freq sussed (3) - 12 freq |
fusslen (0) - 1 freq fusslin (1) - 8 freq fisslin (2) - 1 freq fussles (2) - 1 freq fussle (2) - 8 freq fussled (2) - 7 freq fissled (3) - 1 freq fessen (3) - 1 freq fissle (3) - 3 freq fustlin (3) - 2 freq fussin (3) - 6 freq hasslin (4) - 1 freq fistlin (4) - 1 freq easslin (4) - 1 freq basslin (4) - 1 freq fission (4) - 1 freq fasson (4) - 6 freq fausslie (4) - 1 freq fissile (4) - 1 freq fassoun (4) - 3 freq fryslan (4) - 1 freq rosslyn (4) - 2 freq furlen (4) - 1 freq fullen (4) - 1 freq fussed (4) - 13 freq |
SoundEx code - F245 fusslin - 8 freq fusslen - 1 freq fisslin - 1 freq faslane - 1 freq faceline - 2 freq fawkland - 1 freq fauchlin - 1 freq fooshlonless - 1 freq |
MetaPhone code - FSLN fusslin - 8 freq fusslen - 1 freq fisslin - 1 freq faslane - 1 freq faceline - 2 freq |
FUSSLEN |
| Time to execute Levenshtein function - 0.227364 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.593334 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.029697 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.071484 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.000853 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. |