| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bonilie (0) - 1 freq bonailie (1) - 1 freq boilin (2) - 6 freq booglie (2) - 1 freq bailie (2) - 7 freq dowilie (2) - 1 freq bowlie (2) - 7 freq bonxie (2) - 8 freq bonnie (2) - 811 freq lonlie (2) - 1 freq onlie (2) - 102 freq bundlie (2) - 1 freq bondie (2) - 3 freq bottlie (2) - 2 freq roilie (2) - 1 freq boitie (2) - 2 freq bonie (2) - 13 freq on-line (3) - 9 freq chailie (3) - 1 freq beisie (3) - 3 freq deilie (3) - 2 freq jonnie (3) - 1 freq bangle (3) - 1 freq bole (3) - 4 freq dominie (3) - 66 freq |
bonilie (0) - 1 freq bonailie (1) - 1 freq bundlie (3) - 1 freq bonie (3) - 13 freq onlie (3) - 102 freq bienlie (3) - 2 freq lonlie (3) - 1 freq beinlie (3) - 1 freq bondie (3) - 3 freq bailie (3) - 7 freq bonnie (3) - 811 freq booglie (3) - 1 freq bowlie (3) - 7 freq bonxie (3) - 8 freq onlee (4) - 2 freq bogil (4) - 4 freq bile (4) - 56 freq bowle (4) - 2 freq boanie (4) - 2 freq binkie (4) - 1 freq bille (4) - 2 freq boonie (4) - 2 freq bannie (4) - 1 freq bundle (4) - 18 freq bonce (4) - 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 |
BONILIE |
| Time to execute Levenshtein function - 0.189802 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.334582 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.026903 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.036992 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.000865 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. |