| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| babylonian (0) - 1 freq babylon (3) - 10 freq aberdonian (4) - 10 freq belongan (4) - 1 freq fallopian (4) - 1 freq caladonian (4) - 1 freq catalonians (4) - 2 freq amazonian (4) - 1 freq pamplonan (4) - 1 freq baronial (4) - 1 freq catalonia (4) - 8 freq beelongan (4) - 2 freq caledonian (4) - 10 freq cameronian (4) - 3 freq babblin (4) - 2 freq huttonian (5) - 1 freq cydonia (5) - 2 freq caledonia' (5) - 1 freq bosnian (5) - 1 freq baryons (5) - 1 freq gallopan (5) - 1 freq blendan (5) - 1 freq rakkonin (5) - 1 freq wallopin (5) - 16 freq blowan (5) - 5 freq |
babylonian (0) - 1 freq babylon (4) - 10 freq babblin (6) - 2 freq beelongan (6) - 2 freq yabblin (6) - 2 freq aberdonian (6) - 10 freq belongan (6) - 1 freq wabblin (7) - 5 freq nabblin (7) - 1 freq aiberdonian (7) - 1 freq blowin (7) - 14 freq baelan (7) - 2 freq belongin (7) - 1 freq bannan (7) - 1 freq blinkan (7) - 2 freq bairnin (7) - 2 freq ballin (7) - 3 freq binnian (7) - 2 freq beylin (7) - 1 freq beckonin (7) - 3 freq bailin (7) - 3 freq burgeonin (7) - 1 freq broonin (7) - 2 freq blooman (7) - 8 freq baalin (7) - 3 freq |
SoundEx code - B145 befylin - 1 freq bibblin - 2 freq beef-links - 1 freq bubblin - 29 freq bibblie-nibbit - 1 freq babblin - 2 freq babylon - 10 freq bubblen - 1 freq bafflin - 1 freq bubblan - 2 freq babylonian - 1 freq bubbling - 1 freq babbling - 2 freq baffling - 1 freq |
MetaPhone code - BBLNN babylonian - 1 freq |
BABYLONIAN |
| Time to execute Levenshtein function - 0.412608 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.676107 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.028711 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.076092 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.001299 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. |