| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| victuals (0) - 5 freq victual (1) - 1 freq vitals (2) - 1 freq virtual (2) - 37 freq rituals (2) - 3 freq vittals (2) - 2 freq victoary (3) - 1 freq actual (3) - 109 freq victor's (3) - 2 freq ritual (3) - 15 freq vistas (3) - 3 freq factual (3) - 9 freq richual (3) - 1 freq 'virtual' (3) - 1 freq vicars (3) - 1 freq visual (3) - 5 freq pictures (3) - 79 freq ectual (3) - 3 freq aictully (3) - 1 freq picturl (3) - 1 freq victries (3) - 1 freq virtually (3) - 13 freq virtuous (3) - 3 freq victors (3) - 1 freq picturs (3) - 61 freq |
victuals (0) - 5 freq victual (2) - 1 freq vittals (3) - 2 freq vitals (3) - 1 freq victors (4) - 1 freq victries (4) - 1 freq victims (4) - 10 freq virtual (4) - 37 freq rituals (4) - 3 freq virtues (5) - 7 freq virtuous (5) - 3 freq virtually (5) - 13 freq vicous (5) - 1 freq rictus (5) - 2 freq vittles (5) - 1 freq victories (5) - 5 freq actual (5) - 109 freq vital (5) - 31 freq picturs (5) - 61 freq victoary (5) - 1 freq factual (5) - 9 freq victor's (5) - 2 freq vistas (5) - 3 freq vicars (5) - 1 freq recitals (5) - 2 freq |
SoundEx code - V234 vastly - 3 freq victuals - 5 freq victual - 1 freq visitwales - 1 freq |
MetaPhone code - FKTLS victuals - 5 freq |
VICTUALS |
| Time to execute Levenshtein function - 0.411723 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.785513 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.027765 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.078469 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.000875 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. |