| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bonailie (0) - 1 freq bonilie (1) - 1 freq bailie (2) - 7 freq tonallie (2) - 1 freq baadlie (3) - 1 freq bailies (3) - 2 freq naigie (3) - 1 freq boilin (3) - 6 freq boannie (3) - 59 freq coallie (3) - 4 freq baikie (3) - 1 freq onalik (3) - 1 freq bondie (3) - 3 freq boatikie (3) - 2 freq tailie (3) - 7 freq fynallie (3) - 1 freq dailie (3) - 8 freq bowlie (3) - 7 freq bontine (3) - 2 freq nailin (3) - 1 freq bottlie (3) - 2 freq bundlie (3) - 1 freq bonnie (3) - 811 freq boitie (3) - 2 freq booglie (3) - 1 freq |
bonailie (0) - 1 freq bonilie (1) - 1 freq bailie (3) - 7 freq boatle (4) - 12 freq bundlie (4) - 1 freq bonnie (4) - 811 freq bainie (4) - 1 freq braalie (4) - 3 freq bonie (4) - 13 freq onlie (4) - 102 freq bienlie (4) - 2 freq boanie (4) - 2 freq bonnily (4) - 11 freq bowlie (4) - 7 freq lonlie (4) - 1 freq booglie (4) - 1 freq snaile (4) - 1 freq boannie (4) - 59 freq baadlie (4) - 1 freq tonallie (4) - 1 freq beinlie (4) - 1 freq baillie (4) - 17 freq bonxie (4) - 8 freq bondie (4) - 3 freq bonce (5) - 1 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 |
BONAILIE |
| Time to execute Levenshtein function - 0.607556 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.996958 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.082680 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.045152 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.000886 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. |