| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dramer (0) - 2 freq dramed (1) - 2 freq dreamer (1) - 2 freq draver (1) - 2 freq drame (1) - 23 freq dramers (1) - 1 freq drames (1) - 7 freq draper (1) - 2 freq drawer (1) - 131 freq draaer (1) - 1 freq primer (2) - 10 freq drakes (2) - 2 freq draar (2) - 6 freq grammer (2) - 3 freq drar (2) - 1 freq namer (2) - 1 freq dater (2) - 1 freq racer (2) - 1 freq trader (2) - 9 freq drama' (2) - 1 freq daaner (2) - 1 freq drappr (2) - 1 freq dwamed (2) - 1 freq crame (2) - 1 freq dreamed (2) - 14 freq |
dramer (0) - 2 freq dreamer (1) - 2 freq draper (2) - 2 freq draaer (2) - 1 freq dormer (2) - 2 freq drames (2) - 7 freq drawer (2) - 131 freq draver (2) - 2 freq dramers (2) - 1 freq drame (2) - 23 freq dramed (2) - 2 freq dreamers (3) - 4 freq driver (3) - 89 freq rimer (3) - 1 freq drome (3) - 1 freq drier (3) - 9 freq dammer (3) - 1 freq dramein (3) - 2 freq dramas (3) - 6 freq drams (3) - 28 freq rymer (3) - 1 freq drama (3) - 95 freq dram (3) - 110 freq drahr (3) - 1 freq dromore (3) - 1 freq |
SoundEx code - D656 dreamer - 2 freq drummer - 11 freq dreamers - 4 freq drainer - 2 freq drummer's - 1 freq drumhirk - 1 freq dromore - 1 freq drum-roll - 1 freq dernrife - 1 freq draemrashes - 1 freq dramer - 2 freq dramers - 1 freq dormer - 2 freq drummers - 2 freq drumrunie - 1 freq drawin-room - 2 freq darrinrobson - 2 freq darranmarshall - 1 freq drmoragkerr - 4 freq darrenmurray - 6 freq drnerdlove - 2 freq drmarkjardine - 2 freq |
MetaPhone code - TRMR dreamer - 2 freq drummer - 11 freq tremor - 3 freq dromore - 1 freq dramer - 2 freq dormer - 2 freq toremore - 1 freq trimmer - 1 freq |
DRAMER |
| Time to execute Levenshtein function - 0.212083 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.379512 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.027151 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.037737 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.001090 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. |