| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| babylon (0) - 10 freq babblin (2) - 2 freq sablon (2) - 1 freq baboon (2) - 1 freq baalin (3) - 3 freq ablow (3) - 336 freq gabblin (3) - 4 freq babel (3) - 7 freq baldoon (3) - 1 freq bubblen (3) - 1 freq baysin (3) - 1 freq lanyon (3) - 1 freq balloon (3) - 37 freq nylon (3) - 4 freq hallon (3) - 1 freq bibblin (3) - 2 freq bacon (3) - 61 freq ballot (3) - 10 freq battlen (3) - 2 freq nabblin (3) - 1 freq babbin (3) - 4 freq yabblin (3) - 2 freq ballo (3) - 1 freq abilow (3) - 7 freq baby' (3) - 1 freq |
babylon (0) - 10 freq baboon (3) - 1 freq yabblin (3) - 2 freq sablon (3) - 1 freq babblin (3) - 2 freq babylonian (4) - 1 freq bawlin (4) - 19 freq ballin (4) - 3 freq cablin (4) - 1 freq befylin (4) - 1 freq wabblin (4) - 5 freq bailin (4) - 3 freq bubblin (4) - 29 freq bubblan (4) - 2 freq bylin (4) - 13 freq boabyluv (4) - 3 freq bob-on (4) - 1 freq beylin (4) - 1 freq babbin (4) - 4 freq baelan (4) - 2 freq beylen (4) - 1 freq balloon (4) - 37 freq bubblen (4) - 1 freq baalin (4) - 3 freq babel (4) - 7 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 - BBLN bibblin - 2 freq bubblin - 29 freq babblin - 2 freq babylon - 10 freq bubblen - 1 freq bubblan - 2 freq |
BABYLON |
| Time to execute Levenshtein function - 0.314632 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.710553 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.088248 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.102395 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.000878 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. |