| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| deeper (0) - 51 freq keeper (1) - 43 freq neeper (1) - 5 freq deepen (1) - 6 freq deefer (1) - 1 freq deepur (1) - 1 freq deener (1) - 3 freq veeper (1) - 2 freq deleer (2) - 1 freq leper (2) - 2 freq denner (2) - 273 freq reeder (2) - 3 freq feeder (2) - 5 freq keeker (2) - 3 freq eezer (2) - 1 freq deemed (2) - 12 freq eever (2) - 2 freq teeter (2) - 1 freq peever (2) - 1 freq seerer (2) - 1 freq heeter (2) - 9 freq daener (2) - 2 freq peepee (2) - 18 freq keepers (2) - 16 freq deesel (2) - 8 freq |
deeper (0) - 51 freq deepur (1) - 1 freq veeper (2) - 2 freq deefer (2) - 1 freq deener (2) - 3 freq keeper (2) - 43 freq deepen (2) - 6 freq neeper (2) - 5 freq deep (3) - 562 freq draper (3) - 2 freq neepur (3) - 1 freq paeper (3) - 3 freq dener (3) - 2 freq dueler (3) - 1 freq peyper (3) - 1 freq depe (3) - 1 freq reaper (3) - 16 freq dowper (3) - 4 freq dumper (3) - 1 freq dewer (3) - 2 freq deeply (3) - 36 freq deeps (3) - 7 freq dealer (3) - 15 freq damper (3) - 3 freq deer (3) - 69 freq |
SoundEx code - D160 deeper - 51 freq dover - 15 freq duffer - 6 freq differ - 135 freq dapper - 4 freq diver - 5 freq dafferie - 4 freq dyvor - 1 freq daffery - 2 freq dobber - 4 freq devour' - 1 freq dowper - 4 freq dover' - 1 freq dhofar - 1 freq 'dafferie - 1 freq deiffer - 2 freq daiver - 4 freq deefer - 1 freq dyvour - 2 freq dibber - 2 freq dabber - 3 freq devour - 7 freq dipper - 3 freq devoir - 1 freq deepur - 1 freq difer - 2 freq dfr - 2 freq dwfywri - 1 freq |
MetaPhone code - TPR deeper - 51 freq dapper - 4 freq tipper - 14 freq topiary - 2 freq tapper - 1 freq dowper - 4 freq topper - 12 freq taper - 4 freq dipper - 3 freq deepur - 1 freq |
DEEPER deep - 562 freq deeper - 51 freq deepest - 17 freq |
| Time to execute Levenshtein function - 0.194719 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.352232 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.028023 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.037906 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.001048 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. |