| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bonnier (0) - 24 freq bonnie (1) - 805 freq wonner (2) - 5 freq hornier (2) - 1 freq conner (2) - 2 freq jonnie (2) - 1 freq bonnify (2) - 2 freq gonnie (2) - 1 freq boanie (2) - 2 freq onnher (2) - 1 freq bonxies (2) - 4 freq onnie (2) - 7 freq onner (2) - 3 freq ronnies (2) - 1 freq 'bonnie' (2) - 2 freq boonies (2) - 1 freq ponner (2) - 1 freq bonnie's (2) - 6 freq boonie (2) - 2 freq bouncer (2) - 22 freq funnier (2) - 7 freq aonner (2) - 1 freq banner (2) - 19 freq bonniely (2) - 1 freq monnie (2) - 5 freq |
bonnier (0) - 24 freq binner (2) - 2 freq banner (2) - 19 freq bonnie (2) - 805 freq bannie (3) - 1 freq bonnet (3) - 34 freq tonner (3) - 1 freq bonniely (3) - 1 freq aonner (3) - 1 freq onnir (3) - 1 freq cannier (3) - 1 freq bunnies (3) - 4 freq bainner (3) - 2 freq baunner (3) - 5 freq bonnily (3) - 11 freq yonner (3) - 67 freq funnier (3) - 7 freq boannie (3) - 59 freq donner (3) - 2 freq gonner (3) - 1 freq onner (3) - 3 freq conner (3) - 2 freq wonner (3) - 5 freq bonnify (3) - 2 freq ponner (3) - 1 freq |
SoundEx code - B560 bonnier - 24 freq bummer - 21 freq binner - 2 freq bane-weary - 2 freq banner - 19 freq bainner - 2 freq beamer - 12 freq boomer - 1 freq binary - 4 freq bawmurrie - 1 freq bummerie - 1 freq bynear - 2 freq beemer - 2 freq baunner - 5 freq bmr - 1 freq |
MetaPhone code - BNR bonnier - 24 freq binner - 2 freq banner - 19 freq bainner - 2 freq binary - 4 freq bynear - 2 freq baunner - 5 freq |
BONNIER 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.188204 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.366402 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.027847 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.041100 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.001259 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. |