| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vipers (0) - 5 freq viper (1) - 1 freq vivers (1) - 1 freq wipers (1) - 4 freq pipers (1) - 10 freq hikers (2) - 2 freq vers (2) - 1 freq timers (2) - 5 freq vibes (2) - 6 freq mixers (2) - 1 freq capers (2) - 7 freq uppers (2) - 2 freq vices (2) - 12 freq videos (2) - 19 freq eilers (2) - 1 freq vigurs (2) - 1 freq lippers (2) - 9 freq paipers (2) - 5 freq divers (2) - 10 freq vicars (2) - 1 freq ripens (2) - 2 freq livers (2) - 1 freq topers (2) - 1 freq fivers (2) - 3 freq voters (2) - 63 freq |
vipers (0) - 5 freq pipers (2) - 10 freq wipers (2) - 4 freq viper (2) - 1 freq vivers (2) - 1 freq topers (3) - 1 freq veivers (3) - 1 freq lepers (3) - 4 freq voters (3) - 63 freq vicars (3) - 1 freq leipers (3) - 2 freq veers (3) - 1 freq rypers (3) - 1 freq neipers (3) - 2 freq japers (3) - 15 freq paipers (3) - 5 freq piers (3) - 7 freq vigurs (3) - 1 freq capers (3) - 7 freq veiper's (3) - 1 freq vers (3) - 1 freq viewers (3) - 6 freq vapours (3) - 1 freq uppers (3) - 2 freq pers (3) - 1 freq |
SoundEx code - V162 veiper's - 1 freq vipers - 5 freq vapours - 1 freq veivers - 1 freq vivers - 1 freq |
MetaPhone code - FPRS veiper's - 1 freq vipers - 5 freq vapours - 1 freq |
VIPERS |
| Time to execute Levenshtein function - 0.179113 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.354500 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.027607 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.037055 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. |