| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hairp (0) - 5 freq hairpy (1) - 1 freq hairt (1) - 341 freq haip (1) - 7 freq hairy (1) - 93 freq hairs (1) - 38 freq shairp (1) - 80 freq haird (1) - 124 freq hair' (1) - 2 freq hairb (1) - 1 freq hair (1) - 902 freq harp (1) - 9 freq hairm (1) - 63 freq hairps (1) - 2 freq 'airs (2) - 1 freq hairty (2) - 3 freq sair (2) - 786 freq haired (2) - 7 freq shaire (2) - 8 freq haur (2) - 1 freq haime (2) - 26 freq harz (2) - 1 freq haard (2) - 17 freq haary (2) - 3 freq sharp (2) - 90 freq |
hairp (0) - 5 freq hairpy (1) - 1 freq harp (1) - 9 freq hair (2) - 902 freq hraip (2) - 1 freq hairb (2) - 1 freq hrp (2) - 1 freq harpa (2) - 4 freq hairps (2) - 2 freq hairm (2) - 63 freq hairt (2) - 341 freq haip (2) - 7 freq hair' (2) - 2 freq hairy (2) - 93 freq hairs (2) - 38 freq haird (2) - 124 freq shairp (2) - 80 freq hir (3) - 1279 freq harr (3) - 2 freq heirt (3) - 4 freq haap (3) - 1 freq hasp (3) - 2 freq halp (3) - 54 freq harm (3) - 22 freq hlrp (3) - 1 freq |
SoundEx code - H610 harp - 9 freq hairp - 5 freq hereby - 3 freq herb - 2 freq hairb - 1 freq harvey - 5 freq hrv - 1 freq her've - 1 freq harpa - 4 freq hairfaa - 1 freq hairpy - 1 freq herbie - 11 freq harvie - 3 freq hrf - 1 freq hraip - 1 freq hrp - 1 freq |
MetaPhone code - HRP harp - 9 freq hairp - 5 freq harpa - 4 freq hairpy - 1 freq |
HAIRP |
| Time to execute Levenshtein function - 0.231022 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.357918 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.028714 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.038078 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.000885 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. |