| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kilkenny (0) - 1 freq kilrenny (1) - 1 freq kilmeny (2) - 8 freq silken (3) - 10 freq ochkenny (3) - 1 freq kilkeel (3) - 1 freq filkeen (3) - 2 freq kmckenna (3) - 22 freq ilkeen (3) - 5 freq €˜kenny (3) - 1 freq lenny (3) - 9 freq killeen (3) - 1 freq killen (3) - 4 freq wdkenny (3) - 1 freq tippenny (3) - 4 freq kinkeind (3) - 7 freq kenny (3) - 46 freq tippency (4) - 1 freq ilkyin (4) - 1 freq kinky (4) - 1 freq wilkin (4) - 2 freq willen (4) - 4 freq mickey (4) - 25 freq mirkent (4) - 1 freq benny (4) - 2 freq |
kilkenny (0) - 1 freq kilrenny (2) - 1 freq kilmeny (4) - 8 freq killen (5) - 4 freq killeen (5) - 1 freq wdkenny (5) - 1 freq kildonan (5) - 1 freq likenin (5) - 2 freq lenny (5) - 9 freq kinkeind (5) - 7 freq kenny (5) - 46 freq kilkeel (5) - 1 freq ochkenny (5) - 1 freq €˜kenny (5) - 1 freq silken (5) - 10 freq filkeen (5) - 2 freq ilkeen (5) - 5 freq kmckenna (5) - 22 freq kirtenin (6) - 1 freq milkman (6) - 4 freq likent (6) - 2 freq liken (6) - 5 freq kinno (6) - 24 freq kleen (6) - 1 freq kickin' (6) - 2 freq |
SoundEx code - K425 klaxon - 1 freq killagan - 4 freq kilkenny - 1 freq kloss-mid - 1 freq kilcoyne - 1 freq kwilson - 2 freq klzmu - 1 freq |
MetaPhone code - KLKN cleckin - 13 freq clekkin - 11 freq gloggin - 1 freq gluggin - 2 freq clockin - 10 freq claikin - 11 freq cologne - 3 freq cloakin - 1 freq clickin - 13 freq cluckin - 2 freq cleukin - 2 freq claiken - 1 freq gleekin - 4 freq killagan - 4 freq kilkenny - 1 freq clackin - 15 freq cloggin - 2 freq colloguin - 7 freq colleckin - 1 freq clackan - 1 freq cleekin - 11 freq cluckan - 1 freq clickan - 2 freq claikan - 1 freq clickeen - 1 freq cleikin - 4 freq cuailgne - 1 freq colloguein - 1 freq clokkin - 1 freq kilcoyne - 1 freq clakkin - 1 freq cowlickin - 1 freq |
KILKENNY |
| Time to execute Levenshtein function - 0.410940 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.517098 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.029621 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.046653 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.001199 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. |