| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| enamel (0) - 5 freq namer (2) - 1 freq namely (2) - 10 freq name (2) - 1220 freq camel (2) - 7 freq easel (2) - 1 freq renamed (2) - 5 freq rename (2) - 2 freq nael (2) - 2 freq named (2) - 53 freq eame (2) - 1 freq entel (2) - 3 freq 'name (2) - 2 freq enml (2) - 1 freq navel (2) - 1 freq aname (2) - 1 freq name' (2) - 3 freq names (2) - 304 freq examen (2) - 1 freq weasel (3) - 3 freq jame (3) - 3 freq pavel (3) - 1 freq engels (3) - 1 freq t-name (3) - 1 freq clamed (3) - 2 freq |
enamel (0) - 5 freq namely (2) - 10 freq enml (2) - 1 freq name (3) - 1220 freq entel (3) - 3 freq aname (3) - 1 freq name' (3) - 3 freq animal (3) - 101 freq names (3) - 304 freq namer (3) - 1 freq navel (3) - 1 freq named (3) - 53 freq nael (3) - 2 freq namelie (3) - 3 freq camel (3) - 7 freq enemy (4) - 38 freq anawl (4) - 1 freq naem (4) - 48 freq natal (4) - 2 freq naime (4) - 7 freq amyl (4) - 1 freq ental (4) - 1 freq eensel (4) - 6 freq enemies (4) - 37 freq nayme (4) - 2 freq |
SoundEx code - E554 enamel - 5 freq emmanuel - 1 freq eamonnmallie - 1 freq emanuel - 1 freq |
MetaPhone code - ENML enamel - 5 freq enml - 1 freq |
ENAMEL |
| Time to execute Levenshtein function - 0.228362 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.526327 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.061314 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.039533 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.001027 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. |