| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| upbiggin (0) - 14 freq upbiggit (1) - 3 freq up-biggin (1) - 1 freq upbringin (2) - 4 freq priggin (2) - 23 freq rebiggin (2) - 4 freq biggin (2) - 208 freq piggin (2) - 10 freq 'biggin (2) - 6 freq upbigg (2) - 2 freq uprisin (3) - 5 freq 'boggin (3) - 3 freq nyiggin (3) - 1 freq liggin (3) - 32 freq priggen (3) - 1 freq upbringing (3) - 4 freq uggin (3) - 3 freq upbig (3) - 6 freq priggit (3) - 28 freq pluggin (3) - 3 freq proggin (3) - 8 freq friggin (3) - 6 freq riggin (3) - 20 freq biggit (3) - 244 freq inbiggit (3) - 7 freq |
upbiggin (0) - 14 freq up-biggin (2) - 1 freq upbiggit (2) - 3 freq 'biggin (3) - 6 freq upbigg (3) - 2 freq biggin (3) - 208 freq piggin (3) - 10 freq rebiggin (3) - 4 freq priggin (3) - 23 freq proggin (4) - 8 freq pluggin (4) - 3 freq biggan (4) - 7 freq baggin (4) - 2 freq a-beggin (4) - 2 freq beggin (4) - 33 freq boggin (4) - 58 freq priggen (4) - 1 freq 'boggin (4) - 3 freq upbringin (4) - 4 freq biggid (5) - 4 freq thiggin (5) - 2 freq biggeen (5) - 6 freq bigging (5) - 1 freq peingin (5) - 2 freq tiggin (5) - 2 freq |
SoundEx code - U125 up-biggin - 1 freq upcounty - 1 freq upcome - 2 freq upgiein - 1 freq upheezin - 2 freq upbiggin - 14 freq upgaun - 2 freq ups-an-douns - 1 freq upgeen - 1 freq upcumm - 1 freq upgyangin - 1 freq upcum - 2 freq upcomes - 1 freq upcommin - 1 freq ufqqzmie - 1 freq upgmlvtpq - 1 freq upcomin - 3 freq uofgenglishlang - 4 freq upcoming - 3 freq |
MetaPhone code - UPBKN up-biggin - 1 freq upbiggin - 14 freq |
UPBIGGIN |
| Time to execute Levenshtein function - 0.221292 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.374593 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.027149 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.037330 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.000840 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. |