| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ubg (0) - 4 freq ug (1) - 6 freq ub (1) - 3 freq bg (1) - 5 freq ung (1) - 1 freq ulg (1) - 1 freq abg (1) - 1 freq ebg (1) - 1 freq uog (1) - 1 freq ubgt (1) - 1 freq cbg (1) - 1 freq obg (1) - 1 freq nog (2) - 3 freq tuba (2) - 1 freq mbs (2) - 2 freq mug (2) - 45 freq rbj (2) - 1 freq g (2) - 275 freq uu (2) - 3 freq hbv (2) - 1 freq cog (2) - 3 freq kg (2) - 4 freq tcg (2) - 1 freq gubs (2) - 1 freq usa (2) - 52 freq |
ubg (0) - 4 freq ebg (1) - 1 freq bg (1) - 5 freq abg (1) - 1 freq obg (1) - 1 freq beg (2) - 74 freq big (2) - 2449 freq bog (2) - 54 freq bag (2) - 321 freq bug (2) - 57 freq cbg (2) - 1 freq ubgt (2) - 1 freq ub (2) - 3 freq ug (2) - 6 freq ulg (2) - 1 freq ung (2) - 1 freq uog (2) - 1 freq ibv (3) - 2 freq lg (3) - 4 freq abs (3) - 1 freq bj (3) - 15 freq hg (3) - 5 freq bw (3) - 3 freq beig (3) - 6 freq ubun (3) - 1 freq |
SoundEx code - U120 up's - 2 freq ups - 22 freq upbig - 6 freq upheeze - 4 freq upbigg - 2 freq ufos - 3 freq uypj - 1 freq upx - 1 freq uawebbj - 1 freq uffhkky - 1 freq uofg - 1 freq ubg - 4 freq uvs - 1 freq ufhx - 1 freq |
MetaPhone code - UBK ubg - 4 freq |
UBG |
| Time to execute Levenshtein function - 0.198069 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.332116 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.028519 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.041375 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.001002 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. |