| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| herbs (0) - 14 freq serbs (1) - 2 freq heris (1) - 1 freq heros (1) - 1 freq herds (1) - 19 freq heres (1) - 8 freq verbs (1) - 98 freq herrs (1) - 1 freq her's (1) - 3 freq yerbs (1) - 2 freq kerbs (1) - 3 freq herb (1) - 2 freq herks (1) - 1 freq herbst (1) - 2 freq hers (1) - 84 freq herts (1) - 119 freq jerbs (1) - 1 freq herns (1) - 1 freq perts (2) - 6 freq heals (2) - 5 freq hor's (2) - 1 freq hereby (2) - 3 freq hesps (2) - 2 freq sherks (2) - 2 freq he's (2) - 1749 freq |
herbs (0) - 14 freq herks (2) - 1 freq herb (2) - 2 freq kerbs (2) - 3 freq herbst (2) - 2 freq herts (2) - 119 freq herns (2) - 1 freq jerbs (2) - 1 freq yerbs (2) - 2 freq hers (2) - 84 freq heris (2) - 1 freq her's (2) - 3 freq serbs (2) - 2 freq herds (2) - 19 freq heros (2) - 1 freq verbs (2) - 98 freq herrs (2) - 1 freq heres (2) - 8 freq hibs (3) - 45 freq here's (3) - 265 freq hears (3) - 46 freq heresy (3) - 3 freq barbs (3) - 1 freq hir's (3) - 1 freq haerts (3) - 19 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 - HRBS herbs - 14 freq |
HERBS |
| Time to execute Levenshtein function - 0.214179 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.376379 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.032156 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.044257 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.001039 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. |