| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kicherin (0) - 2 freq ticherin (1) - 2 freq nicherin (1) - 2 freq ficherin (1) - 6 freq fichterin (2) - 1 freq kiggerin (2) - 1 freq snicherin (2) - 1 freq tichenin (2) - 1 freq michelin (2) - 4 freq kivverin (2) - 2 freq nitherin (2) - 3 freq mitherin (2) - 7 freq kiverin (2) - 2 freq flicherin (2) - 1 freq ficheren (2) - 1 freq kipperin (2) - 1 freq bickerin (2) - 7 freq nickerin (2) - 1 freq witherin (2) - 4 freq tocherin (2) - 1 freq picterin (2) - 1 freq githerin (2) - 2 freq katherine (3) - 5 freq silverin (3) - 2 freq herin (3) - 2 freq |
kicherin (0) - 2 freq ficherin (2) - 6 freq nicherin (2) - 2 freq ticherin (2) - 2 freq ficheren (3) - 1 freq tocherin (3) - 1 freq anchorin (4) - 1 freq kychin (4) - 1 freq keichin (4) - 1 freq snicherin (4) - 1 freq githerin (4) - 2 freq cheerin (4) - 25 freq chorin (4) - 1 freq kyuckerin (4) - 2 freq keichen (4) - 3 freq coherin (4) - 1 freq fichterin (4) - 1 freq picterin (4) - 1 freq katherine (4) - 5 freq mitherin (4) - 7 freq kiverin (4) - 2 freq nitherin (4) - 3 freq kivverin (4) - 2 freq tichenin (4) - 1 freq michelin (4) - 4 freq |
SoundEx code - K265 kicherin - 2 freq kyuckerin - 2 freq kiggerin - 1 freq |
MetaPhone code - KXRN cochrane - 4 freq kicherin - 2 freq cochran - 1 freq |
KICHERIN |
| Time to execute Levenshtein function - 0.190712 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.410086 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.027718 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.037337 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.000935 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. |