| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| leonardo (0) - 3 freq leonard (1) - 63 freq leopards (2) - 3 freq loardo (2) - 1 freq leopard (2) - 5 freq 'leonard (2) - 1 freq leonard's (2) - 20 freq reynard (3) - 3 freq lemonade (3) - 13 freq bernard (3) - 5 freq loards (3) - 1 freq senario (3) - 1 freq leopart (3) - 1 freq loard' (3) - 2 freq loado (3) - 1 freq jeopardy (3) - 2 freq bernards (3) - 1 freq donaldo (3) - 1 freq geordo (3) - 4 freq donard (3) - 1 freq fernando (3) - 12 freq seonaidh (3) - 1 freq loard (3) - 244 freq ronaldo (3) - 2 freq rewards (4) - 6 freq |
leonardo (0) - 3 freq leonard (1) - 63 freq leopard (3) - 5 freq 'leonard (3) - 1 freq loardo (3) - 1 freq donard (4) - 1 freq lanyard (4) - 1 freq leonard's (4) - 20 freq leopards (4) - 3 freq reynard (4) - 3 freq loard (4) - 244 freq lizard (5) - 32 freq lord (5) - 404 freq loners (5) - 1 freq maynard (5) - 1 freq eldorado (5) - 1 freq lorde (5) - 4 freq launered (5) - 1 freq leared (5) - 1 freq lanark (5) - 29 freq lard (5) - 4 freq lowurd (5) - 1 freq lando (5) - 1 freq lend (5) - 22 freq nard (5) - 3 freq |
SoundEx code - L563 leonard - 63 freq 'leonard - 1 freq leonard's - 20 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 |
LEONARDO |
| Time to execute Levenshtein function - 0.271115 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.437354 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.042518 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.037306 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.000888 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. |