| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bonxies (0) - 4 freq bonxie's (1) - 1 freq boxies (1) - 4 freq bonxied (1) - 1 freq bonxie (1) - 8 freq boxie (2) - 21 freq boaxes (2) - 5 freq bonfires (2) - 8 freq boadies (2) - 49 freq bunnies (2) - 4 freq bones (2) - 61 freq bandies (2) - 1 freq boxes (2) - 64 freq boies (2) - 1 freq monies (2) - 36 freq poxies (2) - 1 freq boaties (2) - 18 freq bonnie (2) - 811 freq bogies (2) - 3 freq bonie (2) - 13 freq boonies (2) - 1 freq bo'dies (2) - 1 freq boories (2) - 1 freq bookies (2) - 25 freq bonnie's (2) - 6 freq |
bonxies (0) - 4 freq bonxie's (2) - 1 freq bonxied (2) - 1 freq bonxie (2) - 8 freq boxies (2) - 4 freq boxes (3) - 64 freq bounties (3) - 2 freq boonies (3) - 1 freq bones (3) - 61 freq bandies (3) - 1 freq banties (3) - 1 freq bunnies (3) - 4 freq boaxes (3) - 5 freq bothies (4) - 13 freq bonus (4) - 21 freq boneys (4) - 1 freq binges (4) - 1 freq booties (4) - 1 freq boones (4) - 1 freq booies (4) - 1 freq bobbies (4) - 33 freq boolies (4) - 1 freq benkis (4) - 1 freq bines (4) - 1 freq banis (4) - 1 freq |
SoundEx code - B522 banshee's - 2 freq benshees - 2 freq bunches - 7 freq benches - 13 freq bounces - 4 freq banshees - 6 freq benkis - 1 freq banjos - 2 freq binges - 1 freq 'banshees' - 1 freq bingos - 1 freq boonces - 4 freq 'boonce's - 1 freq boonce's - 3 freq boneshaker - 1 freq bunghsie - 2 freq banghs - 1 freq bonxie's - 1 freq bangkok - 2 freq bianco's - 1 freq benjy's - 1 freq bonsais - 1 freq bonxies - 4 freq boom-cognate-boom-hum-end-o-game - 1 freq bnqyikqq - 1 freq |
MetaPhone code - BNKSS bonxie's - 1 freq bonxies - 4 freq |
BONXIES |
| Time to execute Levenshtein function - 0.258578 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.442144 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.030782 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.039914 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.000901 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. |