| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| leonard (0) - 63 freq leopard (1) - 5 freq 'leonard (1) - 1 freq leonardo (1) - 3 freq leonard's (2) - 19 freq leopart (2) - 1 freq loard (2) - 244 freq leopards (2) - 3 freq donard (2) - 1 freq reynard (2) - 3 freq bernard (2) - 5 freq leon (3) - 2 freq leon's (3) - 1 freq coard (3) - 3 freq beard (3) - 54 freq ronald (3) - 49 freq gerard (3) - 2 freq lend (3) - 22 freq cooard (3) - 1 freq glenarm (3) - 3 freq weyward (3) - 1 freq eynar (3) - 34 freq loardo (3) - 1 freq lemonade (3) - 13 freq lunar (3) - 1 freq |
leonard (0) - 63 freq leonardo (1) - 3 freq 'leonard (2) - 1 freq leopard (2) - 5 freq donard (3) - 1 freq lanyard (3) - 1 freq reynard (3) - 3 freq loard (3) - 244 freq nard (4) - 3 freq loardo (4) - 1 freq maynard (4) - 1 freq launward (4) - 1 freq lunar (4) - 1 freq lowurd (4) - 1 freq lizard (4) - 32 freq leaned (4) - 40 freq lord (4) - 396 freq loner (4) - 1 freq lard (4) - 4 freq longed (4) - 5 freq lanark (4) - 29 freq leared (4) - 1 freq bernard (4) - 5 freq loners (4) - 1 freq leopards (4) - 3 freq |
SoundEx code - L563 leonard - 63 freq 'leonard - 1 freq leonard's - 19 freq launward - 1 freq leonardo - 3 freq launered - 1 freq lanwart-bred - 1 freq lanwart - 1 freq lonnwirds - 2 freq lonnwird - 1 freq lion-hertit - 1 freq len-wirds - 4 freq len-words - 1 freq len-wird - 1 freq leemartin - 1 freq lanyard - 1 freq liamrudden - 1 freq |
MetaPhone code - LNRT leonard - 63 freq 'leonard - 1 freq leonardo - 3 freq launered - 1 freq |
LEONARD |
| Time to execute Levenshtein function - 0.188935 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.326040 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.027251 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.036961 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.000844 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. |