| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bonum (0) - 1 freq donum (1) - 1 freq bonus (1) - 21 freq bicum (2) - 2 freq bunkum (2) - 1 freq bogus (2) - 3 freq bonds (2) - 9 freq becum (2) - 24 freq bonn (2) - 2 freq bohun (2) - 2 freq unum (2) - 1 freq jonam (2) - 3 freq bone' (2) - 1 freq bonce (2) - 1 freq boud (2) - 1 freq bohus (2) - 1 freq coum (2) - 2 freq onzm (2) - 1 freq bloum (2) - 1 freq bono (2) - 3 freq boeuf (2) - 1 freq jojum (2) - 1 freq bonme (2) - 1 freq roum (2) - 2 freq oncum (2) - 50 freq |
bonum (0) - 1 freq donum (2) - 1 freq bonme (2) - 1 freq bonus (2) - 21 freq bum (3) - 44 freq boned (3) - 2 freq boney (3) - 9 freq bo'm (3) - 1 freq bones (3) - 61 freq bond (3) - 17 freq bonk (3) - 2 freq bon (3) - 14 freq bong (3) - 3 freq bonny (3) - 501 freq bom (3) - 3 freq annum (3) - 2 freq bonie (3) - 13 freq byenem (3) - 1 freq bony (3) - 6 freq boun (3) - 10 freq bosom (3) - 12 freq baum (3) - 2 freq bone (3) - 46 freq onm (3) - 1 freq boom (3) - 30 freq |
SoundEx code - B550 benon - 1 freq bummin - 20 freq bowman - 4 freq beamin - 26 freq bounin - 1 freq banana - 45 freq bohemian - 2 freq boomin - 15 freq bammin - 3 freq binnian - 2 freq bananae - 2 freq booman - 2 freq by-nem - 1 freq bannan - 1 freq bannin - 5 freq bumin - 1 freq bemoan - 1 freq beinin - 1 freq byenem - 1 freq beamiin - 1 freq bonhomie - 1 freq bunion - 1 freq binmen - 1 freq bonum - 1 freq beemin - 1 freq |
MetaPhone code - BNM bonme - 1 freq by-nem - 1 freq bonum - 1 freq |
BONUM |
| Time to execute Levenshtein function - 0.183858 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.352563 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.029077 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.037165 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.000898 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. |