| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| upbigg (0) - 2 freq upbig (1) - 6 freq prigg (2) - 4 freq rebigg (2) - 1 freq bigg (2) - 110 freq upbiggin (2) - 14 freq upbring (2) - 1 freq upbiggit (2) - 3 freq pig' (3) - 1 freq piggy (3) - 17 freq upbrak (3) - 2 freq eigg (3) - 3 freq uptight (3) - 3 freq upairt (3) - 1 freq numbing (3) - 1 freq prig (3) - 13 freq tubing (3) - 1 freq uptick (3) - 1 freq uptill (3) - 1 freq upwide (3) - 1 freq uplift (3) - 5 freq upwith (3) - 1 freq uplins (3) - 1 freq begg (3) - 24 freq uppity (3) - 6 freq |
upbigg (0) - 2 freq upbig (2) - 6 freq upbiggin (3) - 14 freq upbiggit (3) - 3 freq bigg (3) - 110 freq prigg (3) - 4 freq rebigg (3) - 1 freq begg (4) - 24 freq pjgg (4) - 1 freq biggy (4) - 1 freq upbring (4) - 1 freq piggy (4) - 17 freq big' (5) - 1 freq pig (5) - 171 freq pigs (5) - 98 freq bigs (5) - 2 freq aigg (5) - 6 freq tbitg (5) - 1 freq piggie (5) - 13 freq puggy (5) - 5 freq boggy (5) - 6 freq upbrak (5) - 2 freq big (5) - 2545 freq outligg (5) - 1 freq upbye (5) - 2 freq |
SoundEx code - U120 up's - 2 freq ups - 24 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 |
UPBIGG |
| Time to execute Levenshtein function - 0.376835 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.418192 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.028723 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.038032 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.001051 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. |