| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fusslin (0) - 8 freq fussin (1) - 6 freq fustlin (1) - 2 freq fisslin (1) - 1 freq fusslen (1) - 1 freq fullin (2) - 29 freq rustlin (2) - 9 freq pussin (2) - 1 freq hussein (2) - 1 freq fummlin (2) - 4 freq hussain (2) - 2 freq fussled (2) - 7 freq hushlin (2) - 1 freq easslin (2) - 1 freq futtlin (2) - 1 freq hasslin (2) - 1 freq bustlin (2) - 4 freq fausslie (2) - 1 freq fussles (2) - 1 freq fulin (2) - 2 freq basslin (2) - 1 freq wussin (2) - 1 freq fistlin (2) - 1 freq hustlin (2) - 1 freq whusslin (2) - 1 freq |
fusslin (0) - 8 freq fusslen (1) - 1 freq fisslin (1) - 1 freq fustlin (2) - 2 freq fussin (2) - 6 freq fausslie (3) - 1 freq hasslin (3) - 1 freq fussles (3) - 1 freq fussle (3) - 8 freq fessin (3) - 1 freq fistlin (3) - 1 freq basslin (3) - 1 freq easslin (3) - 1 freq fussled (3) - 7 freq furlin (4) - 15 freq fryslan (4) - 1 freq fassoun (4) - 3 freq fissled (4) - 1 freq fushin (4) - 19 freq fumblin (4) - 1 freq muslin (4) - 2 freq fossil (4) - 9 freq fissle (4) - 3 freq rosslyn (4) - 2 freq fasson (4) - 6 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.619898 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 - 1.791311 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.103068 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.187649 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.000858 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. |