| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| delphi (0) - 1 freq delhi (1) - 13 freq adelphi (1) - 1 freq elphe (2) - 1 freq elph (2) - 1 freq deli (2) - 3 freq dolphin (2) - 5 freq melchi (2) - 2 freq dehs (3) - 1 freq deeply (3) - 37 freq eli (3) - 4 freq delyte (3) - 4 freq kelp (3) - 13 freq dep (3) - 2 freq delta (3) - 1 freq daph (3) - 1 freq delete (3) - 9 freq paulphi (3) - 1 freq belch (3) - 1 freq delyt (3) - 3 freq desprit (3) - 3 freq deletit (3) - 3 freq dellt (3) - 3 freq deysh (3) - 4 freq gelh (3) - 1 freq |
delphi (0) - 1 freq adelphi (1) - 1 freq delhi (2) - 13 freq dolphin (3) - 5 freq elph (3) - 1 freq elphe (3) - 1 freq guelph (4) - 1 freq dumphy (4) - 50 freq daph (4) - 1 freq ralph (4) - 5 freq melchi (4) - 2 freq deli (4) - 3 freq paulphi (4) - 1 freq delish (4) - 2 freq alph (4) - 1 freq alpha (4) - 5 freq deepen (5) - 6 freq helped (5) - 92 freq dali (5) - 5 freq delayin (5) - 3 freq del (5) - 15 freq delled (5) - 2 freq depth (5) - 23 freq deeplie (5) - 1 freq delboy (5) - 2 freq |
SoundEx code - D410 dolby - 3 freq dial-up - 2 freq dollop - 3 freq delve - 6 freq dollopie - 1 freq dulefu - 3 freq delphi - 1 freq dilip - 1 freq delboy - 2 freq |
MetaPhone code - TLF diaghilev - 1 freq delve - 6 freq dulefu - 3 freq delphi - 1 freq tea-leaf - 1 freq tulv - 1 freq |
DELPHI |
| Time to execute Levenshtein function - 0.198203 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.376326 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.030730 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.037144 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.000879 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. |