| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hairpy (0) - 1 freq hairry (1) - 1 freq haippy (1) - 2 freq hairy (1) - 93 freq hairp (1) - 5 freq hairty (1) - 3 freq hairps (1) - 2 freq haily (2) - 27 freq haurly (2) - 16 freq hairdo (2) - 3 freq hairns (2) - 8 freq haary (2) - 3 freq hairst (2) - 188 freq hair's (2) - 21 freq hair (2) - 902 freq 'hairy (2) - 2 freq harpa (2) - 4 freq harry (2) - 202 freq maircy (2) - 1 freq mairy (2) - 7 freq nairly (2) - 1 freq chirpy (2) - 3 freq sairy (2) - 5 freq rairly (2) - 1 freq shairny (2) - 2 freq |
hairpy (0) - 1 freq hairp (1) - 5 freq harpa (2) - 4 freq harp (2) - 9 freq hairps (2) - 2 freq hairty (2) - 3 freq hairry (2) - 1 freq hairy (2) - 93 freq haippy (2) - 2 freq harly (3) - 13 freq hairt (3) - 341 freq hairse (3) - 14 freq haired (3) - 7 freq hardy (3) - 24 freq haip (3) - 7 freq hairs (3) - 38 freq hairm (3) - 63 freq hraip (3) - 1 freq haird (3) - 124 freq happy (3) - 764 freq shairp (3) - 80 freq harps (3) - 1 freq harray (3) - 3 freq hippy (3) - 4 freq hair (3) - 902 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 |
HAIRPY |
| Time to execute Levenshtein function - 0.363638 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 - 1.001444 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.029719 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.086335 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.000868 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. |