| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| emeralds (0) - 10 freq emerald (1) - 17 freq emerants (2) - 1 freq merles (3) - 1 freq emerant (3) - 9 freq eyeballs (3) - 5 freq overalls (3) - 4 freq medals (3) - 15 freq murals (3) - 8 freq heralds- (3) - 1 freq eerans (3) - 1 freq emerged (3) - 17 freq almerals (3) - 1 freq meals (3) - 39 freq embra's (3) - 4 freq emerges (3) - 11 freq morals (3) - 10 freq herald (3) - 34 freq mermaids (3) - 1 freq earal's (3) - 1 freq metals (3) - 5 freq embraces (3) - 1 freq gerald (3) - 26 freq gerald's (3) - 2 freq numerals (3) - 4 freq |
emeralds (0) - 10 freq emerald (2) - 17 freq morales (4) - 1 freq mermaids (4) - 1 freq morals (4) - 10 freq merles (4) - 1 freq emerants (4) - 1 freq murals (4) - 8 freq gomerals (5) - 1 freq wurlds (5) - 1 freq haerald (5) - 1 freq numerals (5) - 4 freq herald's (5) - 2 freq errands (5) - 11 freq warlds (5) - 40 freq merle's (5) - 2 freq moralise (5) - 1 freq wirlds (5) - 3 freq mirds (5) - 1 freq miralles (5) - 2 freq worlds (5) - 15 freq gerald's (5) - 2 freq mlds (5) - 1 freq myrds (5) - 1 freq meals (5) - 39 freq |
SoundEx code - E564 emerald - 17 freq enrolled - 2 freq emeralds - 10 freq enrol - 1 freq enrolling - 1 freq |
MetaPhone code - EMRLTS emeralds - 10 freq |
EMERALDS |
| Time to execute Levenshtein function - 0.183686 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.359322 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.028699 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.040900 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.001249 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. |