| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| baklins (0) - 7 freq backlins (1) - 18 freq bawlin (2) - 19 freq aalins (2) - 2 freq baling (2) - 1 freq barelins (2) - 1 freq baking (2) - 9 freq bakin (2) - 23 freq railins (2) - 22 freq bailies (2) - 2 freq basins (2) - 1 freq baegins (2) - 1 freq darlins (2) - 4 freq ailins (2) - 1 freq mailins (2) - 1 freq bayliss (2) - 1 freq bawling (2) - 1 freq butlins (2) - 1 freq birlins (2) - 1 freq ballin (2) - 3 freq inklins (2) - 2 freq saplins (2) - 2 freq hanlins (2) - 1 freq pailins (2) - 4 freq baalin (2) - 3 freq |
baklins (0) - 7 freq backlins (2) - 18 freq barelins (3) - 1 freq birlins (3) - 1 freq inklins (3) - 2 freq butlins (3) - 1 freq walins (4) - 2 freq dailins (4) - 4 freq bakis (4) - 1 freq makins (4) - 1 freq backins (4) - 2 freq bawlin' (4) - 3 freq makkins (4) - 12 freq bailin (4) - 3 freq takkins (4) - 1 freq bankins (4) - 2 freq palins (4) - 8 freq blens (4) - 1 freq yiblins (4) - 1 freq klines (4) - 1 freq bikinis (4) - 1 freq backlauns (4) - 1 freq baloons (4) - 1 freq balloons (4) - 16 freq failins (4) - 1 freq |
SoundEx code - B245 beglaummer't - 1 freq backlan's - 1 freq beglamourt - 1 freq backlins-comin - 2 freq bucklin - 7 freq becalmed - 2 freq beglamour - 3 freq beglamoured - 1 freq becalm - 2 freq beguilin - 1 freq beglamourin - 5 freq basslin - 1 freq backlins - 18 freq backlands - 1 freq baklins - 7 freq backleens - 1 freq bogilan - 1 freq backlauns - 1 freq back-lyin - 1 freq boglands - 1 freq €˜baseline - 1 freq bauchlin - 1 freq baseline - 2 freq bbclamacqshow - 1 freq bbcaileenclarke - 1 freq |
MetaPhone code - BKLNS backlan's - 1 freq backlins - 18 freq baklins - 7 freq backleens - 1 freq backlauns - 1 freq |
BAKLINS |
| Time to execute Levenshtein function - 0.178516 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.413500 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.059209 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.036791 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.000856 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. |