| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vernacular (0) - 34 freq vernaclar (1) - 2 freq vernaclir (2) - 1 freq vernaklir (3) - 3 freq dracula (4) - 3 freq secular (4) - 3 freq circular (4) - 8 freq vocabular (4) - 65 freq venacher (4) - 1 freq seingular (4) - 1 freq spectacular (4) - 8 freq vernal (4) - 3 freq teecular (4) - 1 freq pertikular (4) - 1 freq vernear (4) - 8 freq particular (4) - 108 freq bernicla (4) - 1 freq vennacher (4) - 2 freq parucular (4) - 1 freq spatular (5) - 1 freq verdur (5) - 1 freq ejaculate (5) - 1 freq vehicul (5) - 1 freq tarnshula (5) - 1 freq traivlar (5) - 3 freq |
vernacular (0) - 34 freq vernaclar (1) - 2 freq vernaclir (2) - 1 freq vernaklir (4) - 3 freq vernear (6) - 8 freq bernicla (6) - 1 freq vernal (6) - 3 freq parucular (6) - 1 freq vennacher (6) - 2 freq particular (6) - 108 freq venacher (6) - 1 freq circular (6) - 8 freq pairticular (7) - 8 freq verticals (7) - 1 freq particulary (7) - 1 freq vertical (7) - 21 freq particlar (7) - 30 freq barnacle (7) - 1 freq veronica (7) - 3 freq dracula (7) - 3 freq trianglar (7) - 2 freq parteicular (7) - 7 freq pertikular (7) - 1 freq teecular (7) - 1 freq seingular (7) - 1 freq |
SoundEx code - V652 veronica - 3 freq varying - 7 freq vernacular - 34 freq vrang - 8 freq vernix - 1 freq varnish - 6 freq veronx - 1 freq værniesh - 1 freq virmishin - 2 freq virmished - 1 freq vrangous - 1 freq variance - 2 freq varnished - 3 freq €˜varying - 1 freq vernaclar - 2 freq vrans - 1 freq vernaclir - 1 freq vernaklir - 3 freq |
MetaPhone code - FRNKLR vernacular - 34 freq vernaclar - 2 freq vernaclir - 1 freq vernaklir - 3 freq |
VERNACULAR |
| Time to execute Levenshtein function - 0.492519 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.803921 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.075939 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.036824 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.000770 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. |