| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hairvest (0) - 19 freq hairvist (1) - 1 freq harvest (1) - 16 freq 'hairvest (1) - 1 freq hairtet (2) - 1 freq airnest (2) - 2 freq faircest (2) - 1 freq hairies (2) - 4 freq lairgest (2) - 9 freq wairmest (2) - 2 freq shairpest (2) - 2 freq sairves (2) - 1 freq hairset (2) - 3 freq sairest (2) - 4 freq hairvestin (2) - 1 freq fairest (2) - 7 freq hairst (2) - 188 freq haurdest (2) - 1 freq cairves (2) - 2 freq hardest (2) - 17 freq hairnet (2) - 2 freq hairless (2) - 2 freq hervest (2) - 10 freq dairkest (2) - 3 freq warmest (3) - 5 freq |
hairvest (0) - 19 freq hairvist (1) - 1 freq harvest (1) - 16 freq hervest (2) - 10 freq 'hairvest (2) - 1 freq hairst (3) - 188 freq haurdest (3) - 1 freq hervist (3) - 1 freq hardest (3) - 17 freq hairset (3) - 3 freq hairvestin (3) - 1 freq hivviest (4) - 1 freq herdest (4) - 1 freq dairkest (4) - 3 freq hirst (4) - 2 freq harvestit (4) - 1 freq huirst (4) - 1 freq harvested (4) - 1 freq hardiest (4) - 2 freq haarst (4) - 1 freq harvester (4) - 7 freq hairnet (4) - 2 freq hairless (4) - 2 freq wairmest (4) - 2 freq hairies (4) - 4 freq |
SoundEx code - H612 harvester - 7 freq herbs - 14 freq hairvest - 19 freq harvest - 16 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 - HRFST hairvest - 19 freq harvest - 16 freq hervest - 10 freq hairvist - 1 freq 'hairvest - 1 freq hervist - 1 freq 'harvest' - 1 freq 'hervist' - 1 freq |
HAIRVEST |
| Time to execute Levenshtein function - 0.221291 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.337381 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.027654 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.037066 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.000961 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. |