| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vineyards (0) - 3 freq vineyard (1) - 7 freq vineyairds (1) - 2 freq vineyaird (2) - 9 freq oil-yards (3) - 1 freq vinegary (3) - 1 freq inwards (3) - 7 freq innards (3) - 4 freq vinegar (3) - 18 freq vinyaird (3) - 3 freq inhauds (4) - 3 freq onwards (4) - 19 freq cornyards (4) - 1 freq veneers (4) - 1 freq linear (4) - 3 freq velars (4) - 1 freq lizards (4) - 4 freq nyargs (4) - 1 freq stewards (4) - 4 freq vinnys (4) - 1 freq fitwards (4) - 1 freq inward (4) - 7 freq disregards (4) - 1 freq minerals (4) - 4 freq halyards (4) - 1 freq |
vineyards (0) - 3 freq vineyairds (1) - 2 freq vineyard (2) - 7 freq vineyaird (3) - 9 freq vinyaird (4) - 3 freq innards (4) - 4 freq inwards (5) - 7 freq veneers (5) - 1 freq viands (5) - 3 freq oil-yards (5) - 1 freq inroads (5) - 4 freq vicars (6) - 1 freq innarts (6) - 1 freq yards (6) - 24 freq liners (6) - 2 freq einar's (6) - 6 freq an'ards (6) - 1 freq jiners (6) - 6 freq beards (6) - 12 freq lanyard (6) - 1 freq vivers (6) - 1 freq baneyerd (6) - 1 freq inwairds (6) - 1 freq rewards (6) - 6 freq miners (6) - 41 freq |
SoundEx code - V563 vineyairds - 2 freq vineyaird - 9 freq vineyards - 3 freq vineyard - 7 freq vinyaird - 3 freq |
MetaPhone code - FNYRTS vineyairds - 2 freq vineyards - 3 freq |
VINEYARDS |
| Time to execute Levenshtein function - 0.258394 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.430352 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.037362 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.039743 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.000955 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. |