| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dresses (0) - 18 freq presses (1) - 23 freq dresser (1) - 23 freq dressed (1) - 117 freq dresse (1) - 1 freq gresses (1) - 7 freq dressers (1) - 1 freq tresses (1) - 1 freq desses (1) - 1 freq dresseen (2) - 1 freq caesses (2) - 2 freq prenses (2) - 1 freq preises (2) - 1 freq crosses (2) - 11 freq gressis (2) - 1 freq guesses (2) - 6 freq creshes (2) - 1 freq dosses (2) - 2 freq dresden (2) - 1 freq adressed (2) - 2 freq glesses (2) - 96 freq dressan (2) - 2 freq dressit (2) - 3 freq pressed (2) - 74 freq orestes (2) - 2 freq |
dresses (0) - 18 freq tresses (2) - 1 freq desses (2) - 1 freq gresses (2) - 7 freq dressers (2) - 1 freq dresse (2) - 1 freq presses (2) - 23 freq dresser (2) - 23 freq dressed (2) - 117 freq dressin (3) - 23 freq addresses (3) - 16 freq dressit (3) - 3 freq pressies (3) - 3 freq dressins (3) - 1 freq grasses (3) - 8 freq dressan (3) - 2 freq dress (3) - 97 freq pressis (3) - 2 freq dresst (3) - 10 freq adressed (3) - 2 freq crosses (3) - 11 freq dresseen (3) - 1 freq dosses (3) - 2 freq gressis (3) - 1 freq caresses (3) - 3 freq |
SoundEx code - D622 dresses - 18 freq door-cheek - 2 freq darkest - 14 freq dairkest - 3 freq derkest - 1 freq daurkest - 5 freq druggies - 1 freq drakes - 2 freq door-cheek's - 1 freq driechest - 2 freq door-chik - 1 freq darkies - 2 freq dreichest - 2 freq derkies - 1 freq dirges - 1 freq dregies - 1 freq dreich-as-cauld-parritch - 1 freq durexuk - 1 freq drkkhgagrj - 1 freq doricocd - 1 freq derekweston - 5 freq drxuaywz - 1 freq darcyoake - 2 freq drjoshuawolrich - 1 freq |
MetaPhone code - TRSS traces - 6 freq dresses - 18 freq terraces - 4 freq tracy's - 1 freq torsos - 1 freq doris's - 3 freq tresses - 1 freq traeces - 1 freq |
DRESSES |
| Time to execute Levenshtein function - 0.202923 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.340353 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.027695 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.037091 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.000836 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. |