| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dwinan (0) - 2 freq dwinin (1) - 19 freq dwynan (1) - 2 freq dwainan (1) - 1 freq shinan (2) - 10 freq twinin (2) - 6 freq deivan (2) - 1 freq dwinlin (2) - 2 freq joinan (2) - 1 freq edwina (2) - 1 freq dwyinin (2) - 1 freq wina (2) - 1 freq tuinan (2) - 1 freq rainan (2) - 1 freq dwiny (2) - 1 freq dornan (2) - 2 freq dwine (2) - 19 freq dwined (2) - 18 freq dinn (2) - 6 freq diean (2) - 1 freq wipan (2) - 1 freq dina (2) - 43 freq dingan (2) - 2 freq drivan (2) - 9 freq duina (2) - 6 freq |
dwinan (0) - 2 freq dwainan (1) - 1 freq dwynan (1) - 2 freq dwinin (1) - 19 freq dwyinin (2) - 1 freq dwynin (2) - 17 freq dwined (3) - 18 freq dwine (3) - 19 freq dornan (3) - 2 freq dwines (3) - 6 freq dwinit (3) - 4 freq dinin (3) - 25 freq winn (3) - 1 freq dwiny (3) - 1 freq dinn (3) - 6 freq dwinlin (3) - 2 freq twinin (3) - 6 freq downin (3) - 4 freq dawnin (3) - 7 freq edwina (3) - 1 freq dwlen (4) - 1 freq divinin (4) - 1 freq damnin (4) - 2 freq dwyns (4) - 1 freq edwin (4) - 29 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 - TWNN dwinin - 19 freq dwinan - 2 freq twinin - 6 freq twinnin - 1 freq dwainan - 1 freq |
DWINAN |
| Time to execute Levenshtein function - 0.212936 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.381849 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.029056 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.038787 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.001015 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. |