Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
vining (0) - 17 freq lining (1) - 1 freq dining (1) - 6 freq mining (1) - 5 freq viking (1) - 60 freq pining (1) - 1 freq fixing (2) - 3 freq firing (2) - 3 freq filing (2) - 1 freq winding (2) - 2 freq viewing (2) - 6 freq minin (2) - 26 freq gaining (2) - 2 freq piling (2) - 1 freq linins (2) - 1 freq rising (2) - 14 freq finding (2) - 16 freq hinging (2) - 11 freq vinna (2) - 1 freq waning (2) - 1 freq binding (2) - 1 freq ginin (2) - 1 freq pinting (2) - 1 freq airing (2) - 1 freq jinking (2) - 1 freq |
vining (0) - 17 freq pining (2) - 1 freq lining (2) - 1 freq viking (2) - 60 freq evening (2) - 75 freq dining (2) - 6 freq mining (2) - 5 freq jyning (3) - 2 freq ruining (3) - 3 freq vinny (3) - 2 freq voting (3) - 27 freq haining (3) - 6 freq raining (3) - 5 freq vying (3) - 1 freq waning (3) - 1 freq evinin (3) - 1 freq inning (3) - 1 freq hinng (3) - 1 freq finng (3) - 1 freq gaining (3) - 2 freq ning (3) - 1 freq viewing (3) - 6 freq owning (3) - 1 freq tuning (3) - 6 freq vinna (3) - 1 freq |
SoundEx code - V552 vining - 17 freq vining's - 1 freq venomous - 1 freq |
MetaPhone code - FNNK funning - 1 freq vining - 17 freq phoning - 4 freq |
VINING |
Time to execute Levenshtein function - 0.226539 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.444112 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.035965 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.043385 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.001312 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. |