| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jabberin (0) - 1 freq jabberin' (1) - 1 freq gibberin (2) - 5 freq jabbin (2) - 8 freq blabberin (2) - 2 freq jabber (2) - 4 freq jabbered (2) - 1 freq nabberie (2) - 1 freq hubberin (2) - 1 freq saberin (2) - 1 freq slabberin (2) - 5 freq barberin (2) - 1 freq waterin (3) - 7 freq touberin (3) - 1 freq jynerin (3) - 5 freq banterin (3) - 1 freq walterin (3) - 3 freq jaunnerin (3) - 1 freq barterin (3) - 1 freq oarderin (3) - 3 freq alterin (3) - 2 freq danderin (3) - 6 freq paperin (3) - 2 freq slabbrin (3) - 1 freq glaiberin (3) - 1 freq |
jabberin (0) - 1 freq jabberin' (2) - 1 freq jabber (3) - 4 freq jabbered (3) - 1 freq jabbin (3) - 8 freq gibberin (3) - 5 freq hubberin (3) - 1 freq slabberin (4) - 5 freq jibblin (4) - 1 freq barberin (4) - 1 freq saberin (4) - 1 freq blabberin (4) - 2 freq nabberie (4) - 1 freq labourin (5) - 3 freq sabbin (5) - 10 freq slabbern (5) - 1 freq soberin (5) - 2 freq joinerin (5) - 1 freq babbin (5) - 4 freq junnerin (5) - 1 freq lumberin (5) - 1 freq habbert (5) - 1 freq jabblie (5) - 1 freq nabbin (5) - 2 freq jarrin (5) - 2 freq |
SoundEx code - J165 jabberin - 1 freq jabberin' - 1 freq jbriancraig - 1 freq joeyburns - 1 freq |
MetaPhone code - JBRN gibberin - 5 freq gibran - 1 freq jabberin - 1 freq jabberin' - 1 freq |
JABBERIN |
| Time to execute Levenshtein function - 0.294797 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.587762 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.028968 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.097618 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.001169 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. |