| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hervestin (0) - 1 freq hairvestin (2) - 1 freq terestin (2) - 1 freq hervest (2) - 10 freq harvestit (2) - 1 freq mervelin (3) - 1 freq jeestin (3) - 1 freq hervist (3) - 1 freq divestin (3) - 1 freq investin (3) - 6 freq fermentin (3) - 1 freq reestin (3) - 1 freq hermiston (3) - 1 freq tarvesmin (3) - 1 freq erectin (3) - 1 freq herein (3) - 7 freq herdest (3) - 1 freq hert-sten (3) - 1 freq harvester (3) - 7 freq bequestin (3) - 1 freq pervertit (3) - 1 freq hertenin (3) - 8 freq pertectin (3) - 2 freq herkenin (3) - 1 freq harvieston (3) - 1 freq |
hervestin (0) - 1 freq hairvestin (2) - 1 freq harvieston (3) - 1 freq harvestit (3) - 1 freq hervest (3) - 10 freq harvester (4) - 7 freq harvest (4) - 14 freq hermiston (4) - 1 freq harvested (4) - 1 freq terestin (4) - 1 freq hervist (4) - 1 freq investin (5) - 6 freq hairvest (5) - 19 freq everlestin (5) - 1 freq revertin (5) - 2 freq arrestin (5) - 2 freq hertstaen (5) - 1 freq heistin (5) - 1 freq hairstin (5) - 14 freq reveesitin (5) - 1 freq restin (5) - 29 freq hertstane (5) - 1 freq tarvesmin (5) - 1 freq herdest (5) - 1 freq hert-sten (5) - 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 - HRFSTN hairvestin - 1 freq hervestin - 1 freq harvieston - 1 freq |
HERVESTIN |
| Time to execute Levenshtein function - 0.220863 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.379186 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.027723 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.037180 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.000782 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. |