| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dolphins (0) - 7 freq dolphin (1) - 5 freq drappins (3) - 5 freq boppins (3) - 1 freq poppins (3) - 1 freq ralphies (3) - 1 freq hopkins (3) - 4 freq nothins (3) - 1 freq dauphin (3) - 1 freq orphans (3) - 35 freq moothins (3) - 1 freq souchins (3) - 1 freq collins (3) - 3 freq dolin (3) - 1 freq dumplins (3) - 8 freq delphi (3) - 1 freq dowpin (3) - 1 freq gowpins (3) - 1 freq dollies (3) - 4 freq endorphins (3) - 2 freq dockins (3) - 1 freq doupies (3) - 1 freq domains (3) - 6 freq dooshin (3) - 1 freq helpins (3) - 3 freq |
dolphins (0) - 7 freq dolphin (2) - 5 freq endorphins (5) - 2 freq diaphinous (5) - 1 freq delphi (5) - 1 freq deepins (5) - 1 freq orphans (5) - 35 freq helpins (5) - 3 freq dumplins (5) - 8 freq ralphies (5) - 1 freq dauphin (5) - 1 freq drappins (5) - 5 freq lupins (6) - 4 freq lashins (6) - 3 freq elephint (6) - 1 freq lothians (6) - 6 freq adoptions (6) - 2 freq daphne (6) - 7 freq calaphine (6) - 2 freq delusions (6) - 3 freq dailins (6) - 4 freq dilations (6) - 1 freq homophons (6) - 1 freq leeshins (6) - 1 freq dealins (6) - 5 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 - TLFNS dolphins - 7 freq tullaghans - 2 freq telephones - 1 freq |
DOLPHINS |
| Time to execute Levenshtein function - 0.274026 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.540574 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.064706 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.072426 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.000915 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. |