| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dxr (0) - 1 freq nxr (1) - 1 freq dfr (1) - 2 freq dyr (1) - 1 freq lxr (1) - 1 freq dor (1) - 5 freq xr (1) - 3 freq der (1) - 302 freq dir (1) - 400 freq dx (1) - 3 freq dr (1) - 199 freq dar (1) - 86 freq dur (1) - 1 freq doe (2) - 6 freq dha (2) - 1 freq ier (2) - 1 freq dtp (2) - 1 freq tr (2) - 8 freq or (2) - 9206 freq lr (2) - 5 freq doa (2) - 1 freq hxn (2) - 1 freq drl (2) - 12 freq dii (2) - 1 freq err (2) - 40 freq |
dxr (0) - 1 freq dir (2) - 400 freq dr (2) - 199 freq dur (2) - 1 freq der (2) - 302 freq dar (2) - 86 freq dx (2) - 3 freq xr (2) - 3 freq nxr (2) - 1 freq dfr (2) - 2 freq dyr (2) - 1 freq dor (2) - 5 freq lxr (2) - 1 freq daur (3) - 73 freq dwra (3) - 1 freq d'ir (3) - 39 freq de'r (3) - 51 freq deyr (3) - 1 freq daar (3) - 11 freq nxur (3) - 1 freq doxy (3) - 1 freq edr (3) - 1 freq drar (3) - 1 freq dair (3) - 11 freq dura (3) - 1 freq |
SoundEx code - D260 desire - 50 freq decker - 12 freq degree - 69 freq decree - 11 freq desir - 1 freq daycoar - 1 freq dcer - 1 freq dyker - 4 freq disarray - 2 freq digger - 12 freq desiree - 1 freq decor - 3 freq docker - 4 freq deckchair - 2 freq dagger - 4 freq decry - 2 freq daiker - 2 freq dickory - 3 freq doeckir - 1 freq desire' - 1 freq doo-grey - 1 freq dosser - 1 freq dogger - 1 freq deserr - 1 freq dowser - 1 freq décor - 1 freq dacre - 1 freq dossier - 1 freq decore - 1 freq €˜disseuer - 1 freq desair - 1 freq daiquiri - 1 freq dockra - 1 freq decora - 1 freq dizer - 1 freq dougray - 1 freq dxr - 1 freq dxxry - 1 freq |
MetaPhone code - TKSR dxr - 1 freq dxxry - 1 freq |
DXR |
| Time to execute Levenshtein function - 0.186730 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.343092 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.027706 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.038989 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.001002 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. |