Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
deefer (0) - 1 freq deener (1) - 3 freq deeper (1) - 51 freq heefer (1) - 1 freq heeter (2) - 9 freq seeker (2) - 2 freq dexter (2) - 4 freq heifer (2) - 4 freq denser (2) - 2 freq seeger (2) - 1 freq seffer (2) - 1 freq deter (2) - 4 freq defen (2) - 1 freq reeder (2) - 3 freq dealer (2) - 15 freq dener (2) - 2 freq weeer (2) - 2 freq peever (2) - 1 freq wee-er (2) - 29 freq enfer (2) - 1 freq seerer (2) - 1 freq teeger (2) - 187 freq deeve (2) - 5 freq reefed (2) - 1 freq prefer (2) - 41 freq |
deefer (0) - 1 freq difer (2) - 2 freq heefer (2) - 1 freq deeper (2) - 51 freq deener (2) - 3 freq dewer (3) - 2 freq duffer (3) - 6 freq deefurs (3) - 1 freq dfr (3) - 2 freq deef (3) - 43 freq deere (3) - 3 freq deiffer (3) - 2 freq differ (3) - 135 freq liefer (3) - 5 freq deer (3) - 69 freq dueler (3) - 1 freq deepur (3) - 1 freq efer (3) - 1 freq deefie (3) - 3 freq daener (3) - 2 freq denier (3) - 1 freq deleer (3) - 1 freq dearer (3) - 8 freq defers (3) - 1 freq leifer (3) - 2 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 - TFR tougher - 3 freq dover - 15 freq duffer - 6 freq differ - 135 freq diver - 5 freq dafferie - 4 freq dyvor - 1 freq tverie - 2 freq tver - 3 freq tvery - 2 freq daffery - 2 freq tvver - 1 freq devour' - 1 freq dover' - 1 freq 'dafferie - 1 freq deiffer - 2 freq daiver - 4 freq deefer - 1 freq dyvour - 2 freq taiver - 2 freq devour - 7 freq tfar - 1 freq devoir - 1 freq difer - 2 freq dfr - 2 freq topher - 1 freq dwfywri - 1 freq tvroy - 1 freq |
DEEFER |
Time to execute Levenshtein function - 0.205260 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.385672 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.034458 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.036570 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.000818 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. |