| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fustled (0) - 1 freq rustled (1) - 4 freq fussled (1) - 7 freq fustle (1) - 3 freq hustled (1) - 1 freq fused (2) - 6 freq fusslen (2) - 1 freq rusted (2) - 5 freq fussed (2) - 13 freq castled (2) - 1 freq fumbled (2) - 5 freq fuddled (2) - 1 freq whustled (2) - 2 freq dusted (2) - 6 freq nestled (2) - 7 freq fustlin (2) - 2 freq us-led (2) - 1 freq fisted (2) - 1 freq hurtled (2) - 3 freq fuelled (2) - 7 freq jostled (2) - 3 freq fulled (2) - 36 freq fissled (2) - 1 freq brustled (2) - 1 freq fettled (2) - 1 freq |
fustled (0) - 1 freq fustle (2) - 3 freq hustled (2) - 1 freq rustled (2) - 4 freq fussled (2) - 7 freq fissled (3) - 1 freq jostled (3) - 3 freq castled (3) - 1 freq fustlin (3) - 2 freq fettled (3) - 1 freq fisted (3) - 1 freq nestled (3) - 7 freq fushed (4) - 3 freq busted (4) - 5 freq fummled (4) - 3 freq hustle (4) - 1 freq fussle (4) - 8 freq festered (4) - 3 freq fastened (4) - 7 freq fistlin (4) - 1 freq styled (4) - 1 freq reestled (4) - 1 freq foisted (4) - 1 freq feasted (4) - 2 freq fussles (4) - 1 freq |
SoundEx code - F234 fashed-like - 1 freq fowk-tale - 1 freq fustle - 3 freq fustlin - 2 freq fistlin - 1 freq factually - 1 freq factual - 9 freq fistlins - 1 freq fustled - 1 freq factly - 1 freq ffxtools - 1 freq festool - 2 freq |
MetaPhone code - FSTLT fustled - 1 freq |
FUSTLED |
| Time to execute Levenshtein function - 0.217615 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.397890 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.033193 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.040133 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.001265 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. |