| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vineyaird (0) - 9 freq vineyairds (1) - 2 freq vineyard (1) - 7 freq vinyaird (1) - 3 freq vineyards (2) - 3 freq vinegar (3) - 18 freq vinegary (3) - 1 freq vangaird (3) - 1 freq kinnaird (3) - 1 freq kirkyaird (3) - 82 freq annelaird (3) - 1 freq diregaird (3) - 1 freq kailyaird (4) - 11 freq rewaird (4) - 8 freq sidebuird (4) - 1 freq yin-wird (4) - 1 freq baneyerd (4) - 1 freq sinclair (4) - 13 freq twa-yaird (4) - 1 freq yaird (4) - 88 freq misregaird (4) - 1 freq ainward (4) - 4 freq recaird (4) - 1 freq dockyaird (4) - 1 freq firebird (4) - 1 freq |
vineyaird (0) - 9 freq vineyard (1) - 7 freq vinyaird (1) - 3 freq vineyairds (2) - 2 freq vineyards (3) - 3 freq vangaird (4) - 1 freq vanguard (5) - 5 freq baneyerd (5) - 1 freq lanyard (5) - 1 freq annelaird (5) - 1 freq vinegary (5) - 1 freq vinegar (5) - 18 freq kinnaird (5) - 1 freq veneers (6) - 1 freq veinegar (6) - 1 freq vaned (6) - 1 freq ventired (6) - 4 freq inward (6) - 7 freq lanlaird (6) - 1 freq vinland (6) - 2 freq venera (6) - 2 freq minzard (6) - 1 freq inlaid (6) - 3 freq eyvind (6) - 2 freq kincaid (6) - 1 freq |
SoundEx code - V563 vineyairds - 2 freq vineyaird - 9 freq vineyards - 3 freq vineyard - 7 freq vinyaird - 3 freq |
MetaPhone code - FNYRT vineyaird - 9 freq vineyard - 7 freq vinyaird - 3 freq |
VINEYAIRD |
| Time to execute Levenshtein function - 0.191673 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.387245 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.027600 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.037498 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.000956 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. |