| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dwammin (0) - 4 freq dwaumin (1) - 3 freq dwamlin (1) - 1 freq dwamin (1) - 1 freq wammlin (2) - 6 freq swarmin (2) - 6 freq swimmin (2) - 63 freq hammin (2) - 1 freq wamman (2) - 1 freq slammin (2) - 19 freq dimmin (2) - 3 freq dwaamie (2) - 1 freq bammin (2) - 3 freq jammin (2) - 4 freq doarmin (2) - 5 freq dwallin (2) - 15 freq dremmin (2) - 2 freq draemin (2) - 4 freq brammin (2) - 1 freq stammin (2) - 1 freq dwammy (2) - 2 freq dwam-an (2) - 1 freq dwaumie (2) - 2 freq damnin (2) - 2 freq spammin (2) - 1 freq |
dwammin (0) - 4 freq dwamin (2) - 1 freq dwamlin (2) - 1 freq dwaumin (2) - 3 freq wummin (3) - 233 freq dwam-an (3) - 1 freq dremmin (3) - 2 freq dimmin (3) - 3 freq dwammy (3) - 2 freq wamman (3) - 1 freq swimmin (3) - 63 freq drummin (3) - 9 freq wimmin (3) - 31 freq dwamie (4) - 2 freq crammin (4) - 1 freq waamin (4) - 1 freq rammin (4) - 3 freq lammin (4) - 2 freq wumman (4) - 588 freq womman (4) - 1 freq wumimin (4) - 1 freq wuamman (4) - 2 freq wummen (4) - 36 freq swimman (4) - 2 freq warmin (4) - 30 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 |
DWAMMIN |
| Time to execute Levenshtein function - 0.224939 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.383406 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.029749 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.037276 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.000901 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. |