| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| voting (0) - 27 freq votin (1) - 45 freq toting (1) - 1 freq costing (2) - 1 freq boeing (2) - 1 freq mating (2) - 1 freq viking (2) - 60 freq joking (2) - 1 freq boring (2) - 14 freq notin (2) - 6 freq boating (2) - 1 freq hosing (2) - 1 freq ootin' (2) - 1 freq vying (2) - 1 freq coping (2) - 2 freq hooting (2) - 1 freq nothing (2) - 91 freq acting (2) - 12 freq ootin (2) - 5 freq poking (2) - 5 freq touting (2) - 1 freq biting (2) - 1 freq jotting (2) - 6 freq rowting (2) - 1 freq do-ing (2) - 1 freq |
voting (0) - 27 freq toting (2) - 1 freq votin (2) - 45 freq booting (3) - 2 freq vomiting (3) - 1 freq touting (3) - 1 freq vining (3) - 17 freq biting (3) - 1 freq coating (3) - 1 freq quoting (3) - 3 freq eating (3) - 18 freq dating (3) - 8 freq hooting (3) - 1 freq ting (3) - 49 freq acting (3) - 12 freq boating (3) - 1 freq sting (3) - 12 freq rating (3) - 1 freq viking (3) - 60 freq vying (3) - 1 freq mating (3) - 1 freq outing (3) - 2 freq sorting (4) - 2 freq taing (4) - 10 freq editing (4) - 3 freq |
SoundEx code - V352 voting - 27 freq votingday - 1 freq |
MetaPhone code - FTNK feeding - 10 freq fading - 7 freq fitting - 9 freq voting - 27 freq |
VOTING |
| Time to execute Levenshtein function - 0.192428 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.336476 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.028826 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.037048 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.000912 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. |