| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kenyon (0) - 1 freq fenton (2) - 8 freq beyon (2) - 1 freq kerryon (2) - 1 freq kendo (2) - 2 freq ken-or (2) - 1 freq kennan (2) - 14 freq denyan (2) - 2 freq kinnon (2) - 12 freq keno (2) - 1 freq kennin (2) - 297 freq lanyon (2) - 1 freq denyin (2) - 21 freq renton (2) - 4 freq ken'an (2) - 1 freq geryon (2) - 9 freq kenin (2) - 2 freq benon (2) - 1 freq kenya (2) - 6 freq kennen (2) - 2 freq ken-an (2) - 3 freq tenon (2) - 1 freq keneen (2) - 2 freq canyon (2) - 1 freq kanyou (2) - 1 freq |
kenyon (0) - 1 freq keneen (2) - 2 freq kenin (2) - 2 freq kenan (2) - 3 freq kanyou (3) - 1 freq canyon (3) - 1 freq keenin (3) - 10 freq ken-an (3) - 3 freq tenon (3) - 1 freq keaton (3) - 1 freq kennae (3) - 1 freq kinno (3) - 24 freq kaenin (3) - 2 freq keyin (3) - 1 freq kenya (3) - 6 freq keyn (3) - 5 freq kindon (3) - 1 freq kennen (3) - 2 freq denyan (3) - 2 freq kinnon (3) - 12 freq benon (3) - 1 freq kennan (3) - 14 freq kenny (3) - 46 freq kinn (3) - 4 freq kenna (3) - 11 freq |
SoundEx code - K550 kennin - 297 freq known - 67 freq knowin - 56 freq know-an - 1 freq ken-an - 3 freq kinema - 8 freq keenin - 10 freq kennen - 2 freq 'kennin' - 1 freq kennin' - 1 freq kiemon - 1 freq kenyon - 1 freq ken'an - 1 freq kennan - 14 freq kenan - 3 freq knowin' - 2 freq kinnen - 4 freq kenin - 2 freq knawin - 3 freq kaenin - 2 freq knowan - 2 freq keneen - 2 freq ken-me-na - 1 freq knawn - 6 freq kanani - 1 freq kanin - 1 freq komin - 1 freq kemonn - 1 freq kinnon - 12 freq |
MetaPhone code - KNYN kenyon - 1 freq canyon - 1 freq |
KENYON |
| Time to execute Levenshtein function - 0.208746 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.514906 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.028807 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.070624 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.000970 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. |