| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| verm (0) - 1 freq vers (1) - 1 freq erm (1) - 70 freq vert (1) - 1 freq herm (1) - 51 freq term (1) - 99 freq vem (1) - 1 freq germ (1) - 3 freq ferm (1) - 340 freq vera (1) - 29 freq verb (1) - 129 freq verk (1) - 2 freq very (1) - 698 freq ver (1) - 3 freq perm (1) - 3 freq sperm (2) - 5 freq every (2) - 822 freq verde (2) - 2 freq vm (2) - 11 freq germy (2) - 1 freq rer (2) - 3 freq vire (2) - 2 freq 'ehm (2) - 1 freq yerk (2) - 3 freq seem (2) - 404 freq |
verm (0) - 1 freq verb (2) - 129 freq vera (2) - 29 freq verk (2) - 2 freq ver (2) - 3 freq perm (2) - 3 freq ferm (2) - 340 freq very (2) - 698 freq erm (2) - 70 freq germ (2) - 3 freq vert (2) - 1 freq vers (2) - 1 freq vem (2) - 1 freq term (2) - 99 freq herm (2) - 51 freq vary (3) - 3 freq avert (3) - 1 freq garm (3) - 1 freq veer (3) - 1 freq versy (3) - 1 freq verge (3) - 9 freq wirm (3) - 17 freq versa (3) - 4 freq norm (3) - 11 freq pirm (3) - 1 freq |
SoundEx code - V650 varyin - 5 freq vroom - 1 freq varyan - 1 freq veerin - 1 freq voorn - 1 freq verm - 1 freq |
MetaPhone code - FRM form - 290 freq from - 594 freq ferm - 340 freq firm - 67 freq frame - 63 freq fairm - 126 freq form' - 2 freq farm - 28 freq forum - 37 freq froma - 1 freq furm - 20 freq vroom - 1 freq fairm' - 1 freq 'from' - 1 freq 'frim - 1 freq foarm - 66 freq fremm - 5 freq fur'm - 1 freq fermi - 5 freq fram - 1 freq fourmi - 1 freq feirm - 4 freq frem - 2 freq furrum - 1 freq frim - 1 freq €˜from - 1 freq ferim - 1 freq verm - 1 freq |
VERM |
| Time to execute Levenshtein function - 0.179386 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.339584 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.027539 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.037598 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.001115 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. |