| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vacand (0) - 1 freq vacant (1) - 8 freq baand (2) - 13 freq sacan (2) - 1 freq acan (2) - 1 freq waand (2) - 2 freq saand (2) - 13 freq vacate (2) - 1 freq vacancy (2) - 2 freq makand (2) - 1 freq haand (2) - 104 freq taand (2) - 1 freq acad (2) - 2 freq laand (2) - 69 freq vand (2) - 2 freq aand (2) - 1 freq saiand (2) - 1 freq acnd (2) - 1 freq visand (2) - 1 freq dacant (2) - 1 freq daean (3) - 8 freq vald (3) - 1 freq paad (3) - 1 freq saan (3) - 1 freq vrans (3) - 1 freq |
vacand (0) - 1 freq vacant (2) - 8 freq acnd (3) - 1 freq vacancy (3) - 2 freq visand (3) - 1 freq vand (3) - 2 freq cind (4) - 2 freq secund (4) - 1 freq avacado (4) - 1 freq ascend (4) - 7 freq vconi (4) - 1 freq secind (4) - 1 freq veranda (4) - 5 freq saecond (4) - 3 freq voican (4) - 1 freq vyced (4) - 3 freq cnd (4) - 8 freq jacinda (4) - 1 freq second (4) - 377 freq vynd (4) - 4 freq qcind (4) - 1 freq vaned (4) - 1 freq candy (4) - 23 freq saicond (4) - 11 freq vcons (4) - 1 freq |
SoundEx code - V253 vacant - 8 freq vicinity - 8 freq viszontlatdsra - 1 freq viscount - 2 freq visand - 1 freq voice-haunted - 1 freq vegemite's - 1 freq vacand - 1 freq vacantly - 1 freq vignettes - 1 freq vaccinations - 2 freq vaccination - 1 freq vicssundays - 1 freq |
MetaPhone code - FKNT vacant - 8 freq vacand - 1 freq €˜facund - 1 freq fcnwd - 1 freq |
VACAND |
| Time to execute Levenshtein function - 0.202923 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.353960 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.027872 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.038314 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.000813 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. |