| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hippyrockchick (0) - 12 freq hippycrit (7) - 1 freq hippycrits (7) - 3 freq approachin' (7) - 1 freq approachit (7) - 1 freq approaching (7) - 7 freq approachin (7) - 21 freq approchit (7) - 1 freq hippycrate (8) - 1 freq rackwick (8) - 1 freq approched (8) - 1 freq hierarchical (8) - 1 freq shipwreckit (8) - 1 freq hippycrates (8) - 4 freq parochial (8) - 11 freq uppersenwick (8) - 1 freq heyrick (8) - 2 freq hierarchies (8) - 2 freq approaches (8) - 11 freq hieroglyphics (8) - 5 freq practick (8) - 9 freq hideyoshi (8) - 2 freq approtch (8) - 2 freq hieroglyphic (8) - 1 freq pinocchio (8) - 1 freq |
hippyrockchick (0) - 12 freq approchit (12) - 1 freq chickachicka (12) - 1 freq approaching (12) - 7 freq approachin (12) - 21 freq approachit (12) - 1 freq approachin' (12) - 1 freq approached (13) - 21 freq approtchen (13) - 1 freq approaches (13) - 11 freq practick (13) - 9 freq uppersenwick (13) - 1 freq approtch (13) - 2 freq approach (13) - 107 freq hitchcock (13) - 1 freq pickwick (13) - 1 freq hippycrits (13) - 3 freq hippycrit (13) - 1 freq rackwick (13) - 1 freq approched (13) - 1 freq approch (13) - 1 freq approchan (13) - 1 freq hierarchical (13) - 1 freq charliechock (14) - 1 freq peracchm (14) - 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 - HPRKXK hippyrockchick - 12 freq |
HIPPYROCKCHICK |
| Time to execute Levenshtein function - 0.229363 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.386229 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.027538 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.037662 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.000957 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. |