| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bibblie-nibbit (0) - 1 freq gibble-gabble (6) - 2 freq billie-gait (6) - 6 freq dibble-ennit (6) - 1 freq gibbil-gabbil (6) - 1 freq bronze-nebbit (6) - 1 freq bubblie-joks (7) - 1 freq babbie-eatin (7) - 1 freq bibblin (7) - 2 freq nairrae-nebbit (7) - 2 freq glib-gabbit (7) - 2 freq boolie-backit (7) - 1 freq bubble-thin (7) - 1 freq tirlie-wirlie (7) - 1 freq cabbi-labbi (7) - 1 freq eabbi-labbi (7) - 1 freq bible-bearif (7) - 1 freq nerrae-nebbit (7) - 1 freq black-nebbit (7) - 1 freq blue-finskit (8) - 1 freq blae-backit (8) - 1 freq willie-waught (8) - 1 freq bull-bait (8) - 2 freq bonfire-bit (8) - 1 freq dillie-like (8) - 2 freq |
bibblie-nibbit (0) - 1 freq bronze-nebbit (9) - 1 freq dibble-ennit (9) - 1 freq gibbil-gabbil (9) - 1 freq gibble-gabble (9) - 2 freq black-nebbit (10) - 1 freq eabbi-labbi (11) - 1 freq bible-bearif (11) - 1 freq nerrae-nebbit (11) - 1 freq bubble-thin (11) - 1 freq cabbi-labbi (11) - 1 freq bubblie-joks (11) - 1 freq billie-gait (11) - 6 freq nairrae-nebbit (11) - 2 freq bibblin (11) - 2 freq glib-gabbit (11) - 2 freq lang-nebbit (12) - 3 freq nairra-nebbit (12) - 1 freq blabbit (12) - 1 freq yabb-yabbin (12) - 1 freq babblin (12) - 2 freq glegly-gabbit (12) - 2 freq dibber-dabber (12) - 1 freq babbling (12) - 2 freq bubblen (12) - 1 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 - BBLNBT bibblie-nibbit - 1 freq |
BIBBLIE-NIBBIT |
| Time to execute Levenshtein function - 0.249209 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.408890 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.030124 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.040524 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.000892 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. |