| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dolphin (0) - 5 freq dolphins (1) - 7 freq dowpin (2) - 1 freq dauphin (2) - 1 freq delphi (2) - 1 freq dooshin (2) - 1 freq dolin (2) - 1 freq dollie (3) - 1 freq coopin (3) - 1 freq dowsin (3) - 2 freq helpin (3) - 87 freq doavrin (3) - 1 freq coachin (3) - 1 freq poopin (3) - 1 freq droappin (3) - 8 freq doublin (3) - 6 freq dushin (3) - 1 freq doggin (3) - 10 freq lollin (3) - 2 freq oppin (3) - 4 freq sophie (3) - 11 freq droopin (3) - 1 freq roupin (3) - 4 freq dalin (3) - 4 freq dossin (3) - 3 freq |
dolphin (0) - 5 freq dolphins (2) - 7 freq dauphin (3) - 1 freq delphi (3) - 1 freq adelphi (4) - 1 freq dolin (4) - 1 freq dooshin (4) - 1 freq dowpin (4) - 1 freq jamphin (5) - 1 freq daphne (5) - 7 freq droppin (5) - 8 freq endorphin (5) - 1 freq belchin (5) - 2 freq polishin (5) - 10 freq delayin (5) - 3 freq delvin (5) - 3 freq dupin (5) - 1 freq orphan (5) - 14 freq doiwpin (5) - 1 freq dripin (5) - 1 freq drapin (5) - 1 freq dilutin (5) - 10 freq loathin (5) - 4 freq dishin (5) - 12 freq dyshin (5) - 1 freq |
SoundEx code - D415 delvin - 3 freq dolphins - 7 freq dolphin - 5 freq dolphin-watch - 1 freq dolphin-search - 1 freq dollopin - 1 freq delving - 1 freq |
MetaPhone code - TLFN telephone - 16 freq 'telephone' - 1 freq tillyphone - 2 freq delvin - 3 freq dolphin - 5 freq dollaghan - 1 freq |
DOLPHIN |
| Time to execute Levenshtein function - 0.179053 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.348630 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.027567 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.038259 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.000967 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. |