| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| verbal (0) - 29 freq verbals (1) - 1 freq verball (1) - 1 freq vernal (1) - 3 freq herbal (1) - 5 freq veal (2) - 2 freq versa (2) - 4 freq ferfal (2) - 8 freq gerbil (2) - 10 freq verb' (2) - 1 freq verbally (2) - 1 freq viral (2) - 3 freq vera (2) - 29 freq verbs (2) - 98 freq verra (2) - 436 freq aerial (2) - 5 freq feral (2) - 6 freq serial (2) - 4 freq verray (2) - 1 freq cereal (2) - 15 freq fergal (2) - 1 freq verb (2) - 129 freq derval (2) - 17 freq verb's (2) - 1 freq regal (3) - 2 freq |
verbal (0) - 29 freq vernal (2) - 3 freq herbal (2) - 5 freq verbals (2) - 1 freq verball (2) - 1 freq viral (3) - 3 freq verb (3) - 129 freq verbs (3) - 98 freq verbally (3) - 1 freq gerbil (3) - 10 freq verb' (3) - 1 freq virtual (4) - 37 freq verily (4) - 2 freq averill (4) - 1 freq veroli (4) - 5 freq varl (4) - 1 freq adverbial (4) - 1 freq vairdal (4) - 2 freq verbena (4) - 1 freq virgil (4) - 1 freq merble (4) - 2 freq gorbel (4) - 1 freq rebel (4) - 27 freq variable (4) - 5 freq overall (4) - 7 freq |
SoundEx code - V614 verbal - 29 freq verball - 1 freq variable - 5 freq variabeility - 1 freq verbally - 1 freq vrpplzs - 1 freq verbalpunchbag - 17 freq verbals - 1 freq |
MetaPhone code - FRBL verbal - 29 freq friable - 2 freq verball - 1 freq variable - 5 freq verbally - 1 freq |
VERBAL |
| Time to execute Levenshtein function - 0.525003 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.455256 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.029361 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.038381 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.000954 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. |