| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vacant (0) - 8 freq vacand (1) - 1 freq dacant (1) - 1 freq saicant (2) - 7 freq vacate (2) - 1 freq sacan (2) - 1 freq valiant (2) - 5 freq vacancy (2) - 2 freq dacent (2) - 14 freq vacantly (2) - 3 freq faant (2) - 1 freq vaunt (2) - 1 freq vagrant (2) - 1 freq acan (2) - 1 freq avant (2) - 1 freq laant (2) - 1 freq waant (2) - 93 freq variant (2) - 16 freq scant (2) - 34 freq cant (2) - 40 freq pedant (3) - 3 freq gaan (3) - 244 freq macaw (3) - 1 freq packet (3) - 62 freq pact (3) - 10 freq |
vacant (0) - 8 freq vacand (2) - 1 freq dacant (2) - 1 freq avant (3) - 1 freq vaunt (3) - 1 freq scant (3) - 34 freq vacantly (3) - 3 freq variant (3) - 16 freq cant (3) - 40 freq vacate (3) - 1 freq valiant (3) - 5 freq dacent (3) - 14 freq vacancy (3) - 2 freq saicant (3) - 7 freq daecent (4) - 8 freq cont (4) - 2 freq vaunty (4) - 2 freq saicont (4) - 173 freq raecent (4) - 3 freq accent (4) - 116 freq diacent (4) - 1 freq saicint (4) - 7 freq vincent (4) - 4 freq scent (4) - 67 freq saicent (4) - 1 freq |
SoundEx code - V253 vacant - 8 freq vicinity - 8 freq viszontlatdsra - 1 freq vacantly - 3 freq viscount - 2 freq visand - 1 freq voice-haunted - 1 freq vegemite's - 1 freq vacand - 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 |
VACANT |
| Time to execute Levenshtein function - 0.202818 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.355255 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.028563 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.036994 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.000877 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. |