| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| veeper (0) - 2 freq keeper (1) - 43 freq deeper (1) - 51 freq neeper (1) - 5 freq teeter (2) - 1 freq peever (2) - 1 freq vupper (2) - 1 freq seeger (2) - 1 freq seerer (2) - 1 freq reepepr (2) - 1 freq paeper (2) - 3 freq deener (2) - 3 freq veer (2) - 1 freq eeger (2) - 1 freq peiper (2) - 1 freq temper (2) - 50 freq feeder (2) - 5 freq peyper (2) - 1 freq peepee (2) - 18 freq neepur (2) - 1 freq neeber (2) - 2 freq heeder (2) - 1 freq beemer (2) - 2 freq eever (2) - 2 freq viper (2) - 1 freq |
veeper (0) - 2 freq neeper (2) - 5 freq deeper (2) - 51 freq viper (2) - 1 freq keeper (2) - 43 freq veneer (3) - 1 freq neepur (3) - 1 freq viewer (3) - 4 freq eever (3) - 2 freq reaper (3) - 16 freq neiper (3) - 6 freq leper (3) - 2 freq deepur (3) - 1 freq peyper (3) - 1 freq keiper (3) - 1 freq veere (3) - 1 freq veer (3) - 1 freq paeper (3) - 3 freq peiper (3) - 1 freq vupper (3) - 1 freq pooper (4) - 1 freq cooper (4) - 18 freq piper (4) - 24 freq paper (4) - 511 freq voicer (4) - 1 freq |
SoundEx code - V160 veeper - 2 freq vapour - 3 freq vibrio - 1 freq viper - 1 freq vovr - 1 freq vhbr - 1 freq vupper - 1 freq |
MetaPhone code - FPR veeper - 2 freq vapour - 3 freq viper - 1 freq fapor - 2 freq vupper - 1 freq |
VEEPER |
| Time to execute Levenshtein function - 0.293287 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.679793 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.027613 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.091791 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.000894 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. |