| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| boondin (0) - 1 freq poondin (1) - 3 freq roondin (1) - 1 freq boordin (1) - 1 freq soondin (1) - 47 freq booncin (1) - 10 freq boundin (1) - 7 freq bondin (1) - 1 freq hoondin (1) - 1 freq blondin (1) - 1 freq foondin (1) - 13 freq boonsin (1) - 1 freq stoondin (2) - 9 freq soundin (2) - 10 freq bodin (2) - 1 freq poundin (2) - 12 freq droondin (2) - 1 freq houndin (2) - 2 freq broodin (2) - 5 freq boldin (2) - 1 freq poonin (2) - 1 freq boolin (2) - 16 freq doonin (2) - 1 freq bowdin (2) - 1 freq boonie (2) - 2 freq |
boondin (0) - 1 freq boundin (1) - 7 freq bondin (1) - 1 freq blondin (2) - 1 freq bindin (2) - 6 freq bendin (2) - 15 freq hoondin (2) - 1 freq foondin (2) - 13 freq boonsin (2) - 1 freq poondin (2) - 3 freq booncin (2) - 10 freq boordin (2) - 1 freq roondin (2) - 1 freq soondin (2) - 47 freq foundin (3) - 1 freq boonds (3) - 7 freq boond (3) - 9 freq boyndie (3) - 6 freq bondic (3) - 1 freq bounding (3) - 1 freq bonkin (3) - 1 freq blendin (3) - 3 freq bondit (3) - 1 freq bourdin (3) - 1 freq boundit (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 |
BOONDIN |
| Time to execute Levenshtein function - 0.222509 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.355641 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.030675 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.037304 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.000901 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. |