| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| beemin (0) - 1 freq weemin (1) - 176 freq beamin (1) - 25 freq feemin (1) - 1 freq beein (1) - 14 freq seemin (1) - 14 freq beekin (1) - 10 freq breemin (1) - 1 freq beepin (1) - 3 freq teemin (1) - 26 freq beelin (1) - 22 freq keenin (2) - 10 freq teemins (2) - 1 freq weemen (2) - 176 freq seevin (2) - 27 freq blamin (2) - 6 freq beakin (2) - 1 freq teimin (2) - 1 freq beemer (2) - 2 freq beeän (2) - 1 freq bendin (2) - 14 freq meetin (2) - 147 freq eemis (2) - 10 freq bettin (2) - 12 freq beylin (2) - 1 freq |
beemin (0) - 1 freq beamin (1) - 25 freq weemin (2) - 176 freq beelin (2) - 22 freq beamiin (2) - 1 freq bumin (2) - 1 freq boomin (2) - 14 freq beepin (2) - 3 freq teemin (2) - 26 freq beein (2) - 14 freq feemin (2) - 1 freq beekin (2) - 10 freq seemin (2) - 14 freq breemin (2) - 1 freq beeline (3) - 3 freq booman (3) - 2 freq baegin (3) - 2 freq weeman (3) - 9 freq leamin (3) - 12 freq naemin (3) - 1 freq baetin (3) - 4 freq beatin (3) - 33 freq be-in (3) - 29 freq baein (3) - 20 freq beukin (3) - 1 freq |
SoundEx code - B550 benon - 1 freq bummin - 20 freq bowman - 4 freq beamin - 25 freq bounin - 1 freq banana - 45 freq bohemian - 2 freq boomin - 14 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 - BMN bummin - 20 freq bombin - 4 freq bowman - 4 freq beamin - 25 freq boomin - 14 freq bammin - 3 freq booman - 2 freq bumin - 1 freq bemoan - 1 freq beamiin - 1 freq beemin - 1 freq |
BEEMIN |
| Time to execute Levenshtein function - 0.379730 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.660482 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.065326 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.043046 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.001127 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. |