| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hairband (0) - 1 freq hairtland (2) - 1 freq gairland (2) - 1 freq airland (2) - 2 freq haifand (2) - 1 freq airmband (2) - 1 freq hat-band (2) - 1 freq hairtlands (3) - 1 freq hairbour (3) - 7 freq hairns (3) - 8 freq tarland (3) - 4 freq yirbard (3) - 1 freq fairyland (3) - 1 freq haroan (3) - 1 freq tairtan (3) - 2 freq mainland (3) - 19 freq harman (3) - 1 freq tirrand (3) - 3 freq mairlan (3) - 1 freq hairber (3) - 35 freq hairpins (3) - 1 freq waistband (3) - 2 freq riband (3) - 1 freq maitland (3) - 27 freq haired (3) - 7 freq |
hairband (0) - 1 freq hairdened (4) - 1 freq husband (4) - 74 freq hat-band (4) - 1 freq riband (4) - 1 freq huband (4) - 1 freq airmband (4) - 1 freq gairland (4) - 1 freq hairtland (4) - 1 freq haifand (4) - 1 freq airland (4) - 2 freq harraed (5) - 2 freq tirbans (5) - 1 freq faireland (5) - 1 freq hairken (5) - 4 freq armand (5) - 1 freq harkan (5) - 2 freq hairbur (5) - 1 freq airbnb (5) - 1 freq hambane (5) - 1 freq haerald (5) - 1 freq hieland (5) - 16 freq haand (5) - 104 freq hairten (5) - 1 freq bairbed (5) - 1 freq |
SoundEx code - H615 horfinn - 1 freq hairpins - 1 freq harbinger - 2 freq harpoon - 8 freq harpooner - 5 freq harpoons - 3 freq harbingers - 2 freq hairpin - 3 freq harpooned - 1 freq hairband - 1 freq hrvmam - 1 freq |
MetaPhone code - HRBNT hairband - 1 freq |
HAIRBAND |
| Time to execute Levenshtein function - 0.283293 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.679357 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.037203 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.076463 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.005089 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. |