| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| items (0) - 21 freq eitems (1) - 2 freq item (1) - 17 freq tems (1) - 1 freq stems (1) - 10 freq ideas (2) - 148 freq sters (2) - 1 freq feems (2) - 1 freq fite's (2) - 1 freq 'tes (2) - 1 freq ite (2) - 3 freq bites (2) - 23 freq biters (2) - 2 freq tams (2) - 4 freq iles (2) - 3 freq teams (2) - 84 freq tels (2) - 4 freq itis (2) - 1 freq itwes (2) - 1 freq cites (2) - 12 freq aitms (2) - 1 freq weems (2) - 1 freq steps (2) - 207 freq stem (2) - 18 freq atoms (2) - 8 freq |
items (0) - 21 freq tems (1) - 1 freq eitems (1) - 2 freq tims (2) - 8 freq atoms (2) - 8 freq tums (2) - 1 freq teams (2) - 84 freq teems (2) - 1 freq toms (2) - 1 freq eetems (2) - 1 freq tams (2) - 4 freq aitms (2) - 1 freq item (2) - 17 freq stems (2) - 10 freq ters (3) - 1 freq steams (3) - 2 freq tamas (3) - 4 freq tymes (3) - 14 freq poems (3) - 279 freq dems (3) - 6 freq tens (3) - 13 freq totems (3) - 3 freq naems (3) - 16 freq tees (3) - 3 freq jeems (3) - 91 freq |
SoundEx code - I352 i-dinna-ken-whaur - 1 freq it-yince - 1 freq idioms - 8 freq it-yinst - 1 freq items - 21 freq i-dinna-ken-whit - 1 freq i'dunce - 1 freq i'things - 3 freq i'thing - 4 freq idyims - 2 freq itmustveshifted - 1 freq |
MetaPhone code - ITMS idioms - 8 freq items - 21 freq |
ITEMS |
| Time to execute Levenshtein function - 0.171737 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.340997 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.028851 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.038454 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.000969 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. |