| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| harvest (0) - 14 freq hardest (1) - 17 freq hairvest (1) - 19 freq hervest (1) - 10 freq sarves (2) - 2 freq rarest (2) - 4 freq harvested (2) - 1 freq harvey (2) - 5 freq havert (2) - 1 freq harvestit (2) - 1 freq arrest (2) - 9 freq havent (2) - 3 freq herdest (2) - 1 freq fardest (2) - 4 freq earnest (2) - 13 freq narrest (2) - 6 freq haavert (2) - 1 freq darkest (2) - 14 freq harkent (2) - 1 freq hanest (2) - 1 freq harness (2) - 14 freq wharves (2) - 1 freq hairvist (2) - 1 freq hervist (2) - 1 freq largest (2) - 4 freq |
harvest (0) - 14 freq hairvest (1) - 19 freq hervest (1) - 10 freq hervist (2) - 1 freq hairvist (2) - 1 freq hardest (2) - 17 freq haurdest (3) - 1 freq herdest (3) - 1 freq harvestit (3) - 1 freq harvested (3) - 1 freq hardiest (3) - 2 freq harvester (3) - 7 freq 'hairvest (3) - 1 freq bravest (4) - 5 freq hares (4) - 14 freq harvieston (4) - 1 freq harnesh (4) - 1 freq tarves (4) - 8 freq hirst (4) - 2 freq hairvestin (4) - 1 freq herst (4) - 6 freq hervestin (4) - 1 freq herbst (4) - 2 freq hairset (4) - 3 freq hivviest (4) - 1 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 - HRFST hairvest - 19 freq harvest - 14 freq hervest - 10 freq hairvist - 1 freq 'hairvest - 1 freq hervist - 1 freq 'harvest' - 1 freq 'hervist' - 1 freq |
HARVEST |
| Time to execute Levenshtein function - 0.226584 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.470311 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.027395 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.074752 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.000860 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. |