| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hippyrockchick (0) - 12 freq approaching (7) - 7 freq approachin (7) - 21 freq approachit (7) - 1 freq hippycrits (7) - 3 freq approchit (7) - 1 freq hippycrit (7) - 1 freq approchan (8) - 1 freq ipatrick (8) - 1 freq approached (8) - 17 freq microchip (8) - 1 freq approach (8) - 105 freq hippycrate (8) - 1 freq hypocricy (8) - 1 freq humpybackit (8) - 1 freq pinocchio (8) - 1 freq hallyrackit (8) - 1 freq approched (8) - 1 freq hierarchies (8) - 2 freq hideyoshi (8) - 2 freq approtchen (8) - 1 freq hitchcock (8) - 1 freq shipwreckit (8) - 1 freq chickachicka (8) - 1 freq parochial (8) - 10 freq |
hippyrockchick (0) - 12 freq approchit (12) - 1 freq chickachicka (12) - 1 freq approachit (12) - 1 freq approaching (12) - 7 freq approachin (12) - 21 freq hitchcock (13) - 1 freq approched (13) - 1 freq approtchen (13) - 1 freq uppersenwick (13) - 1 freq rackwick (13) - 1 freq approaches (13) - 10 freq approtch (13) - 2 freq practick (13) - 9 freq hierarchical (13) - 1 freq approached (13) - 17 freq approchan (13) - 1 freq hippycrit (13) - 1 freq hippycrits (13) - 3 freq pickwick (13) - 1 freq approach (13) - 105 freq approch (13) - 1 freq parenthack (14) - 1 freq paper-chin (14) - 1 freq crick-neck (14) - 1 freq |
SoundEx code - H162 havers - 35 freq haivers - 31 freq hey-forks - 1 freq 'havers - 1 freq 'haivers - 4 freq heifers - 2 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 - HPRKXK hippyrockchick - 12 freq |
HIPPYROCKCHICK |
| Time to execute Levenshtein function - 0.253553 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.490962 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.033088 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.037967 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.000886 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. |