| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ken-or (0) - 1 freq kenmore (2) - 1 freq sentor (2) - 1 freq be'-or (2) - 3 freq censor (2) - 3 freq keno (2) - 1 freq ken-no (2) - 1 freq senior (2) - 40 freq vendor (2) - 1 freq tenior (2) - 1 freq kendo (2) - 2 freq mentor (2) - 2 freq ken-an (2) - 3 freq ken- (2) - 11 freq tenor (2) - 4 freq kenyon (2) - 1 freq hender (3) - 1 freq kennet (3) - 1 freq menter (3) - 1 freq menoj (3) - 2 freq penter (3) - 5 freq lennon (3) - 10 freq kenin (3) - 2 freq keneen (3) - 2 freq kenan (3) - 3 freq |
ken-or (0) - 1 freq ken-an (3) - 3 freq ken- (3) - 11 freq ken-no (3) - 1 freq kenmore (3) - 1 freq kin-' (4) - 1 freq ken-nae (4) - 3 freq kin- (4) - 1 freq keener (4) - 6 freq kongir (4) - 1 freq kintore (4) - 4 freq kinder (4) - 5 freq knorr (4) - 5 freq kinnoir (4) - 3 freq kenyon (4) - 1 freq keno (4) - 1 freq vendor (4) - 1 freq censor (4) - 3 freq be'-or (4) - 3 freq sentor (4) - 1 freq tenior (4) - 1 freq senior (4) - 40 freq kendo (4) - 2 freq mentor (4) - 2 freq tenor (4) - 4 freq |
SoundEx code - K560 knorr - 5 freq kimmer - 6 freq kinnoir - 3 freq kimmeer - 1 freq keener - 6 freq kaim-ower - 1 freq kjenner - 1 freq ken-or - 1 freq kenmore - 1 freq kumar - 1 freq kamara - 1 freq |
MetaPhone code - KNR canary - 14 freq kinnoir - 3 freq canner - 1 freq conrie - 1 freq gunnar - 6 freq goner - 4 freq keener - 6 freq cannier - 1 freq ganner - 1 freq conneree - 1 freq cunnar - 1 freq gonner - 1 freq cannery - 1 freq ken-or - 1 freq connor - 5 freq gunner - 2 freq canaria - 1 freq connery - 5 freq conor - 10 freq €œconor - 1 freq conner - 2 freq |
KEN-OR |
| Time to execute Levenshtein function - 0.432691 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.894318 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.077205 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.038685 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.000860 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. |