| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| definin (0) - 4 freq refinin (1) - 2 freq defining (1) - 3 freq definit (1) - 3 freq definin' (1) - 1 freq beinin (2) - 1 freq beginin (2) - 15 freq meinin (2) - 1 freq declinin (2) - 1 freq decidin (2) - 17 freq deafenin (2) - 3 freq deefnin (2) - 1 freq devisin (2) - 7 freq divinin (2) - 1 freq deifenin (2) - 1 freq deefenin (2) - 2 freq defyin (2) - 2 freq defince (2) - 2 freq derivin (2) - 1 freq deridin (2) - 1 freq dwyinin (2) - 1 freq defendin (2) - 9 freq dwinin (2) - 19 freq finin (2) - 3 freq definite (2) - 20 freq |
definin (0) - 4 freq deefenin (2) - 2 freq deifenin (2) - 1 freq deefnin (2) - 1 freq definin' (2) - 1 freq refinin (2) - 2 freq defining (2) - 3 freq definit (2) - 3 freq deafenin (2) - 3 freq defendin (3) - 9 freq finin (3) - 3 freq dwinin (3) - 19 freq definet (3) - 1 freq define (3) - 11 freq defined (3) - 21 freq dwyinin (3) - 1 freq definite (3) - 20 freq divinin (3) - 1 freq defines (3) - 7 freq dinin (3) - 25 freq defyin (3) - 2 freq drainin (3) - 14 freq defince (3) - 2 freq deepenin (4) - 3 freq deafening (4) - 1 freq |
SoundEx code - D155 defining - 3 freq defemination - 1 freq dopamine - 2 freq deepenin - 3 freq deafenin - 3 freq definin - 4 freq deefenin - 2 freq divaynan - 1 freq deepenin' - 2 freq definin' - 1 freq depennin - 2 freq diaphonemic - 2 freq 'diaphonemic' - 1 freq divinin - 1 freq diaphonemes - 3 freq diaphoneme - 10 freq diaphonemics - 3 freq deefnin - 1 freq deepening - 2 freq deafening - 1 freq devonian - 1 freq deifenin - 1 freq debenhams - 1 freq |
MetaPhone code - TFNN deafenin - 3 freq definin - 4 freq deefenin - 2 freq divaynan - 1 freq definin' - 1 freq divinin - 1 freq deefnin - 1 freq devonian - 1 freq deifenin - 1 freq |
DEFININ |
| Time to execute Levenshtein function - 0.226358 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.393944 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.028351 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.041850 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.000919 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. |