| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vineyairds (0) - 2 freq vineyards (1) - 3 freq vineyaird (1) - 9 freq vineyard (2) - 7 freq vinyaird (2) - 3 freq kirkyairds (3) - 10 freq inwairds (3) - 1 freq kirkyaird's (4) - 1 freq innards (4) - 4 freq sinclairs (4) - 1 freq eairds (4) - 2 freq annelaird (4) - 1 freq kirkyaird (4) - 82 freq orkneywirds (4) - 3 freq inwards (4) - 7 freq sinclair's (4) - 1 freq vinegar (4) - 18 freq vangaird (4) - 1 freq oil-yards (4) - 1 freq keywirds (4) - 1 freq graveyairds (4) - 4 freq diregaird (4) - 1 freq kinnaird (4) - 1 freq viseetirs (4) - 1 freq yairds (4) - 51 freq |
vineyairds (0) - 2 freq vineyards (1) - 3 freq vineyaird (2) - 9 freq vineyard (3) - 7 freq vinyaird (3) - 3 freq innards (5) - 4 freq inwairds (5) - 1 freq keywirds (6) - 1 freq oil-yards (6) - 1 freq yairds (6) - 51 freq rewairds (6) - 1 freq vangaird (6) - 1 freq kailyairds (6) - 1 freq regairds (6) - 15 freq inwards (6) - 7 freq inroads (6) - 4 freq eairds (6) - 2 freq viands (6) - 3 freq veneers (6) - 1 freq kirkyairds (6) - 10 freq retards (7) - 1 freq niroads (7) - 2 freq miner's (7) - 2 freq anyroads (7) - 1 freq nears (7) - 3 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 |
VINEYAIRDS |
| Time to execute Levenshtein function - 0.305907 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.574800 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.029098 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.068733 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.001065 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. |