| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kenmore (0) - 1 freq kenmerk (2) - 4 freq ken-or (2) - 1 freq memore (2) - 3 freq kintore (2) - 4 freq kenmark (2) - 1 freq encore (2) - 5 freq bentowre (3) - 1 freq memor (3) - 1 freq before (3) - 567 freq endure (3) - 17 freq cenrre (3) - 1 freq kinmont (3) - 3 freq venture (3) - 21 freq enorm (3) - 11 freq emoe (3) - 1 freq kintyre (3) - 4 freq venstre (3) - 2 freq enshore (3) - 2 freq senior (3) - 40 freq achmore (3) - 1 freq enjose (3) - 3 freq remorse (3) - 5 freq dinsmore (3) - 2 freq censored (3) - 92 freq |
kenmore (0) - 1 freq kenmark (3) - 1 freq kenmerk (3) - 4 freq kintore (3) - 4 freq ken-or (3) - 1 freq kintyre (4) - 4 freq knorr (4) - 5 freq kenmairk (4) - 2 freq encore (4) - 5 freq memore (4) - 3 freq anymore (4) - 14 freq meelmore (5) - 1 freq centre (5) - 275 freq memorie (5) - 13 freq more (5) - 465 freq kenyon (5) - 1 freq keno (5) - 1 freq amore (5) - 1 freq vendor (5) - 1 freq kintrie (5) - 37 freq entire (5) - 32 freq kenzie (5) - 49 freq kennle (5) - 2 freq marmore (5) - 2 freq ken-nae (5) - 3 freq |
SoundEx code - K560 knorr - 5 freq kimmer - 6 freq kinnoir - 3 freq kimmeer - 1 freq keener - 6 freq kaim-ower - 1 freq kjenner - 1 freq ken-or - 1 freq kenmore - 1 freq kumar - 1 freq kamara - 1 freq |
MetaPhone code - KNMR kenmore - 1 freq |
KENMORE |
| Time to execute Levenshtein function - 0.206872 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.373849 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.037098 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.037024 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.000926 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. |