| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kamil (0) - 1 freq tamil (1) - 1 freq kail (1) - 42 freq hamil (1) - 2 freq kamile (1) - 37 freq basil (2) - 2 freq sammil (2) - 1 freq namit (2) - 4 freq hail (2) - 259 freq kain (2) - 2 freq atil (2) - 17 freq kari (2) - 16 freq kabul (2) - 1 freq amid (2) - 9 freq eamin (2) - 1 freq camel (2) - 7 freq tail (2) - 263 freq pail (2) - 49 freq gail (2) - 3 freq kam (2) - 24 freq kaif (2) - 1 freq samin (2) - 4 freq kruil (2) - 1 freq kael (2) - 5 freq aafil (2) - 199 freq |
kamil (0) - 1 freq kamile (1) - 37 freq tamil (2) - 1 freq hamil (2) - 2 freq kail (2) - 42 freq karl (3) - 6 freq family (3) - 324 freq kuil (3) - 1 freq kruil (3) - 1 freq kam (3) - 24 freq kummil (3) - 1 freq kali (3) - 1 freq kevil (3) - 1 freq ketil (3) - 7 freq kael (3) - 5 freq kames (3) - 7 freq kamed (3) - 1 freq mail (3) - 54 freq komin (3) - 1 freq amyl (3) - 1 freq camel (3) - 7 freq kame (3) - 6 freq kabul (3) - 1 freq keil (3) - 3 freq kaim (3) - 13 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 |
KAMIL |
| Time to execute Levenshtein function - 0.517711 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.897455 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.096363 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.177445 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.001102 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. |