| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bonnily (0) - 11 freq bonnify (1) - 2 freq bonniely (1) - 1 freq bodily (2) - 3 freq bonnie (2) - 811 freq boily (2) - 1 freq boadily (2) - 2 freq bonnier (2) - 24 freq onnly (2) - 37 freq bunnils (2) - 1 freq funnily (2) - 6 freq cannily (2) - 65 freq bonny (2) - 501 freq bunnil (2) - 8 freq bontine (3) - 2 freq onnir (3) - 1 freq boonies (3) - 1 freq bondie (3) - 3 freq moniey (3) - 1 freq booncy (3) - 11 freq noisily (3) - 9 freq cosily (3) - 1 freq innimy (3) - 1 freq bovrils (3) - 1 freq connolys (3) - 1 freq |
bonnily (0) - 11 freq bonniely (1) - 1 freq bunnil (2) - 8 freq bonnify (2) - 2 freq bonny (3) - 501 freq funnily (3) - 6 freq bunnel (3) - 1 freq bunnils (3) - 1 freq bunnle (3) - 8 freq cannily (3) - 65 freq onnly (3) - 37 freq bonnier (3) - 24 freq bonnie (3) - 811 freq bunnit (4) - 1 freq bunny (4) - 4 freq binnian (4) - 2 freq benny (4) - 2 freq bonnet (4) - 34 freq dinnil (4) - 1 freq boannie (4) - 59 freq bienly (4) - 7 freq bunnels (4) - 1 freq bannit (4) - 2 freq bonjela (4) - 1 freq bonn (4) - 2 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 |
BONNILY bonnie - 811 freq bonny - 501 freq bonniest - 48 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.224613 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.373730 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.028160 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.037827 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.001103 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. |