| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bewitchin (0) - 1 freq rewatchin (2) - 1 freq switchin (2) - 10 freq twitchin (2) - 9 freq bitchin (2) - 2 freq witchin (2) - 2 freq within (3) - 189 freq stitchin (3) - 1 freq seithin (3) - 1 freq kitchin (3) - 2 freq swutchin (3) - 1 freq itchin (3) - 11 freq seratchin (3) - 2 freq fetchin (3) - 8 freq retchin (3) - 2 freq snaitchin (3) - 1 freq mitchin (3) - 2 freq seriechin (3) - 1 freq beachin (3) - 1 freq hitchin (3) - 1 freq onwithin (3) - 1 freq titchin (3) - 2 freq pitchin (3) - 2 freq swithin (3) - 1 freq ketchin (3) - 1 freq |
bewitchin (0) - 1 freq witchin (3) - 2 freq twitchin (3) - 9 freq bitchin (3) - 2 freq switchin (3) - 10 freq rewatchin (3) - 1 freq bowchin (4) - 1 freq swatchin (4) - 1 freq watchin (4) - 395 freq swutchin (4) - 1 freq twitchan (4) - 2 freq fleitchin (5) - 2 freq breithin (5) - 2 freq witchie (5) - 3 freq skeitchin (5) - 1 freq belchin (5) - 2 freq beseechin (5) - 2 freq bellochin (5) - 3 freq seatchin (5) - 1 freq watchen (5) - 7 freq waatchin (5) - 24 freq watchan (5) - 20 freq braithin (5) - 5 freq bitching (5) - 1 freq switching (5) - 6 freq |
SoundEx code - B325 botswana - 9 freq botswana's - 1 freq budgin - 3 freq beautician - 8 freq bedchaumers - 3 freq bedchaumer - 5 freq bewitchin - 1 freq bed-chaumer - 1 freq buddhism - 7 freq beauticians - 1 freq beautician's - 1 freq bits-on-the-side - 1 freq bodie-kyn - 1 freq betoken - 1 freq bitchin - 2 freq botswanan - 1 freq baudkin - 1 freq betokened - 1 freq body-snatchers - 2 freq body-snatcher - 1 freq bedeckin - 1 freq bitsun - 1 freq buits-on-the-street - 1 freq bitching - 1 freq bitsnbobs - 1 freq btywgnclxf - 1 freq batesmoira - 6 freq budsmam - 1 freq botcoin - 1 freq bidixm - 1 freq |
MetaPhone code - BWXN bewitchin - 1 freq |
BEWITCHIN |
| Time to execute Levenshtein function - 0.224338 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.361403 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.027697 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.036889 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.000921 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. |