Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
almond (0) - 4 freq almonds (1) - 2 freq salmond (1) - 24 freq emond (2) - 1 freq alyona (2) - 3 freq mond (2) - 4 freq aroond (2) - 513 freq alon (2) - 2 freq amon (2) - 23 freq among (2) - 128 freq twalmond (2) - 5 freq alloed (2) - 3 freq amon' (2) - 4 freq amend (2) - 3 freq carmond (2) - 4 freq allood (2) - 7 freq alone (2) - 72 freq raymond (2) - 2 freq salmon (2) - 46 freq asoond (2) - 7 freq lamond (2) - 1 freq along (2) - 170 freq alson (2) - 1 freq alford (2) - 4 freq alooed (2) - 2 freq |
almond (0) - 4 freq lamond (2) - 1 freq salmond (2) - 24 freq almonds (2) - 2 freq lomond (2) - 17 freq armand (3) - 1 freq raymond (3) - 2 freq amend (3) - 3 freq emond (3) - 1 freq elmundo (3) - 2 freq mond (3) - 4 freq lemon (4) - 23 freq monad (4) - 1 freq limned (4) - 1 freq mynd (4) - 255 freq lowmond (4) - 3 freq remind (4) - 41 freq lend (4) - 22 freq 'mind (4) - 17 freq ylind (4) - 1 freq monde (4) - 1 freq laand (4) - 69 freq mnd (4) - 1 freq demand (4) - 51 freq mound (4) - 8 freq |
SoundEx code - A455 alimentum - 1 freq almanac - 3 freq aluminium - 7 freq aul'mannie - 1 freq almonds - 2 freq ailments - 9 freq almond - 4 freq aluminum - 2 freq ailment - 2 freq ailmint - 1 freq ailmints - 1 freq alamein - 1 freq almanacs - 1 freq alumeinium - 2 freq aul-man - 4 freq aloneness - 1 freq alaninbelfast - 1 freq |
MetaPhone code - ALMNT almond - 4 freq ailment - 2 freq ailmint - 1 freq |
ALMOND |
Time to execute Levenshtein function - 0.196565 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.358650 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.029640 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.040440 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.000964 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. |