| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dolphin (0) - 5 freq dolphins (1) - 6 freq dowpin (2) - 1 freq dauphin (2) - 1 freq delphi (2) - 1 freq dooshin (2) - 1 freq dolin (2) - 1 freq doonin (3) - 1 freq humphin (3) - 17 freq woopin (3) - 1 freq kooshin (3) - 1 freq dockin (3) - 2 freq dodgin (3) - 4 freq boppin (3) - 1 freq bowchin (3) - 1 freq dogshit (3) - 2 freq delayin (3) - 3 freq nothin (3) - 174 freq optin (3) - 1 freq mopin (3) - 1 freq yelpin (3) - 3 freq dupin (3) - 1 freq gulpin (3) - 4 freq adoptin (3) - 5 freq oshin (3) - 1 freq |
dolphin (0) - 5 freq dolphins (2) - 6 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 gilpin (5) - 1 freq droopin (5) - 1 freq dollopin (5) - 1 freq belchin (5) - 2 freq dullin (5) - 2 freq mumphin (5) - 1 freq driplin (5) - 1 freq dunchin (5) - 5 freq dyshin (5) - 1 freq dolmen (5) - 1 freq jamphin (5) - 1 freq dolton (5) - 1 freq idolisin (5) - 1 freq droappin (5) - 8 freq doiwpin (5) - 1 freq lehin (5) - 4 freq polishin (5) - 10 freq |
SoundEx code - D415 delvin - 3 freq dolphin - 5 freq dolphins - 6 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.171716 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.325192 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.026901 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.037018 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.000834 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. |