| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| deefnin (0) - 1 freq deefenin (1) - 2 freq deelin (2) - 1 freq leenin (2) - 8 freq deekin (2) - 2 freq seeknin (2) - 2 freq defyin (2) - 2 freq deein (2) - 1 freq deifenin (2) - 1 freq meenin (2) - 1 freq demeanin (2) - 3 freq depennin (2) - 2 freq peenin (2) - 3 freq deepenin (2) - 3 freq heefin (2) - 1 freq definin (2) - 4 freq deevin (2) - 4 freq keenin (2) - 10 freq dee'in (2) - 3 freq eenin (2) - 5 freq deafenin (2) - 3 freq deefie (2) - 3 freq seenin (2) - 1 freq leernin (2) - 1 freq deein (2) - 295 freq |
deefnin (0) - 1 freq deefenin (1) - 2 freq deifenin (2) - 1 freq deafenin (2) - 3 freq definin (2) - 4 freq deepenin (3) - 3 freq defyin (3) - 2 freq demeanin (3) - 3 freq dinin (4) - 25 freq definit (4) - 3 freq darnin (4) - 2 freq doonin (4) - 1 freq doffin (4) - 2 freq dronin (4) - 3 freq defendin (4) - 9 freq refinin (4) - 2 freq droonin (4) - 22 freq deafening (4) - 1 freq daurnin (4) - 1 freq devonian (4) - 1 freq definin' (4) - 1 freq dwynin (4) - 17 freq defen (4) - 1 freq denyin (4) - 21 freq divinin (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 |
DEEFNIN |
| Time to execute Levenshtein function - 0.214371 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.401341 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.028997 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.038718 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.000846 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. |