| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hypersensitive (0) - 1 freq oversensitive (3) - 1 freq insensitive (5) - 3 freq sensitive (5) - 16 freq perpesctives (6) - 1 freq perpetuitie (6) - 1 freq perspective (6) - 33 freq representitives (6) - 1 freq hyperdrive (6) - 1 freq hypertensed (6) - 1 freq ditransitive (6) - 2 freq transitive (6) - 2 freq oppertunitie (6) - 1 freq queesitive (6) - 1 freq personalitie (6) - 1 freq representative (6) - 20 freq persentage (6) - 3 freq perceptive (6) - 4 freq intransitive (6) - 4 freq capernoitie (6) - 1 freq hert-peitie (7) - 1 freq repressive (7) - 1 freq alternative (7) - 46 freq apprehensive (7) - 2 freq opportunitie (7) - 4 freq |
hypersensitive (0) - 1 freq oversensitive (5) - 1 freq representative (8) - 20 freq sensitive (8) - 16 freq insensitive (8) - 3 freq personalitie (9) - 1 freq ditransitive (9) - 2 freq intransitive (9) - 4 freq persentage (9) - 3 freq transitive (9) - 2 freq hypertensed (9) - 1 freq representitives (9) - 1 freq perspective (9) - 33 freq impersonation (10) - 2 freq impersonate (10) - 1 freq expressive (10) - 10 freq oppressive (10) - 2 freq persistit (10) - 5 freq presstv (10) - 1 freq representatives (10) - 13 freq personalities (10) - 3 freq impressive (10) - 33 freq unrepresentative (10) - 1 freq hypernova (10) - 1 freq depressive (10) - 2 freq |
SoundEx code - H162 havers - 35 freq haivers - 32 freq hey-forks - 1 freq heifers - 4 freq 'havers - 1 freq 'haivers - 4 freq hubris - 1 freq hauf-price - 2 freq haufers - 4 freq habbers - 1 freq hyperspace - 1 freq hovers - 3 freq hoover's - 1 freq hypercorrection - 3 freq €œhavers - 2 freq hypercorrect - 1 freq hyper-cranreuch - 1 freq hubristic - 1 freq hypersensitive - 1 freq haversack - 1 freq hprjx - 1 freq haiversblog - 1 freq heffers - 1 freq heefers - 1 freq hippyrockchick - 12 freq hburgh - 1 freq hauf-ersed - 1 freq |
MetaPhone code - PRSNSTF hypersensitive - 1 freq |
HYPERSENSITIVE |
| Time to execute Levenshtein function - 0.256382 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.444449 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.028809 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.040399 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.001090 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. |