| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vespa (0) - 2 freq vesa (1) - 1 freq vesta (1) - 2 freq eesta (2) - 1 freq vest (2) - 14 freq vests (2) - 4 freq vega (2) - 1 freq hesp (2) - 1 freq hesna (2) - 12 freq mesa (2) - 2 freq bespak (2) - 1 freq visa (2) - 5 freq visua (2) - 1 freq vera (2) - 29 freq hesps (2) - 2 freq espy (2) - 2 freq tesla (2) - 2 freq esp (2) - 10 freq gespan (2) - 1 freq ves (2) - 2 freq €™espa (2) - 1 freq versa (2) - 4 freq peppa (2) - 1 freq verra (2) - 436 freq vista (2) - 3 freq |
vespa (0) - 2 freq vesta (2) - 2 freq vesa (2) - 1 freq espy (3) - 2 freq esp (3) - 10 freq spa (3) - 6 freq vista (3) - 3 freq visa (3) - 5 freq ves (3) - 2 freq visua (3) - 1 freq hesp (3) - 1 freq vest (3) - 14 freq eves (4) - 1 freq vosk (4) - 1 freq hosp (4) - 1 freq vas (4) - 1 freq vsl (4) - 1 freq sp (4) - 8 freq vpp (4) - 1 freq vbp (4) - 1 freq yasp (4) - 1 freq sepo (4) - 34 freq raspy (4) - 3 freq sepia (4) - 2 freq weespy (4) - 1 freq |
SoundEx code - V210 vespa - 2 freq vocab - 3 freq vfeaaigb - 1 freq vikabe - 1 freq vgp - 1 freq vhzhv - 1 freq vbkeuvo - 1 freq vcb - 1 freq vgcf - 1 freq vuajf - 1 freq vzvfy - 1 freq |
MetaPhone code - FSP vespa - 2 freq |
VESPA |
| Time to execute Levenshtein function - 0.207432 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.351840 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.028740 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.040629 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.001108 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. |