| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lamond (0) - 1 freq lamont (1) - 8 freq lomond (1) - 17 freq lemons (2) - 2 freq almond (2) - 4 freq laernd (2) - 1 freq lemon (2) - 23 freq emond (2) - 1 freq amon' (2) - 4 freq land (2) - 352 freq mond (2) - 4 freq lamland (2) - 1 freq lemony (2) - 1 freq laand (2) - 69 freq lambed (2) - 2 freq eamonn (2) - 9 freq among (2) - 128 freq raymond (2) - 2 freq carmond (2) - 4 freq lament (2) - 22 freq diamond (2) - 12 freq lowmond (2) - 3 freq amend (2) - 3 freq salmond (2) - 24 freq lamped (2) - 2 freq |
lamond (0) - 1 freq lomond (1) - 17 freq almond (2) - 4 freq lamont (2) - 8 freq amend (3) - 3 freq lowmond (3) - 3 freq lament (3) - 22 freq salmond (3) - 24 freq diamond (3) - 12 freq limonade (3) - 1 freq lemonade (3) - 13 freq raymond (3) - 2 freq laund (3) - 89 freq lamped (3) - 2 freq limned (3) - 1 freq land (3) - 352 freq mond (3) - 4 freq emond (3) - 1 freq laernd (3) - 1 freq lemon (3) - 23 freq lamland (3) - 1 freq lemons (3) - 2 freq lemony (3) - 1 freq lambed (3) - 2 freq laand (3) - 69 freq |
SoundEx code - L553 lowmond - 3 freq lament - 22 freq lamont - 8 freq laments - 9 freq lamond - 1 freq lemonade - 13 freq lomond - 17 freq lamentatiouns - 2 freq lamentin - 7 freq laminated - 5 freq lamentation - 4 freq lenient - 2 freq lamentit - 1 freq lunnonderrie - 1 freq lamentable - 1 freq laminit - 1 freq leenyint - 1 freq lamented - 2 freq laminatit - 1 freq leemonade - 2 freq lemonades - 1 freq lamantation - 1 freq lamentations - 1 freq laminate - 2 freq lamination - 1 freq limonade - 1 freq luminatus - 1 freq lamante - 1 freq 'lament - 3 freq luminatescot - 5 freq luminate - 1 freq |
MetaPhone code - LMNT lowmond - 3 freq lament - 22 freq lamont - 8 freq lamond - 1 freq lemonade - 13 freq lomond - 17 freq limned - 1 freq laminit - 1 freq leemonade - 2 freq laminate - 2 freq limonade - 1 freq lamante - 1 freq 'lament - 3 freq luminate - 1 freq |
LAMOND |
| Time to execute Levenshtein function - 0.241651 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.454490 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.031411 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.040373 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.001195 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. |