| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| denyin (0) - 21 freq denyan (1) - 2 freq defyin (1) - 2 freq denying (1) - 3 freq hentin (2) - 4 freq denis (2) - 11 freq lenin (2) - 1 freq fentin (2) - 2 freq deaein (2) - 1 freq vengin (2) - 1 freq dun-in (2) - 1 freq deckin (2) - 2 freq bendin (2) - 15 freq sendin (2) - 63 freq denie (2) - 1 freq dee'in (2) - 3 freq denim (2) - 9 freq bevyin (2) - 1 freq eryin (2) - 3 freq pensin (2) - 3 freq duntin (2) - 24 freq pendin (2) - 3 freq sensin (2) - 9 freq vendin (2) - 2 freq dentit (2) - 3 freq |
denyin (0) - 21 freq denyan (1) - 2 freq denn (2) - 3 freq dinin (2) - 25 freq defyin (2) - 2 freq denying (2) - 3 freq pinyin (3) - 1 freq kenin (3) - 2 freq kenyon (3) - 1 freq denys (3) - 1 freq dunlin (3) - 2 freq menin (3) - 2 freq driyin (3) - 1 freq dancin (3) - 138 freq feenyin (3) - 4 freq eenin (3) - 5 freq doonin (3) - 1 freq defyan (3) - 1 freq dinn (3) - 6 freq dunn (3) - 8 freq de'in (3) - 4 freq dinni (3) - 10 freq dingin (3) - 59 freq dennis (3) - 11 freq duncin (3) - 23 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 - TNYN denyin - 21 freq denyan - 2 freq |
DENYIN |
| Time to execute Levenshtein function - 0.333019 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.571113 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.027759 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.071798 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.000967 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. |