| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ficheren (0) - 1 freq fichered (1) - 1 freq ficherin (1) - 6 freq snicheren (2) - 2 freq kicherin (2) - 2 freq flicherin (2) - 1 freq nichered (2) - 4 freq ficher (2) - 4 freq fisheen (2) - 6 freq nicherin (2) - 2 freq tichered (2) - 2 freq fichterin (2) - 1 freq fishermen (2) - 36 freq fichert (2) - 1 freq ticherin (2) - 2 freq tichen (3) - 3 freq fifteeen (3) - 1 freq nicher (3) - 5 freq macheen (3) - 2 freq flickered (3) - 6 freq fechten (3) - 1 freq fisherman (3) - 23 freq faichers (3) - 1 freq differen (3) - 1 freq snicheran (3) - 1 freq |
ficheren (0) - 1 freq ficherin (1) - 6 freq fichered (2) - 1 freq nicherin (3) - 2 freq fichterin (3) - 1 freq ticherin (3) - 2 freq fichert (3) - 1 freq flicherin (3) - 1 freq kicherin (3) - 2 freq ficher (3) - 4 freq faichers (4) - 1 freq fichtan (4) - 1 freq tocherin (4) - 1 freq faitherin (4) - 1 freq fichtin (4) - 2 freq fechten (4) - 1 freq fichertie (4) - 1 freq focherty (4) - 1 freq nichered (4) - 4 freq fisheen (4) - 6 freq snicheren (4) - 2 freq tichered (4) - 2 freq fishermen (4) - 36 freq snicherin (5) - 1 freq hicher (5) - 1 freq |
SoundEx code - F265 figurine - 2 freq ficherin - 6 freq foghorn - 4 freq fisherman - 23 freq feeshermin - 10 freq fishermin - 2 freq fishermen - 36 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 |
FICHEREN |
| Time to execute Levenshtein function - 0.330786 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.435993 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.030332 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.047787 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.001034 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. |