| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fusslin (0) - 8 freq fustlin (1) - 2 freq fisslin (1) - 1 freq fussin (1) - 6 freq fusslen (1) - 1 freq fullin (2) - 29 freq fussle (2) - 8 freq fumblin (2) - 1 freq hustlin (2) - 1 freq bustlin (2) - 4 freq basslin (2) - 1 freq pusshin (2) - 1 freq fulin (2) - 2 freq fussles (2) - 1 freq futtlin (2) - 1 freq fummlin (2) - 4 freq hussain (2) - 2 freq hussein (2) - 1 freq fussled (2) - 7 freq wussin (2) - 1 freq pussin (2) - 1 freq fausslie (2) - 1 freq hushlin (2) - 1 freq rustlin (2) - 10 freq fessin (2) - 1 freq |
fusslin (0) - 8 freq fisslin (1) - 1 freq fusslen (1) - 1 freq fussin (2) - 6 freq fustlin (2) - 2 freq fausslie (3) - 1 freq hasslin (3) - 1 freq easslin (3) - 1 freq basslin (3) - 1 freq fussles (3) - 1 freq fessin (3) - 1 freq fussle (3) - 8 freq fussled (3) - 7 freq fistlin (3) - 1 freq fushin (4) - 19 freq muslin (4) - 2 freq fessen (4) - 1 freq fissled (4) - 1 freq fissle (4) - 3 freq fasson (4) - 6 freq fryslan (4) - 1 freq fossil (4) - 10 freq fassoun (4) - 3 freq rosslyn (4) - 2 freq fission (4) - 1 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 |
FUSSLIN |
| Time to execute Levenshtein function - 0.188740 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.335638 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.027759 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.037332 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.000908 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. |