| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bonded (0) - 3 freq bounded (1) - 7 freq boned (1) - 2 freq bended (1) - 4 freq nodded (2) - 71 freq banked (2) - 2 freq bonie (2) - 13 freq binned (2) - 1 freq bopped (2) - 1 freq soonded (2) - 23 freq konked (2) - 1 freq bone' (2) - 1 freq poinded (2) - 1 freq boney (2) - 9 freq ronged (2) - 1 freq sounded (2) - 26 freq hounded (2) - 1 freq loaded (2) - 22 freq bronzed (2) - 1 freq bothed (2) - 1 freq boddem (2) - 1 freq minded (2) - 97 freq bombed (2) - 7 freq bone (2) - 46 freq tended (2) - 16 freq |
bonded (0) - 3 freq bounded (1) - 7 freq bended (1) - 4 freq boned (2) - 2 freq bandied (2) - 1 freq banned (3) - 35 freq bunden (3) - 1 freq mended (3) - 5 freq bonds (3) - 9 freq winded (3) - 2 freq bond (3) - 17 freq wounded (3) - 13 freq founded (3) - 3 freq bonxied (3) - 1 freq bondic (3) - 1 freq handed (3) - 49 freq landed (3) - 70 freq pounded (3) - 2 freq branded (3) - 5 freq bunder (3) - 1 freq eynded (3) - 1 freq bounced (3) - 12 freq bondin (3) - 1 freq bunged (3) - 7 freq blinded (3) - 4 freq |
SoundEx code - B533 bindwood - 2 freq bounded - 7 freq banditti - 1 freq bonded - 3 freq bended - 4 freq bendit - 2 freq bandit - 7 freq banditry - 1 freq bondit - 1 freq bandits - 5 freq bawn-heided - 1 freq bindweed - 2 freq bindwuid - 3 freq bandied - 1 freq boundit - 1 freq beamtet - 1 freq |
MetaPhone code - BNTT bounded - 7 freq banditti - 1 freq bonded - 3 freq bended - 4 freq bendit - 2 freq bandit - 7 freq bondit - 1 freq bandied - 1 freq boundit - 1 freq |
BONDED |
| Time to execute Levenshtein function - 0.251819 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.417397 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.031232 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.045404 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.001143 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. |