| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hairvist (0) - 1 freq hairvest (1) - 19 freq hairriet (2) - 2 freq hervist (2) - 1 freq hairst (2) - 188 freq harvest (2) - 16 freq 'hairvest (2) - 1 freq hairrit (2) - 1 freq cairvit (2) - 4 freq airtist (2) - 15 freq hairse (3) - 14 freq airis (3) - 1 freq hardest (3) - 17 freq vainist (3) - 1 freq airnest (3) - 2 freq harriet (3) - 1 freq huirst (3) - 1 freq gairdit (3) - 6 freq carvit (3) - 6 freq harnish (3) - 2 freq hiatrist (3) - 1 freq pairis (3) - 2 freq hervest (3) - 10 freq mairriet (3) - 55 freq airmit (3) - 4 freq |
hairvist (0) - 1 freq hairvest (1) - 19 freq hervist (2) - 1 freq harvest (2) - 16 freq hervest (3) - 10 freq hairst (3) - 188 freq 'hairvest (3) - 1 freq hivviest (4) - 1 freq hairset (4) - 3 freq huirst (4) - 1 freq hardiest (4) - 2 freq ahrtist (4) - 1 freq haurdest (4) - 1 freq haarst (4) - 1 freq hirst (4) - 2 freq hairvestin (4) - 1 freq airtist (4) - 15 freq cairvit (4) - 4 freq hardest (4) - 17 freq hairrit (4) - 1 freq hairriet (4) - 2 freq heaviest (5) - 2 freq artist (5) - 27 freq hairps (5) - 2 freq hairless (5) - 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 - HRFST hairvest - 19 freq harvest - 16 freq hervest - 10 freq hairvist - 1 freq 'hairvest - 1 freq hervist - 1 freq 'harvest' - 1 freq 'hervist' - 1 freq |
HAIRVIST |
| Time to execute Levenshtein function - 0.216176 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.397301 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.027732 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.042506 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.000870 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. |