| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pre-norse (0) - 1 freq pre-nhs (3) - 1 freq recoorse (3) - 1 freq remorse (3) - 5 freq pre-vers (3) - 1 freq pre-order (3) - 2 freq norse (4) - 53 freq preecise (4) - 1 freq pense (4) - 3 freq perverse (4) - 5 freq pre-war (4) - 2 freq prentice (4) - 9 freq presons (4) - 1 freq primrose (4) - 13 freq precious (4) - 141 freq henoose (4) - 1 freq rehearse (4) - 4 freq preserve (4) - 20 freq greenhoose (4) - 24 freq re-born (4) - 1 freq preincess (4) - 1 freq pre-set (4) - 1 freq pressure (4) - 64 freq tresors (4) - 1 freq endorse (4) - 3 freq |
pre-norse (0) - 1 freq pre-vers (4) - 1 freq pre-nhs (4) - 1 freq preints (6) - 2 freq dray-horse (6) - 2 freq prenters (6) - 3 freq prenses (6) - 1 freq prefers (6) - 3 freq prents (6) - 10 freq prentis (6) - 1 freq pre-crust (6) - 2 freq preens (6) - 23 freq preisoners (6) - 1 freq prisoners (6) - 24 freq preesoners (6) - 4 freq pertners (6) - 1 freq bremners (6) - 1 freq partners (6) - 4 freq prences (6) - 2 freq pre-orders (6) - 1 freq pretense (6) - 1 freq predators (6) - 1 freq recoorse (6) - 1 freq presons (6) - 1 freq pre-order (6) - 2 freq |
SoundEx code - P656 primary - 173 freq primrose - 13 freq premièred - 1 freq première - 1 freq primaries - 4 freq 'primary - 1 freq prime-rib - 1 freq primar - 1 freq primark - 6 freq primroses - 3 freq primordial - 1 freq premier - 7 freq primer - 10 freq pre-norse - 1 freq paramour - 1 freq primarie - 3 freq paranormal - 1 freq premiered - 1 freq preemary - 1 freq primarily - 2 freq premiership - 2 freq premiersportstv - 3 freq |
MetaPhone code - PRNRS pre-norse - 1 freq |
PRE-NORSE |
| Time to execute Levenshtein function - 0.220295 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.395119 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.028595 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.046248 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.000882 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. |