| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| keppard (0) - 1 freq kepand (2) - 2 freq leopard (2) - 5 freq keppers (2) - 1 freq beard (3) - 57 freq kenmark (3) - 1 freq keiper (3) - 1 freq jeopardy (3) - 2 freq expand (3) - 9 freq kepta (3) - 1 freq keeped (3) - 1 freq aipward (3) - 1 freq gerard (3) - 2 freq petard (3) - 1 freq reynard (3) - 3 freq peppers (3) - 7 freq kedar (3) - 1 freq perpared (3) - 1 freq edward (3) - 33 freq kempers (3) - 2 freq appar (3) - 2 freq edvard (3) - 2 freq peppered (3) - 1 freq he'ard (3) - 1 freq kappa (3) - 1 freq |
keppard (0) - 1 freq keppers (3) - 1 freq peppered (4) - 1 freq kippers (4) - 7 freq kipper (4) - 5 freq leopard (4) - 5 freq kepand (4) - 2 freq hepped (5) - 1 freq keppit (5) - 17 freq peard (5) - 1 freq kyrard (5) - 1 freq keepers (5) - 16 freq pepper (5) - 83 freq rappered (5) - 1 freq kyard (5) - 3 freq reappeared (5) - 1 freq leppid (5) - 1 freq kerd (5) - 1 freq peppert (5) - 1 freq kippage (5) - 1 freq keppy (5) - 1 freq kipperin (5) - 1 freq keppin (5) - 10 freq tippered (5) - 1 freq keyburd (5) - 1 freq |
SoundEx code - K163 kivert - 4 freq kivvered - 2 freq keybrod - 1 freq keyboards - 3 freq kivered - 1 freq kivvert - 5 freq kie-buirds - 1 freq keyboord - 1 freq keyboard - 17 freq keyburd - 1 freq keybuird - 4 freq keppard - 1 freq keyboords - 1 freq keyboardist - 1 freq keyboard' - 1 freq |
MetaPhone code - KPRT capered - 4 freq capaured - 1 freq keppard - 1 freq cooperate - 2 freq gaypride - 1 freq gwpart - 1 freq |
KEPPARD |
| Time to execute Levenshtein function - 0.272481 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.424857 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.027929 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.039972 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.001012 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. |