| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bonniely (0) - 1 freq bonnily (1) - 11 freq bonniest (2) - 47 freq bonnie (2) - 805 freq bonnie's (2) - 6 freq bonnier (2) - 24 freq bonnify (2) - 2 freq connie's (3) - 2 freq monnie (3) - 5 freq donnell (3) - 1 freq bunnel (3) - 1 freq bonxies (3) - 4 freq connolly (3) - 2 freq bunnies (3) - 4 freq boanie (3) - 2 freq boadily (3) - 2 freq donnie (3) - 9 freq moniey (3) - 1 freq lonely (3) - 38 freq bunnyel (3) - 1 freq cannily (3) - 65 freq gonnie (3) - 1 freq jonnie (3) - 1 freq boney (3) - 9 freq onniewey (3) - 1 freq |
bonniely (0) - 1 freq bonnily (1) - 11 freq bunnil (3) - 8 freq bunnel (3) - 1 freq bonnify (3) - 2 freq bonnier (3) - 24 freq bunnyel (3) - 1 freq bonnie (3) - 805 freq cannily (4) - 65 freq bonjela (4) - 1 freq bunnils (4) - 1 freq funnily (4) - 6 freq tenniel (4) - 2 freq bannie (4) - 1 freq bunnels (4) - 1 freq bonny (4) - 496 freq bonnet (4) - 34 freq tonnel (4) - 1 freq bunnle (4) - 8 freq bonnie's (4) - 6 freq bonniest (4) - 47 freq bennels (4) - 1 freq bonnielike (4) - 1 freq bunnies (4) - 4 freq boannie (4) - 59 freq |
SoundEx code - B540 bienlie - 2 freq bonnily - 11 freq bunnil - 8 freq bunnle - 8 freq bienly - 7 freq bunnyel - 1 freq beinly - 1 freq bummel - 1 freq bumhole - 1 freq 'boom-ho-leh' - 1 freq bonilie - 1 freq bunnel - 1 freq bonailie - 1 freq beinlie - 1 freq bonniely - 1 freq |
MetaPhone code - BNL bienlie - 2 freq bonnily - 11 freq bunnil - 8 freq bunnle - 8 freq bienly - 7 freq beinly - 1 freq bonilie - 1 freq bunnel - 1 freq bonailie - 1 freq beinlie - 1 freq bonniely - 1 freq |
BONNIELY bonnie - 805 freq bonny - 496 freq bonniest - 47 freq bonnier - 24 freq bonnie's - 6 freq bonnily - 11 freq bonniness - 2 freq bonnie' - freq bonniely - 1 freq unbonnie - 1 freq |
| Time to execute Levenshtein function - 0.181363 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.361551 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.027271 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.036621 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.001022 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. |