| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bonnyrigg (0) - 23 freq bonnyriggs (1) - 1 freq bonnybrig (2) - 1 freq bonnyrigg's (2) - 4 freq bonnyriggams (3) - 1 freq bonnie (4) - 805 freq bothering (4) - 2 freq pondering (4) - 1 freq banning (4) - 2 freq sand-rigg (4) - 1 freq corn-rigs (4) - 3 freq bounding (4) - 1 freq bonny's (4) - 1 freq bonding (4) - 1 freq cornriggs (4) - 1 freq moneydig (4) - 1 freq bonnier (4) - 24 freq bonnyton (4) - 18 freq bonnily (4) - 11 freq bonnymuir (4) - 1 freq onyhing (4) - 11 freq bouncing (4) - 5 freq bonnify (4) - 2 freq connerik (4) - 2 freq oanyhing (4) - 1 freq |
bonnyrigg (0) - 23 freq bonnyriggs (2) - 1 freq bonnyrigg's (4) - 4 freq bonnybrig (4) - 1 freq bonnyriggams (5) - 1 freq brigg (6) - 3 freq binnerin (6) - 1 freq bonnier (6) - 24 freq bonnyriggrose (6) - 26 freq wunnering (6) - 2 freq banning (6) - 2 freq connerik (7) - 2 freq wondering (7) - 12 freq bonny (7) - 496 freq binner (7) - 2 freq binnert (7) - 1 freq banner (7) - 19 freq bannerman (7) - 1 freq banners (7) - 15 freq boring (7) - 13 freq bonnify (7) - 2 freq wonnerin (7) - 9 freq blackrigg (7) - 1 freq bounding (7) - 1 freq cornriggs (7) - 1 freq |
SoundEx code - B562 banners - 15 freq bummers - 18 freq bunroku - 1 freq bonnyrigg - 23 freq bonnyrigg's - 4 freq beaumarchais - 1 freq bummer's - 2 freq boomers - 1 freq bmraqbp - 1 freq benreez - 1 freq bnrwj - 1 freq banhorseracing - 1 freq bonnyriggrose - 26 freq bonnyriggams - 1 freq bonnyriggs - 1 freq |
MetaPhone code - BNRK bunroku - 1 freq bonnyrigg - 23 freq |
BONNYRIGG |
| Time to execute Levenshtein function - 0.172327 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.333375 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.027363 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.036978 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.000853 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. |