| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| boundin (0) - 7 freq bounding (1) - 1 freq bouncin (1) - 12 freq boundit (1) - 1 freq woundin (1) - 1 freq bondin (1) - 1 freq soundin (1) - 10 freq foundin (1) - 1 freq bourdin (1) - 1 freq houndin (1) - 2 freq poundin (1) - 12 freq boondin (1) - 1 freq bounin (1) - 1 freq bungin (2) - 3 freq poondin (2) - 3 freq soundin' (2) - 1 freq poundan (2) - 3 freq woundit (2) - 17 freq hoondin (2) - 1 freq sounin (2) - 8 freq blondin (2) - 1 freq bendin (2) - 15 freq bindin (2) - 6 freq 'fundin (2) - 1 freq sounding (2) - 1 freq |
boundin (0) - 7 freq boondin (1) - 1 freq bondin (1) - 1 freq bounin (2) - 1 freq bendin (2) - 15 freq bunden (2) - 1 freq bindin (2) - 6 freq bounding (2) - 1 freq houndin (2) - 2 freq poundin (2) - 12 freq bourdin (2) - 1 freq bouncin (2) - 12 freq boundit (2) - 1 freq woundin (2) - 1 freq foundin (2) - 1 freq soundin (2) - 10 freq booncin (3) - 10 freq boldin (3) - 1 freq boyndie (3) - 6 freq boordin (3) - 1 freq soondin (3) - 47 freq bondie (3) - 3 freq brendin (3) - 1 freq bound (3) - 58 freq pundin (3) - 1 freq |
SoundEx code - B535 bendin - 15 freq bending - 2 freq bindin - 6 freq bunting - 8 freq bandmates - 1 freq bnitam - 1 freq boondin - 1 freq bondin - 1 freq bonnetmaker - 3 freq buntin - 4 freq binnatoon - 1 freq bonding - 1 freq bendan - 1 freq bunden - 1 freq bentham - 1 freq boundin - 7 freq bontemps - 6 freq bontemps' - 1 freq buntings - 1 freq bounding - 1 freq bayonetin - 1 freq bantams - 1 freq bntton - 1 freq bontine - 2 freq binding - 1 freq bindins - 1 freq buntinrobert - 1 freq bonnyton - 18 freq |
MetaPhone code - BNTN bendin - 15 freq bindin - 6 freq boondin - 1 freq bondin - 1 freq buntin - 4 freq binnatoon - 1 freq bendan - 1 freq bunden - 1 freq boundin - 7 freq bntton - 1 freq bontine - 2 freq bonnyton - 18 freq |
BOUNDIN |
| Time to execute Levenshtein function - 0.202040 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.363935 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.027228 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.040120 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.000929 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. |