| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| harvested (0) - 1 freq harvester (1) - 7 freq harnessed (2) - 4 freq harvestit (2) - 1 freq havester (2) - 1 freq harvest (2) - 16 freq arrested (2) - 15 freq harrased (3) - 1 freq perverted (3) - 2 freq caressed (3) - 2 freq hardened (3) - 6 freq haeted (3) - 1 freq hervestin (3) - 1 freq harrassed (3) - 2 freq harassed (3) - 1 freq attested (3) - 4 freq rested (3) - 12 freq hairvestin (3) - 1 freq harvieston (3) - 1 freq vested (3) - 2 freq 'harvest' (3) - 1 freq crested (3) - 2 freq marvelled (3) - 1 freq hervest (3) - 10 freq targeted (3) - 5 freq |
harvested (0) - 1 freq harvester (2) - 7 freq harvest (3) - 16 freq harvestit (3) - 1 freq hervest (4) - 10 freq hairvestin (4) - 1 freq hervestin (4) - 1 freq harvieston (4) - 1 freq hairsted (4) - 1 freq arrested (4) - 15 freq hairvest (4) - 19 freq havester (4) - 1 freq harnessed (4) - 4 freq invested (5) - 3 freq hardest (5) - 17 freq hervist (5) - 1 freq hasted (5) - 2 freq hairvist (5) - 1 freq hamesteid (5) - 3 freq 'harvest' (5) - 1 freq crested (5) - 2 freq harrased (5) - 1 freq harassed (5) - 1 freq harrassed (5) - 2 freq rested (5) - 12 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 - HRFSTT harvestit - 1 freq harvested - 1 freq |
HARVESTED |
| Time to execute Levenshtein function - 0.315393 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.465991 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.032271 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.046510 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.002114 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. |