| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| herbaceous (0) - 5 freq curvaceous (3) - 2 freq herbourous (3) - 1 freq horace's (4) - 2 freq terraces (4) - 4 freq cerberus (4) - 15 freq herbours (4) - 2 freq heronious (4) - 3 freq hercus (4) - 1 freq hereaboots (4) - 31 freq gracious (4) - 9 freq pernicious (4) - 6 freq ferocious (4) - 4 freq herbeur (4) - 1 freq hermaness (4) - 1 freq racous (4) - 1 freq herbour (4) - 23 freq heraclitus (4) - 2 freq barbarous (4) - 3 freq hereabouts (4) - 5 freq hereabout (4) - 1 freq herbivores (5) - 1 freq hertie's (5) - 2 freq herders (5) - 1 freq racers (5) - 1 freq |
herbaceous (0) - 5 freq herbourous (4) - 1 freq hercus (5) - 1 freq hereaboots (5) - 31 freq hereabouts (5) - 5 freq herbours (5) - 2 freq curvaceous (5) - 2 freq barbarous (6) - 3 freq herbour (6) - 23 freq hereabout (6) - 1 freq harbours (6) - 2 freq hiraboots (6) - 2 freq herbs (6) - 14 freq heroicis (6) - 2 freq racous (6) - 1 freq cerberus (6) - 15 freq terraces (6) - 4 freq horace's (6) - 2 freq gracious (6) - 9 freq heronious (6) - 3 freq herbeur (6) - 1 freq ferocious (6) - 4 freq pernicious (6) - 6 freq raucous (7) - 8 freq herbie (7) - 11 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 - HRBSS herbaceous - 5 freq |
HERBACEOUS |
| Time to execute Levenshtein function - 0.229624 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.374769 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.029346 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.039085 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.000927 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. |