| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| harvester (0) - 7 freq havester (1) - 1 freq harvested (1) - 1 freq harvest (2) - 14 freq harvestit (2) - 1 freq haister (3) - 2 freq hairster (3) - 1 freq hereefter (3) - 3 freq hardest (3) - 17 freq hairvestin (3) - 1 freq haeter (3) - 2 freq arrested (3) - 15 freq harnessed (3) - 4 freq 'harvest' (3) - 1 freq hervest (3) - 10 freq harsher (3) - 2 freq forester (3) - 3 freq hervestin (3) - 1 freq hairvisters (3) - 1 freq barchester (3) - 1 freq barrister (3) - 1 freq haimster (3) - 2 freq hamster (3) - 5 freq hairvest (3) - 19 freq gaavster (3) - 1 freq |
harvester (0) - 7 freq harvested (2) - 1 freq havester (2) - 1 freq harvestit (3) - 1 freq harvest (3) - 14 freq hairvisters (4) - 1 freq hairvest (4) - 19 freq hervest (4) - 10 freq hairvestin (4) - 1 freq hairster (4) - 1 freq harvieston (4) - 1 freq hervestin (4) - 1 freq barrister (5) - 1 freq hervist (5) - 1 freq gaavster (5) - 1 freq haimster (5) - 2 freq hamster (5) - 5 freq hereefter (5) - 3 freq haister (5) - 2 freq forester (5) - 3 freq hairvist (5) - 1 freq hardest (5) - 17 freq harsher (5) - 2 freq 'harvest' (5) - 1 freq hairsters (6) - 4 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 - HRFSTR harvester - 7 freq |
HARVESTER |
| Time to execute Levenshtein function - 0.218335 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.370643 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.027127 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.036811 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.000863 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. |