| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dwaumin (0) - 3 freq dwamin (1) - 1 freq dwaumie (1) - 2 freq dwammin (1) - 4 freq dwaums (2) - 5 freq dwaumy (2) - 2 freq waamin (2) - 1 freq daurin (2) - 10 freq dwallin (2) - 15 freq draemin (2) - 4 freq dwaumed (2) - 1 freq daudin (2) - 2 freq dramin (2) - 1 freq dwaum (2) - 19 freq draimin (2) - 1 freq glaumin (2) - 1 freq dwaamie (2) - 1 freq waukin (2) - 24 freq doarmin (2) - 5 freq caumin (2) - 2 freq dautin (2) - 2 freq warmin (2) - 30 freq wumin (2) - 5 freq dwamlin (2) - 1 freq swarmin (2) - 6 freq |
dwaumin (0) - 3 freq dwamin (1) - 1 freq dwammin (2) - 4 freq dwaumie (2) - 2 freq dwaamie (3) - 1 freq draimin (3) - 1 freq dwaum (3) - 19 freq doarmin (3) - 5 freq dwamie (3) - 2 freq drumin (3) - 1 freq dramin (3) - 1 freq dwamlin (3) - 1 freq wumin (3) - 5 freq dwaumy (3) - 2 freq dwaums (3) - 5 freq waamin (3) - 1 freq draemin (3) - 4 freq dwaumed (3) - 1 freq dwams (4) - 18 freq wumen (4) - 7 freq weemin (4) - 178 freq dwaam (4) - 8 freq dwam (4) - 102 freq damian (4) - 2 freq dreamin (4) - 38 freq |
SoundEx code - D550 domain - 18 freq dominie - 66 freq denyin - 21 freq dwynin - 17 freq daimen - 4 freq dwaumin - 3 freq demon - 23 freq dwammin - 4 freq dwinin - 19 freq dwam-an - 1 freq dwyinin - 1 freq dimmin - 3 freq dinin - 25 freq dun-in - 1 freq downin - 4 freq dynamo - 2 freq denim - 9 freq damien - 2 freq demaun - 1 freq dwamin - 1 freq dawnin - 7 freq diamon - 2 freq dawnin' - 1 freq damnin - 2 freq doonin - 1 freq dem-an - 1 freq deman - 1 freq denyan - 2 freq dwynan - 2 freq domino - 10 freq dwinan - 2 freq domini - 1 freq donenae - 1 freq dwainan - 1 freq domine - 2 freq damian - 2 freq donum - 1 freq demean - 1 freq doonhame - 2 freq dmin - 1 freq |
MetaPhone code - TWMN dwaumin - 3 freq dwammin - 4 freq dwam-an - 1 freq dwamin - 1 freq two-man - 1 freq |
DWAUMIN |
| Time to execute Levenshtein function - 0.192795 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.402662 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.028055 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.037345 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.000920 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. |