| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| deepur (0) - 1 freq deeper (1) - 51 freq neepur (1) - 1 freq deur (2) - 2 freq deefurs (2) - 1 freq neeper (2) - 5 freq devour (2) - 7 freq deep (2) - 581 freq deeply (2) - 37 freq deepcut (2) - 1 freq eemur (2) - 1 freq deefer (2) - 1 freq deesul (2) - 1 freq deepen (2) - 6 freq deer (2) - 71 freq veeper (2) - 2 freq detour (2) - 7 freq leesur (2) - 1 freq keeper (2) - 44 freq deeps (2) - 7 freq feegur (2) - 7 freq demur (2) - 1 freq deepth (2) - 1 freq deener (2) - 3 freq neebur (2) - 11 freq |
deepur (0) - 1 freq deeper (1) - 51 freq neepur (2) - 1 freq veeper (3) - 2 freq deepen (3) - 6 freq detour (3) - 7 freq deeps (3) - 7 freq deener (3) - 3 freq demur (3) - 1 freq deefer (3) - 1 freq keeper (3) - 44 freq deer (3) - 71 freq devour (3) - 7 freq neeper (3) - 5 freq deur (3) - 2 freq deep (3) - 581 freq deeply (3) - 37 freq doer (4) - 1 freq deerie (4) - 1 freq leper (4) - 2 freq devoir (4) - 1 freq denar (4) - 1 freq spur (4) - 5 freq deter (4) - 4 freq dewer (4) - 2 freq |
SoundEx code - D160 deeper - 51 freq dover - 16 freq duffer - 6 freq differ - 135 freq dapper - 4 freq diver - 5 freq dafferie - 4 freq dyvor - 1 freq dobro - 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 |
DEEPUR |
| Time to execute Levenshtein function - 0.230918 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.522489 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.060694 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.040952 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.000912 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. |