| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kummil (0) - 1 freq hummil (1) - 2 freq rummil (1) - 1 freq gummin (2) - 1 freq mummils (2) - 1 freq cummel (2) - 1 freq wumpil (2) - 1 freq kamil (2) - 1 freq bummin (2) - 20 freq rummile (2) - 1 freq rummel (2) - 6 freq dummie (2) - 1 freq wummin (2) - 231 freq whummil (2) - 1 freq summit (2) - 54 freq brummil (2) - 2 freq hummit (2) - 1 freq summin (2) - 36 freq rummul (2) - 1 freq rummilt (2) - 4 freq tummel (2) - 5 freq mummit (2) - 1 freq bummel (2) - 1 freq sammil (2) - 1 freq nummi (2) - 3 freq |
kummil (0) - 1 freq hummil (2) - 2 freq rummil (2) - 1 freq sammil (3) - 1 freq bummel (3) - 1 freq fammil (3) - 1 freq tummel (3) - 5 freq pummel (3) - 4 freq tummile (3) - 1 freq rummul (3) - 1 freq hummel (3) - 5 freq wummily (3) - 2 freq wummile (3) - 1 freq cummel (3) - 1 freq kamil (3) - 1 freq rummel (3) - 6 freq rummile (3) - 1 freq kimmer (4) - 6 freq demmel (4) - 1 freq rammel (4) - 1 freq wummle (4) - 1 freq mml (4) - 1 freq hummle (4) - 12 freq whummil (4) - 1 freq mummle (4) - 4 freq |
SoundEx code - K540 keenly - 8 freq kneel - 15 freq kennel - 11 freq kennle - 2 freq knoll - 2 freq knell - 5 freq kinelie - 1 freq kinely - 4 freq kïnnle - 1 freq ken'll - 1 freq kummil - 1 freq kynlie - 3 freq kinnle - 3 freq kamile - 37 freq €œkamile - 2 freq kamil - 1 freq kunal - 11 freq |
MetaPhone code - KML caumly - 8 freq gambol - 1 freq camel - 7 freq gamble - 12 freq comlie - 1 freq gumlie - 4 freq cumuli - 1 freq kummil - 1 freq cummel - 1 freq caimbeul - 1 freq camboal - 1 freq comelie - 2 freq caumel - 1 freq gmail - 1 freq camille - 1 freq comely - 4 freq cawmill - 2 freq kamile - 37 freq €œkamile - 2 freq kamil - 1 freq camilla - 2 freq gameÂ’ll - 1 freq camillo - 1 freq qmul - 2 freq qwyml - 1 freq |
KUMMIL |
| Time to execute Levenshtein function - 0.232429 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.356288 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.027645 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.042458 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.001010 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. |