| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vocab (0) - 3 freq vocal (1) - 9 freq vicar (2) - 1 freq vlqab (2) - 1 freq colab (2) - 1 freq votar (2) - 1 freq voce (2) - 6 freq coca (2) - 1 freq voar (2) - 46 freq cab (2) - 15 freq boca (2) - 3 freq vockal (2) - 1 freq vocable (2) - 1 freq boab (2) - 53 freq voat (2) - 1 freq focal (2) - 1 freq local (2) - 410 freq voican (2) - 1 freq joab (2) - 111 freq aocau (2) - 1 freq scab (2) - 12 freq moab (2) - 2 freq vcb (2) - 1 freq vitae (3) - 3 freq oa' (3) - 1 freq |
vocab (0) - 3 freq vcb (2) - 1 freq vocal (2) - 9 freq vocable (3) - 1 freq cab (3) - 15 freq voce (3) - 6 freq vicar (3) - 1 freq scab (3) - 12 freq voican (3) - 1 freq voyce (4) - 4 freq vyces (4) - 61 freq vcz (4) - 1 freq vices (4) - 12 freq voicin (4) - 1 freq voyces (4) - 1 freq vac (4) - 1 freq jacob (4) - 41 freq voice (4) - 810 freq cub (4) - 3 freq vcm (4) - 1 freq vacate (4) - 1 freq verb (4) - 129 freq vics (4) - 1 freq vic (4) - 5 freq vfb (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 - FKB vocab - 3 freq vikabe - 1 freq vcb - 1 freq |
VOCAB |
| Time to execute Levenshtein function - 0.249581 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.329871 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.028552 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.036811 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.000826 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. |