| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| killagan (0) - 4 freq milligan (2) - 4 freq killan (2) - 2 freq pillagin (2) - 3 freq fillan (3) - 8 freq gillan (3) - 5 freq hill-man (3) - 1 freq gillian (3) - 7 freq villages (3) - 17 freq kellyan (3) - 2 freq killymain (3) - 1 freq illegal (3) - 31 freq village (3) - 163 freq kildonan (3) - 1 freq killen (3) - 4 freq millan (3) - 1 freq pillage (3) - 4 freq dillan (3) - 1 freq pillaged (3) - 2 freq salvagan (3) - 1 freq dollaghan (3) - 1 freq lagan (3) - 3 freq lillian (3) - 1 freq killyglen (3) - 1 freq killeen (3) - 1 freq |
killagan (0) - 4 freq killan (3) - 2 freq pillagin (3) - 3 freq milligan (3) - 4 freq killeen (4) - 1 freq killen (4) - 4 freq killymain (4) - 1 freq killyglen (4) - 1 freq kellyan (4) - 2 freq killin (4) - 61 freq lillian (5) - 1 freq lagan (5) - 3 freq dollaghan (5) - 1 freq collegian (5) - 1 freq hillman (5) - 3 freq willan (5) - 5 freq callaghan (5) - 6 freq salvagan (5) - 1 freq pillaging (5) - 1 freq villain (5) - 3 freq gillian (5) - 7 freq villages (5) - 17 freq gillan (5) - 5 freq pillaged (5) - 2 freq fillan (5) - 8 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 |
KILLAGAN |
| Time to execute Levenshtein function - 0.515518 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.897364 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.074661 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.041166 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.000878 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. |