| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vestibule (0) - 3 freq vestige (3) - 1 freq visible (3) - 25 freq destitute (3) - 2 freq stibble (3) - 14 freq veisible (3) - 1 freq veesible (3) - 4 freq testicle (3) - 1 freq hostile (4) - 13 freq vestigial (4) - 1 freq vertue (4) - 2 freq verticals (4) - 1 freq institute (4) - 41 freq festie (4) - 11 freq resemble (4) - 3 freq unstable (4) - 1 freq nestily (4) - 1 freq vestit (4) - 1 freq festivals (4) - 40 freq vertical (4) - 21 freq nestie (4) - 7 freq sibble (4) - 1 freq visibly (4) - 9 freq restive (4) - 1 freq ansible (4) - 2 freq |
vestibule (0) - 3 freq veisible (4) - 1 freq veesible (4) - 4 freq visible (4) - 25 freq visable (5) - 1 freq visibly (5) - 9 freq unstable (5) - 1 freq vejitable (5) - 1 freq seatbele (5) - 1 freq veritable (5) - 2 freq vestigial (5) - 1 freq testicle (5) - 1 freq vegetable (5) - 15 freq stable (5) - 71 freq vestige (5) - 1 freq stibble (5) - 14 freq restful (6) - 1 freq feasible (6) - 2 freq suitable (6) - 13 freq stubble (6) - 13 freq bestial (6) - 1 freq vessil (6) - 1 freq sitable (6) - 2 freq staibil (6) - 3 freq risible (6) - 1 freq |
SoundEx code - V231 vegetable - 15 freq vegetables - 23 freq vestibule - 3 freq vejitable - 1 freq vegitabil's - 1 freq vocative - 1 freq vegetable-or - 1 freq visitabdn - 11 freq visitabdnbt - 6 freq vwxdpfeedq - 1 freq visitportrush - 1 freq vstwfcebt - 1 freq |
MetaPhone code - FSTBL vestibule - 3 freq |
VESTIBULE |
| Time to execute Levenshtein function - 0.326711 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.521913 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.027577 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.045589 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.000946 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. |