| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| drooths (0) - 1 freq droothy (1) - 4 freq drooth (1) - 20 freq drouths (1) - 1 freq trooths (1) - 1 freq dbooth (2) - 1 freq smooths (2) - 1 freq prootas (2) - 4 freq droons (2) - 4 freq booths (2) - 5 freq mooths (2) - 74 freq drouth's (2) - 1 freq drouth (2) - 49 freq drowth (2) - 1 freq roots (2) - 67 freq droothie (2) - 1 freq drouthy (2) - 17 freq trooth (2) - 2 freq doots (2) - 33 freq troots (2) - 16 freq broths (2) - 1 freq drools (2) - 1 freq broot's (2) - 2 freq roothy (2) - 1 freq brooches (3) - 1 freq |
drooths (0) - 1 freq drouths (1) - 1 freq droothy (2) - 4 freq drooth (2) - 20 freq trooths (2) - 1 freq droothie (3) - 1 freq broths (3) - 1 freq drouth (3) - 49 freq drouth's (3) - 1 freq dairths (3) - 1 freq drouthy (3) - 17 freq deepths (4) - 5 freq truiths (4) - 2 freq daiths (4) - 10 freq druith (4) - 1 freq truths (4) - 6 freq ruths (4) - 2 freq graiths (4) - 2 freq braiths (4) - 8 freq drouthie (4) - 12 freq dorts (4) - 8 freq breiths (4) - 1 freq wreaths (4) - 6 freq deiths (4) - 7 freq breaths (4) - 16 freq |
SoundEx code - D632 dorts - 8 freq drouths - 1 freq dorothy's - 3 freq dredge - 2 freq dredger - 1 freq darts - 31 freq drudgery - 3 freq dwarts - 1 freq dredged - 3 freq dairths - 1 freq dordogne - 1 freq druids - 5 freq druidic - 1 freq dirty-kneed - 1 freq drewits - 2 freq dreids - 2 freq dreidsomelookin - 1 freq derts - 2 freq dredgin - 2 freq dratsis - 2 freq dratsi - 7 freq dreidsome - 1 freq drouth's - 1 freq drooths - 1 freq dorados - 1 freq dairts - 2 freq dirts - 1 freq dratsie - 1 freq dorothykoomson - 2 freq dartagnan - 1 freq draatsi - 2 freq |
MetaPhone code - TR0S drouths - 1 freq truths - 6 freq dorothy's - 3 freq truiths - 2 freq dairths - 1 freq truth's - 1 freq trooths - 1 freq drouth's - 1 freq drooths - 1 freq |
DROOTHS |
| Time to execute Levenshtein function - 0.197038 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.356625 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.029758 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.042572 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.000963 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. |