| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| heicher-order (0) - 1 freq heathermorven (5) - 1 freq heather-broon (6) - 1 freq heich-chief (6) - 1 freq wird-order (6) - 3 freq heicher (6) - 30 freq theorder (6) - 1 freq heychester (6) - 1 freq weel-ordert (6) - 1 freq leitherarie (6) - 1 freq mail-order (6) - 1 freq chorder (6) - 2 freq pre-order (6) - 2 freq auchterarder (6) - 5 freq filler-outer (6) - 1 freq aither-or (6) - 1 freq recorder (6) - 8 freq heirder (6) - 1 freq mither-side (6) - 1 freq heichrife (6) - 1 freq highlander (7) - 7 freq here-efter (7) - 3 freq nivermore (7) - 1 freq keichened (7) - 1 freq peched-oot (7) - 1 freq |
heicher-order (0) - 1 freq pre-order (9) - 2 freq auchterarder (9) - 5 freq chorder (9) - 2 freq sicht-reader (9) - 1 freq heathermorven (9) - 1 freq schreuder (10) - 14 freq hochered (10) - 1 freq aither-or (10) - 1 freq recorder (10) - 8 freq heich-heidit (10) - 6 freq mither-side (10) - 1 freq heirder (10) - 1 freq thunner-rider (10) - 1 freq heichrife (10) - 1 freq heich-chief (10) - 1 freq wird-order (10) - 3 freq mail-order (10) - 1 freq heicher (10) - 30 freq heather-broon (10) - 1 freq heychester (10) - 1 freq heich-leid (10) - 1 freq theorder (10) - 1 freq hairder (11) - 16 freq hungerford (11) - 1 freq |
SoundEx code - H266 heicher-order - 1 freq |
MetaPhone code - HXRRTR heicher-order - 1 freq |
HEICHER-ORDER |
| Time to execute Levenshtein function - 0.266309 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.403930 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.032066 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.041264 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.000904 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. |