| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eyemooth (0) - 1 freq eyemouth (1) - 1 freq heymooth (2) - 1 freq yermooth (2) - 1 freq eyemooth's (2) - 1 freq yooth (3) - 6 freq €˜mooth (3) - 1 freq mooth (3) - 525 freq €œsmooth (3) - 1 freq smooth (3) - 30 freq eyeteeth (3) - 1 freq eyesite (4) - 1 freq remote (4) - 27 freq smooths (4) - 1 freq emosh (4) - 1 freq eeth (4) - 1 freq mooths (4) - 76 freq pyements (4) - 1 freq weoot (4) - 1 freq mammoth (4) - 8 freq eyvnoo (4) - 7 freq enenoo (4) - 8 freq elemints (4) - 1 freq -month (4) - 1 freq youth (4) - 130 freq |
eyemooth (0) - 1 freq eyemouth (1) - 1 freq mooth (3) - 525 freq yermooth (3) - 1 freq heymooth (3) - 1 freq eyeteeth (4) - 1 freq mouth (4) - 45 freq smooth (4) - 30 freq moth (4) - 7 freq yooth (4) - 6 freq eyemooth's (4) - 1 freq booth (5) - 10 freq meith (5) - 3 freq 'youth (5) - 2 freq moosh (5) - 2 freq heymouthe (5) - 1 freq aimeth (5) - 1 freq inooth (5) - 1 freq mooch (5) - 25 freq moot (5) - 11 freq footh (5) - 4 freq mooth' (5) - 1 freq meyth (5) - 1 freq moots (5) - 3 freq yarmouth (5) - 6 freq |
SoundEx code - E530 end - 1221 freq emit - 4 freq enmity - 4 freq eynd - 1 freq endow - 2 freq entae - 43 freq ennit - 2 freq ent - 3 freq einaudi - 1 freq eened - 3 freq endy - 8 freq enda - 2 freq eind - 1 freq end' - 1 freq 'enewed - 1 freq ende - 3 freq emty - 3 freq een-twa - 2 freq een-at - 1 freq endue - 1 freq emdy - 4 freq emmett - 2 freq eyemouth - 1 freq eyemooth - 1 freq |
MetaPhone code - EYM0 eyemouth - 1 freq eyemooth - 1 freq |
EYEMOOTH |
| Time to execute Levenshtein function - 0.400863 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.479425 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.028472 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.040723 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.005201 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. |