| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| drawers (0) - 52 freq drapers (1) - 1 freq dramers (1) - 1 freq draw'ers (1) - 1 freq draaers (1) - 3 freq dra'ers (1) - 2 freq drawrs (1) - 1 freq drawer (1) - 132 freq dreamers (2) - 4 freq brawer (2) - 9 freq trawlers (2) - 4 freq dryvers (2) - 1 freq drapes (2) - 6 freq craters (2) - 24 freq dramer (2) - 2 freq draver (2) - 2 freq dealers (2) - 10 freq drars (2) - 2 freq frasers (2) - 2 freq prayers (2) - 59 freq drawed (2) - 1 freq drakes (2) - 2 freq drawers (2) - 2 freq draver's (2) - 1 freq traders (2) - 5 freq |
drawers (0) - 52 freq drawrs (1) - 1 freq dra'ers (2) - 2 freq draaers (2) - 3 freq drawer (2) - 132 freq drapers (2) - 1 freq dramers (2) - 1 freq draw'ers (2) - 1 freq draws (3) - 31 freq rowers (3) - 3 freq drars (3) - 2 freq drivers (3) - 24 freq drawr's (3) - 1 freq draars (3) - 37 freq growers (3) - 1 freq dryvers (3) - 1 freq draaars (3) - 1 freq dreamers (3) - 4 freq drawins (3) - 11 freq dowers (3) - 1 freq drovers (3) - 2 freq rakers (4) - 1 freq draper (4) - 2 freq drawers (4) - 1 freq thrawers (4) - 1 freq |
SoundEx code - D662 draaers - 3 freq drawers - 52 freq dreerieshire - 4 freq drawr's - 1 freq draars - 37 freq drearisome - 1 freq dray-horse - 2 freq drars - 2 freq draawers - 1 freq drawers - 2 freq draw'ers - 1 freq drawers - 1 freq draars - 1 freq dra'ers - 2 freq draaars - 1 freq drawrs - 1 freq |
MetaPhone code - TRWRS drawers - 52 freq draawers - 1 freq drawers - 2 freq drawers - 1 freq |
DRAWERS |
| Time to execute Levenshtein function - 0.257709 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.450507 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.032728 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.038515 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.000856 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. |