| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kaim-ower (0) - 1 freq win-ower (3) - 1 freq hameower (3) - 3 freq tak-ower (3) - 1 freq pass-ower (3) - 1 freq mairower (3) - 11 freq atower (4) - 1 freq byde-ower (4) - 1 freq wanceower (4) - 1 freq stap-ower (4) - 1 freq kaimed (4) - 3 freq vyce-ower (4) - 1 freq set-ower (4) - 1 freq haimer (4) - 2 freq widower (4) - 2 freq mail-order (4) - 1 freq luk-ower (4) - 4 freq kimmeer (4) - 1 freq rainbowsr (4) - 6 freq layower (4) - 1 freq passower (4) - 9 freq haimster (4) - 2 freq lawnmower (4) - 1 freq oot-ower (4) - 1 freq brain-power (4) - 1 freq |
kaim-ower (0) - 1 freq mairower (5) - 11 freq tak-ower (5) - 1 freq come-ower (5) - 1 freq win-ower (5) - 1 freq hameower (5) - 3 freq kowtower (6) - 1 freq oot-ower (6) - 1 freq kimmer (6) - 6 freq i'mower (6) - 1 freq mower (6) - 15 freq makeower (6) - 1 freq empower (6) - 2 freq luk-ower (6) - 4 freq out-ower (6) - 1 freq kimmeer (6) - 1 freq byde-ower (6) - 1 freq pass-ower (6) - 1 freq set-ower (6) - 1 freq vyce-ower (6) - 1 freq haimmer (7) - 30 freq ken-or (7) - 1 freq gie-owre (7) - 1 freq aower (7) - 1 freq mait-gier (7) - 1 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 - KMWR come-ower - 1 freq kaim-ower - 1 freq |
KAIM-OWER |
| Time to execute Levenshtein function - 0.596876 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.876789 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.098972 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.112300 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.001033 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. |