| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bondin (0) - 1 freq boundin (1) - 7 freq bodin (1) - 1 freq boondin (1) - 1 freq bendin (1) - 14 freq bondic (1) - 1 freq bondie (1) - 3 freq bowdin (1) - 1 freq bonkin (1) - 1 freq bindin (1) - 6 freq boldin (1) - 1 freq blondin (1) - 1 freq bonding (1) - 1 freq hondin (1) - 1 freq bondit (1) - 1 freq connin (2) - 1 freq bounding (2) - 1 freq odin (2) - 43 freq bonxie (2) - 8 freq bootin (2) - 2 freq noddin (2) - 38 freq soundin (2) - 8 freq bodine (2) - 1 freq vendin (2) - 2 freq boltin (2) - 3 freq |
bondin (0) - 1 freq bindin (1) - 6 freq boondin (1) - 1 freq bendin (1) - 14 freq boundin (1) - 7 freq bonding (2) - 1 freq hondin (2) - 1 freq bendan (2) - 1 freq bunden (2) - 1 freq blondin (2) - 1 freq bondit (2) - 1 freq bondic (2) - 1 freq boldin (2) - 1 freq bondie (2) - 3 freq bodin (2) - 1 freq bonkin (2) - 1 freq bowdin (2) - 1 freq bangin (3) - 40 freq boardin (3) - 7 freq brandin (3) - 1 freq houndin (3) - 2 freq bontine (3) - 2 freq handin (3) - 15 freq fandin (3) - 1 freq mindin (3) - 154 freq |
SoundEx code - B535 bendin - 14 freq bending - 2 freq bindin - 6 freq bunting - 8 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 - 14 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 |
BONDIN |
| Time to execute Levenshtein function - 0.183671 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.338255 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.027541 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.036911 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.000799 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. |