| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hairps (0) - 2 freq hair's (1) - 18 freq harps (1) - 1 freq hairs (1) - 35 freq haips (1) - 1 freq hairpy (1) - 1 freq hairms (1) - 2 freq hairp (1) - 5 freq hairns (1) - 8 freq hairts (1) - 61 freq hair (2) - 867 freq haerts (2) - 19 freq chairs (2) - 63 freq raips (2) - 7 freq sairs (2) - 8 freq happs (2) - 2 freq hairt's (2) - 7 freq gairs (2) - 1 freq hairry (2) - 1 freq haippy (2) - 2 freq lairns (2) - 7 freq gairds (2) - 16 freq harp (2) - 9 freq harrys (2) - 2 freq jairus (2) - 3 freq |
hairps (0) - 2 freq harps (1) - 1 freq hairp (2) - 5 freq hairts (2) - 61 freq hairms (2) - 2 freq hairns (2) - 8 freq hairpy (2) - 1 freq hair's (2) - 18 freq hairs (2) - 35 freq haips (2) - 1 freq huirds (3) - 1 freq harpa (3) - 4 freq harks (3) - 1 freq hairies (3) - 4 freq halps (3) - 1 freq hairpin (3) - 3 freq hirs (3) - 5 freq nyirps (3) - 1 freq hayr's (3) - 1 freq chirps (3) - 2 freq hir's (3) - 1 freq haeps (3) - 4 freq hairse (3) - 14 freq harris (3) - 14 freq harns (3) - 52 freq |
SoundEx code - H612 harvester - 7 freq herbs - 14 freq hairvest - 19 freq harvest - 14 freq hervest - 10 freq harps - 1 freq harp-strung - 1 freq hye-raip's - 1 freq hairvist - 1 freq hairvestin - 1 freq 'hairvest - 1 freq hairvisters - 1 freq herbaceous - 5 freq hervist - 1 freq harvestit - 1 freq harpsichord - 2 freq hairps - 2 freq harvey-jones - 1 freq horrific - 7 freq hervestin - 1 freq herbst - 2 freq harvested - 1 freq harvieston - 1 freq hrbfc - 1 freq 'harvest' - 1 freq 'hervist' - 1 freq |
MetaPhone code - HRPS harps - 1 freq hairps - 2 freq |
HAIRPS |
| Time to execute Levenshtein function - 0.315264 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.676012 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.072379 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.083775 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.000816 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. |