| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bindvdn (0) - 1 freq bindin (2) - 6 freq bided (3) - 30 freq bindins (3) - 1 freq windrin (3) - 4 freq binding (3) - 1 freq bidein (3) - 6 freq inded (3) - 1 freq bidden (3) - 36 freq binnian (3) - 2 freq binkin (3) - 1 freq birden (3) - 1 freq binged (3) - 1 freq biden (3) - 9 freq binder (3) - 23 freq biddy (3) - 12 freq bondin (3) - 1 freq binlid (3) - 1 freq mindin (3) - 157 freq indian (3) - 34 freq findin (3) - 71 freq blinded (3) - 4 freq binders (3) - 1 freq mindan (3) - 7 freq bidan (3) - 9 freq |
bindvdn (0) - 1 freq bindin (4) - 6 freq bidden (5) - 36 freq bended (5) - 4 freq bendin (5) - 15 freq biddin (5) - 30 freq bondin (5) - 1 freq bunden (5) - 1 freq bonded (5) - 3 freq bendan (5) - 1 freq minded (6) - 97 freq bindie (6) - 1 freq blindin (6) - 11 freq bidin (6) - 201 freq bind (6) - 20 freq windin (6) - 28 freq bindelj (6) - 1 freq bingin (6) - 1 freq findan (6) - 6 freq bandied (6) - 1 freq buddan (6) - 1 freq abandon (6) - 12 freq bindwuid (6) - 3 freq bliddin (6) - 2 freq invadin (6) - 5 freq |
SoundEx code - B531 bountifae - 1 freq baund-practice - 1 freq bountifou - 1 freq boontiefil - 1 freq bane-deep - 3 freq bunnet-fou - 1 freq boontifu - 1 freq bye-and-bye - 1 freq bentaps - 1 freq bound-up - 1 freq behindthefolk - 1 freq bindvdn - 1 freq bandparts - 1 freq |
MetaPhone code - BNTFTN bindvdn - 1 freq |
BINDVDN |
| Time to execute Levenshtein function - 0.182507 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.394019 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.028181 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.037842 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.000834 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. |