| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hierarchies (0) - 2 freq heirarchies (2) - 1 freq hierarchy (3) - 2 freq hierarchical (3) - 1 freq herries (4) - 4 freq shenachies (4) - 1 freq literacies (4) - 1 freq libraries (4) - 27 freq boorachies (4) - 3 freq searches (4) - 4 freq vratchies (4) - 1 freq praiches (5) - 1 freq owerairchin (5) - 3 freq hertache (5) - 1 freq henries (5) - 1 freq archie (5) - 92 freq scrauchles (5) - 2 freq miracles (5) - 10 freq archie's (5) - 14 freq sprachles (5) - 1 freq hielichts (5) - 1 freq frenchies (5) - 4 freq heidaches (5) - 2 freq benachie (5) - 2 freq herschel (5) - 1 freq |
hierarchies (0) - 2 freq heirarchies (2) - 1 freq hierarchy (4) - 2 freq hierarchical (5) - 1 freq boorachies (6) - 3 freq vratchies (6) - 1 freq searches (6) - 4 freq herries (6) - 4 freq hirtched (7) - 1 freq ratches (7) - 1 freq bourichies (7) - 1 freq airchis (7) - 1 freq hercules (7) - 208 freq marches (7) - 16 freq erches (7) - 1 freq patriarchis (7) - 1 freq resairches (7) - 2 freq preaches (7) - 2 freq hatches (7) - 4 freq branches (7) - 52 freq vratches (7) - 5 freq reaches (7) - 24 freq hurricanes (7) - 1 freq heroicis (7) - 2 freq hernishis (7) - 1 freq |
SoundEx code - H662 horrors - 18 freq 'horrorscopes' - 1 freq hierarchies - 2 freq horror's - 1 freq heirarchies - 1 freq harriers - 2 freq hierarchical - 1 freq hierarchy - 2 freq horrorseen - 1 freq |
MetaPhone code - HRRXS hierarchies - 2 freq heirarchies - 1 freq |
HIERARCHIES |
| Time to execute Levenshtein function - 0.315156 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.419625 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.035189 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.044040 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.001144 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. |