| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kevinkelkenny (0) - 3 freq kilkenny (5) - 1 freq kevinkane (6) - 2 freq edinkennedy (6) - 1 freq weelkennt (6) - 1 freq kevindempsey (6) - 1 freq kilrenny (6) - 1 freq kinelie (7) - 1 freq syvinteen (7) - 1 freq beginneen (7) - 1 freq fivepenny (7) - 1 freq heinesen (7) - 2 freq keingryke (7) - 5 freq seivinteen (7) - 1 freq evelynn (7) - 8 freq seveinteen (7) - 1 freq hinnerenn (7) - 1 freq kevingashley (7) - 1 freq peikken (7) - 1 freq seveenty (7) - 2 freq weelkent (7) - 1 freq kevinbrennanmp (7) - 1 freq eingelegte (7) - 1 freq weel-kennt (7) - 15 freq five-penny (7) - 1 freq |
kevinkelkenny (0) - 3 freq kilkenny (8) - 1 freq kevinkane (9) - 2 freq kilrenny (10) - 1 freq 'vinkle (11) - 1 freq evelynn (11) - 8 freq kevinrbrown (11) - 17 freq kaindleenes (11) - 1 freq knikkin (11) - 1 freq ervinelinda (11) - 9 freq kinkeind (11) - 7 freq gavinlundy (11) - 1 freq kevindempsey (11) - 1 freq weelkennt (11) - 1 freq edinkennedy (11) - 1 freq kinleen (11) - 1 freq kindleen (11) - 1 freq tinkling (12) - 1 freq knitbikenom (12) - 3 freq konkleuzhin (12) - 1 freq kinkardine (12) - 1 freq twinklin (12) - 15 freq kinnen (12) - 4 freq inklin (12) - 22 freq kennen (12) - 2 freq |
SoundEx code - K152 keeping - 44 freq kavanagh - 1 freq kevinstewartsnp - 3 freq kevmac - 9 freq kevinmc - 1 freq kevmcnaughton - 1 freq kavanaugh - 1 freq kevinkelkenny - 3 freq kevingashley - 1 freq kevinkane - 2 freq kevinmcilduff - 1 freq kevin's - 1 freq |
MetaPhone code - KFNKLKN kevinkelkenny - 3 freq |
KEVINKELKENNY |
| Time to execute Levenshtein function - 0.263321 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.387591 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.027836 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.037616 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.000787 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. |