Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
eamonnmallie (0) - 1 freq reasonablie (5) - 1 freq macgonnalie (5) - 1 freq eventuallie (5) - 2 freq mentallie (5) - 1 freq essentiallie (5) - 1 freq tonallie (5) - 1 freq eannie (6) - 1 freq eamonn (6) - 9 freq aboundantlie (6) - 1 freq cannilie (6) - 5 freq eamonnss (6) - 1 freq methodicallie (6) - 1 freq reasonable (6) - 21 freq donnachie (6) - 1 freq mrjohnmellis (6) - 5 freq akwallie (6) - 2 freq naiturallie (6) - 2 freq ackwallie (6) - 2 freq monetarie (6) - 1 freq actuallie (6) - 3 freq eamonns (6) - 1 freq finallie (6) - 1 freq meninfullie (6) - 1 freq annullit (6) - 1 freq |
eamonnmallie (0) - 1 freq mentallie (7) - 1 freq meninfullie (7) - 1 freq eamonnoneill (7) - 3 freq munnell (8) - 2 freq annville (8) - 1 freq tonallie (8) - 1 freq aaronneville (8) - 1 freq essentiallie (8) - 1 freq eventuallie (8) - 2 freq meaninfully (9) - 1 freq mainnerable (9) - 1 freq minimal (9) - 9 freq mentally (9) - 9 freq marcmalloy (9) - 1 freq continuallie (9) - 1 freq monnie (9) - 5 freq simonwhall (9) - 3 freq minneapolis (9) - 1 freq donnelly (9) - 1 freq annalls (9) - 1 freq connelly (9) - 1 freq anomalies (9) - 2 freq potentiallie (9) - 1 freq marshmallae (9) - 3 freq |
SoundEx code - E554 enamel - 5 freq emmanuel - 1 freq eamonnmallie - 1 freq emanuel - 1 freq |
MetaPhone code - EMNML eamonnmallie - 1 freq |
EAMONNMALLIE |
Time to execute Levenshtein function - 0.304971 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.586986 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.059760 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.051685 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.000936 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. |