| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dug-shape (0) - 2 freq pig-shape (2) - 1 freq dug-shite (2) - 1 freq t-shape (3) - 1 freq dog-shite (3) - 1 freq dug-eared (4) - 1 freq hye-shade (4) - 2 freq ship-shape (4) - 1 freq duisnae (4) - 1 freq re-shaped (4) - 1 freq dug-chains (4) - 2 freq lug-hole (4) - 1 freq dug-people (4) - 9 freq dug-man (4) - 2 freq reshape (4) - 1 freq dugdale (4) - 7 freq durestane (4) - 3 freq cube-shaped (4) - 1 freq shape (4) - 161 freq dug-rose (4) - 1 freq dry-stane (4) - 2 freq dug-up (4) - 1 freq bus-stap (4) - 2 freq dusnae (4) - 12 freq ushare (4) - 1 freq |
dug-shape (0) - 2 freq dug-shite (3) - 1 freq pig-shape (3) - 1 freq dog-shite (4) - 1 freq t-shape (5) - 1 freq dug-up (6) - 1 freq dry-stane (7) - 2 freq dug-rose (7) - 1 freq shape (7) - 161 freq dogshit (7) - 2 freq big-shot (7) - 2 freq cube-shaped (7) - 1 freq dug-wise (7) - 1 freq tube-shaped (7) - 1 freq bus-stap (7) - 2 freq re-shaped (7) - 1 freq dug-eared (7) - 1 freq hye-shade (7) - 2 freq ship-shape (7) - 1 freq lug-hole (7) - 1 freq dug-chains (7) - 2 freq reshape (7) - 1 freq dug-people (7) - 9 freq dug-man (7) - 2 freq buik-shops (8) - 2 freq |
SoundEx code - D210 disobey - 5 freq dickiebow - 1 freq day-joab - 1 freq deceive - 7 freq dough-baw - 1 freq doughbaw - 1 freq dug-up - 1 freq digby - 3 freq disavou - 1 freq dookie-up - 1 freq dug-shape - 2 freq dqgeyv - 1 freq dzf - 1 freq doxievee - 1 freq deejaypb - 3 freq dqb - 1 freq djgfyh - 1 freq dtaqzbu - 1 freq dyjvb - 1 freq dsp - 1 freq dickybeau - 1 freq dogpoo - 1 freq dyqpo - 1 freq dczhhb - 2 freq dcibw - 1 freq decaf - 1 freq dxpa - 1 freq |
MetaPhone code - TKXP dug-shape - 2 freq |
DUG-SHAPE |
| Time to execute Levenshtein function - 0.526488 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.818079 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.058487 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.037746 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.000876 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. |