| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| verb (0) - 129 freq vera (1) - 29 freq vers (1) - 1 freq herb (1) - 2 freq yerb (1) - 1 freq kerb (1) - 6 freq verk (1) - 2 freq verb' (1) - 1 freq verbs (1) - 98 freq ver (1) - 3 freq vert (1) - 1 freq very (1) - 683 freq verm (1) - 1 freq every (2) - 799 freq derd (2) - 1 freq germ (2) - 3 freq ceri (2) - 1 freq yerbs (2) - 2 freq derk (2) - 99 freq werc (2) - 1 freq virr (2) - 55 freq per (2) - 63 freq varl (2) - 1 freq ter (2) - 6 freq gers (2) - 8 freq |
verb (0) - 129 freq verbs (2) - 98 freq ver (2) - 3 freq very (2) - 683 freq verb' (2) - 1 freq vert (2) - 1 freq verm (2) - 1 freq vera (2) - 29 freq verk (2) - 2 freq herb (2) - 2 freq vers (2) - 1 freq kerb (2) - 6 freq yerb (2) - 1 freq verve (3) - 2 freq adverb (3) - 3 freq vb (3) - 1 freq verge (3) - 9 freq rb (3) - 8 freq verra (3) - 434 freq varg (3) - 6 freq virt (3) - 1 freq zrb (3) - 1 freq vir (3) - 1 freq vr (3) - 5 freq versy (3) - 1 freq |
SoundEx code - V610 verify - 2 freq verb - 129 freq verb' - 1 freq virrfu - 3 freq verve - 2 freq |
MetaPhone code - FRB forby - 491 freq 'forby - 1 freq furby - 29 freq foreby - 2 freq verb - 129 freq verb' - 1 freq firby - 1 freq freebee - 1 freq freebie - 2 freq €œforby - 1 freq €˜forby - 1 freq forbae - 1 freq |
VERB |
| Time to execute Levenshtein function - 0.199480 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.333147 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.026876 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.037708 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.000819 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. |