| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| verrier (0) - 1 freq cerrier (1) - 1 freq ferrier (1) - 6 freq merrier (1) - 4 freq terrier (1) - 13 freq merried (2) - 14 freq terrie (2) - 2 freq kerrien (2) - 3 freq berries (2) - 26 freq herrien (2) - 1 freq barrier (2) - 13 freq ferriers (2) - 1 freq herried (2) - 4 freq harrier (2) - 2 freq iverrie (2) - 1 freq verie (2) - 23 freq verrier's (2) - 1 freq herrie (2) - 2 freq earrier (2) - 1 freq cerried (2) - 3 freq nerrer (2) - 2 freq kerrie (2) - 1 freq worrier (2) - 1 freq tarrier (2) - 1 freq cerries (2) - 3 freq |
verrier (0) - 1 freq cerrier (2) - 1 freq merrier (2) - 4 freq terrier (2) - 13 freq ferrier (2) - 6 freq earrier (3) - 1 freq ferrer (3) - 8 freq nerrer (3) - 2 freq carrier (3) - 15 freq iverrie (3) - 1 freq tarrier (3) - 1 freq worrier (3) - 1 freq harrier (3) - 2 freq farrier (3) - 2 freq furrier (3) - 1 freq barrier (3) - 13 freq verneer (3) - 5 freq varrit (4) - 1 freq aerlier (4) - 8 freq verdur (4) - 1 freq ferried (4) - 2 freq orrer (4) - 1 freq vertie (4) - 1 freq kerries (4) - 8 freq wearier (4) - 1 freq |
SoundEx code - V660 verrier - 1 freq |
MetaPhone code - FRR ferrer - 8 freq farrer - 27 freq freyre - 4 freq faurer - 36 freq fore'er - 1 freq ferrier - 6 freq farrar - 1 freq farar - 1 freq friary - 2 freq ferrari - 3 freq fairer - 12 freq faarer - 6 freq fiihrer - 1 freq freyr - 1 freq free-er - 1 freq frier - 1 freq verrier - 1 freq furrier - 1 freq farrier - 2 freq freear - 1 freq freer - 2 freq friar - 1 freq führer - 1 freq farer - 1 freq freoor - 1 freq ferrero - 1 freq |
VERRIER |
| Time to execute Levenshtein function - 0.218989 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.418211 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.042964 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.038204 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.001047 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. |