Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
upbig (0) - 6 freq upbigg (1) - 2 freq 'big (2) - 7 freq uppin (2) - 1 freq pig (2) - 170 freq upbye (2) - 2 freq upby (2) - 9 freq €œbig (2) - 4 freq prig (2) - 13 freq big (2) - 2449 freq upain (2) - 1 freq €˜big (2) - 4 freq 'pig (2) - 1 freq sprig (2) - 6 freq ubg (2) - 4 freq a-big (2) - 1 freq peig (2) - 1 freq upbring (2) - 1 freq ubun (3) - 1 freq apg (3) - 1 freq unit (3) - 41 freq gig (3) - 36 freq epril (3) - 1 freq cuppin (3) - 6 freq ugie (3) - 1 freq |
upbig (0) - 6 freq upbigg (2) - 2 freq big (3) - 2449 freq a-big (3) - 1 freq peig (3) - 1 freq prig (3) - 13 freq ubg (3) - 4 freq 'big (3) - 7 freq pig (3) - 170 freq upbye (3) - 2 freq upby (3) - 9 freq dbyg (4) - 1 freq pzg (4) - 1 freq beg (4) - 74 freq pba (4) - 1 freq pasg (4) - 1 freq ebg (4) - 1 freq pbs (4) - 1 freq pong (4) - 1 freq 'bug (4) - 1 freq pxg (4) - 1 freq pang (4) - 3 freq plug (4) - 28 freq pleg (4) - 2 freq beig (4) - 6 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 - UPBK upbig - 6 freq upbigg - 2 freq |
UPBIG |
Time to execute Levenshtein function - 0.210126 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.328060 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.027192 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.050565 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.000815 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. |