| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| harvieston (0) - 1 freq arniston (3) - 2 freq hardiest (3) - 2 freq hairvestin (3) - 1 freq harvester (3) - 7 freq charleston (3) - 2 freq murdieston (3) - 1 freq harvestit (3) - 1 freq arkleston (3) - 1 freq harrison (3) - 5 freq laurieston (3) - 2 freq hermiston (3) - 1 freq hervestin (3) - 1 freq harvest (3) - 16 freq harvested (3) - 1 freq darlington (4) - 1 freq heston (4) - 1 freq hardest (4) - 17 freq hureson (4) - 1 freq harprest (4) - 1 freq hackston (4) - 14 freq hairstin (4) - 14 freq jamieson (4) - 21 freq carlyeaston (4) - 1 freq charlestoun (4) - 1 freq |
harvieston (0) - 1 freq hervestin (3) - 1 freq hairvestin (3) - 1 freq harvestit (4) - 1 freq harvest (4) - 16 freq hermiston (4) - 1 freq harvester (4) - 7 freq harvested (4) - 1 freq hervist (5) - 1 freq hervest (5) - 10 freq hairvest (5) - 19 freq hairstin (5) - 14 freq hairvist (5) - 1 freq murdieston (5) - 1 freq hardiest (5) - 2 freq laurieston (5) - 2 freq arniston (5) - 2 freq charleston (5) - 2 freq harrison (5) - 5 freq hivviest (6) - 1 freq heaviest (6) - 2 freq arrestin (6) - 2 freq gravestone (6) - 2 freq hailstone (6) - 1 freq houliston (6) - 2 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 - HRFSTN hairvestin - 1 freq hervestin - 1 freq harvieston - 1 freq |
HARVIESTON |
| Time to execute Levenshtein function - 0.202442 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.398837 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.031468 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.046275 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.001146 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. |