| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vbwtwe (0) - 1 freq bathe (3) - 7 freq obwtoz (3) - 1 freq ebswe (3) - 1 freq bwqe (3) - 1 freq btw (3) - 110 freq bowtie (3) - 1 freq vertie (3) - 1 freq bete (3) - 4 freq byte (3) - 1 freq dewtie (3) - 8 freq tawtie (3) - 1 freq virtue (3) - 15 freq vrote (3) - 1 freq vertue (3) - 2 freq owte (3) - 2 freq kywte (3) - 1 freq sywte (3) - 1 freq awtie (3) - 1 freq bute (3) - 13 freq abate (3) - 3 freq bowe (3) - 3 freq bawtie (3) - 2 freq vbt (3) - 1 freq awte (3) - 1 freq |
vbwtwe (0) - 1 freq bbctwo (5) - 1 freq bewtie (5) - 4 freq bawtie (5) - 2 freq bowtie (5) - 1 freq btw (5) - 110 freq vbt (5) - 1 freq mbtw (5) - 1 freq obwtoz (5) - 1 freq dawtie (6) - 6 freq oawthe (6) - 1 freq bythe (6) - 1 freq lawtie (6) - 1 freq bette (6) - 3 freq bowts (6) - 2 freq vote (6) - 253 freq votre (6) - 1 freq bowt (6) - 23 freq bwat (6) - 4 freq kowtow (6) - 1 freq bewty- (6) - 1 freq bowtit (6) - 1 freq bestowe (6) - 1 freq vibrate (6) - 5 freq bewty (6) - 5 freq |
SoundEx code - V300 vote - 253 freq void - 17 freq vat - 12 freq vood - 2 freq vet - 37 freq voot - 1 freq vidi - 1 freq vitae - 3 freq vow'd - 1 freq vot - 1 freq voodoo - 2 freq video - 105 freq vatta - 1 freq voddie - 8 freq viewed - 9 freq veet - 6 freq voddy - 2 freq vid - 4 freq vit - 3 freq vott - 2 freq vowed - 5 freq vodd - 2 freq voyd - 2 freq voyied - 1 freq vod - 1 freq voo'd - 1 freq ve'd - 1 freq vaudie - 1 freq vita - 1 freq voat - 1 freq vóat - 1 freq €œvote - 1 freq vuty - 1 freq vwdh - 1 freq vada - 1 freq vidyo - 1 freq vbt - 1 freq voodo - 1 freq vath - 1 freq vwdy - 1 freq vethe - 1 freq vpt - 1 freq vido - 1 freq vd - 2 freq vbwtwe - 1 freq |
MetaPhone code - FBTW vbwtwe - 1 freq |
VBWTWE |
| Time to execute Levenshtein function - 0.272380 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.408541 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.029444 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.043902 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.001167 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. |