| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| verbs (0) - 98 freq vers (1) - 1 freq serbs (1) - 2 freq jerbs (1) - 1 freq verb' (1) - 1 freq herbs (1) - 14 freq kerbs (1) - 3 freq yerbs (1) - 2 freq verus (1) - 1 freq verb (1) - 129 freq verb's (1) - 1 freq yerb (2) - 1 freq ters (2) - 1 freq vents (2) - 1 freq herts (2) - 119 freq 'er's (2) - 1 freq perms (2) - 2 freq heris (2) - 1 freq herbst (2) - 2 freq yerks (2) - 1 freq eers (2) - 9 freq yer's (2) - 2 freq verbals (2) - 1 freq nebs (2) - 41 freq derby (2) - 13 freq |
verbs (0) - 98 freq yerbs (2) - 2 freq verb (2) - 129 freq verb's (2) - 1 freq kerbs (2) - 3 freq verus (2) - 1 freq herbs (2) - 14 freq serbs (2) - 2 freq jerbs (2) - 1 freq verb' (2) - 1 freq vers (2) - 1 freq verbal (3) - 28 freq versa (3) - 4 freq rebs (3) - 3 freq adverbs (3) - 13 freq versy (3) - 1 freq virus (3) - 57 freq verges (3) - 5 freq verse (3) - 127 freq viris (3) - 1 freq veers (3) - 1 freq rbs (3) - 1 freq barbs (3) - 1 freq verses (3) - 58 freq versus (3) - 7 freq |
SoundEx code - V612 verbs - 98 freq verb's - 1 freq verbs-fousomiver - 1 freq vrafz - 1 freq verbisan - 3 freq vrvfhqehxw - 1 freq |
MetaPhone code - FRBS forbes - 10 freq verbs - 98 freq freebies - 1 freq verb's - 1 freq firebaws - 1 freq furbas - 1 freq |
VERBS |
| Time to execute Levenshtein function - 0.182679 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.359608 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.027270 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.037098 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.000795 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. |