| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| drawers (0) - 48 freq dramers (1) - 1 freq drapers (1) - 1 freq draw'ers (1) - 1 freq dra'ers (1) - 2 freq drawer (1) - 131 freq draaers (1) - 3 freq drawrs (1) - 1 freq draems (2) - 5 freq craters (2) - 24 freq rakers (2) - 1 freq draws (2) - 29 freq draaars (2) - 1 freq lawers (2) - 8 freq dryvers (2) - 1 freq dealers (2) - 10 freq drawins (2) - 11 freq drovers (2) - 2 freq brawery (2) - 1 freq drawers (2) - 1 freq draver's (2) - 1 freq draver (2) - 2 freq rawer (2) - 1 freq thrawers (2) - 1 freq drivers (2) - 23 freq |
drawers (0) - 48 freq drawrs (1) - 1 freq draaers (2) - 3 freq drapers (2) - 1 freq drawer (2) - 131 freq dramers (2) - 1 freq dra'ers (2) - 2 freq draw'ers (2) - 1 freq draars (3) - 37 freq drivers (3) - 23 freq drars (3) - 2 freq dreamers (3) - 4 freq drawr's (3) - 1 freq drovers (3) - 2 freq dowers (3) - 1 freq rowers (3) - 3 freq growers (3) - 1 freq draaars (3) - 1 freq draws (3) - 29 freq drawins (3) - 11 freq dryvers (3) - 1 freq drewits (4) - 2 freq dargers (4) - 1 freq prayers (4) - 54 freq dramer (4) - 2 freq |
SoundEx code - D662 draaers - 3 freq drawers - 48 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 - 48 freq draawers - 1 freq drawers - 2 freq drawers - 1 freq |
DRAWERS |
| Time to execute Levenshtein function - 0.209863 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.367990 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.028038 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.037946 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.000874 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. |