| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ficherin (0) - 6 freq flicherin (1) - 1 freq nicherin (1) - 2 freq kicherin (1) - 2 freq ficheren (1) - 1 freq fichterin (1) - 1 freq ticherin (1) - 2 freq michelin (2) - 4 freq bickerin (2) - 7 freq fichered (2) - 1 freq snicherin (2) - 1 freq fichertie (2) - 1 freq fingerin (2) - 2 freq nickerin (2) - 1 freq faitherin (2) - 1 freq filterin (2) - 3 freq mitherin (2) - 7 freq nitherin (2) - 3 freq picterin (2) - 1 freq ficher (2) - 4 freq flickerin (2) - 17 freq fichtin (2) - 1 freq fichert (2) - 1 freq tichenin (2) - 1 freq githerin (2) - 2 freq |
ficherin (0) - 6 freq ficheren (1) - 1 freq ticherin (2) - 2 freq flicherin (2) - 1 freq fichterin (2) - 1 freq nicherin (2) - 2 freq kicherin (2) - 2 freq fichtin (3) - 1 freq ficher (3) - 4 freq fichertie (3) - 1 freq faitherin (3) - 1 freq tocherin (3) - 1 freq fichert (3) - 1 freq fichered (3) - 1 freq witherin (4) - 4 freq anchorin (4) - 1 freq fishermin (4) - 2 freq flichterin (4) - 14 freq featherin (4) - 2 freq faichers (4) - 1 freq chorin (4) - 1 freq coherin (4) - 1 freq cheerin (4) - 24 freq fechtin (4) - 160 freq fichtan (4) - 1 freq |
SoundEx code - F265 figurine - 2 freq ficherin - 6 freq foghorn - 4 freq fisherman - 23 freq feeshermin - 10 freq fishermin - 2 freq fishermen - 35 freq feeshermin's - 1 freq ficheren - 1 freq fishermen' - 1 freq fisherman'll - 1 freq fïshermen - 1 freq fishermans - 1 freq fisherman's - 1 freq fishermen's - 4 freq fusherman - 1 freq fushermen - 1 freq fyshermen - 1 freq figurines - 2 freq fou-grown - 1 freq |
MetaPhone code - FXRN ficherin - 6 freq ficheren - 1 freq |
FICHERIN |
| Time to execute Levenshtein function - 0.186466 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.027898 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.038878 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.000817 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. |