| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bammin (0) - 3 freq hammin (1) - 1 freq brammin (1) - 1 freq lammin (1) - 2 freq rammin (1) - 3 freq bummin (1) - 20 freq bampin (1) - 1 freq jammin (1) - 4 freq barrin (2) - 7 freq bachin (2) - 2 freq bastin (2) - 1 freq gammie (2) - 4 freq lampin (2) - 6 freq namin (2) - 6 freq baalin (2) - 3 freq baein (2) - 20 freq summin (2) - 36 freq blimmin (2) - 2 freq batmen (2) - 1 freq baimie (2) - 1 freq gammlin (2) - 5 freq barmen (2) - 1 freq eamin (2) - 1 freq bambi (2) - 1 freq bailin (2) - 3 freq |
bammin (0) - 3 freq bummin (1) - 20 freq jammin (2) - 4 freq rammin (2) - 3 freq bampin (2) - 1 freq lammin (2) - 2 freq hammin (2) - 1 freq brammin (2) - 1 freq himmin (3) - 4 freq bumming (3) - 2 freq bodmin (3) - 1 freq bombin (3) - 4 freq beemin (3) - 1 freq beamin (3) - 25 freq blamin (3) - 6 freq bumpin (3) - 9 freq boomin (3) - 14 freq hummin (3) - 18 freq bummlin (3) - 2 freq wamman (3) - 1 freq jammen (3) - 1 freq bumin (3) - 1 freq bammed (3) - 1 freq bammy (3) - 2 freq gemmin (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 |
BAMMIN |
| Time to execute Levenshtein function - 0.220476 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.434683 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.057616 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.037130 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.000798 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. |