| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ulls (0) - 1 freq fulls (1) - 2 freq gulls (1) - 20 freq lulls (1) - 2 freq dulls (1) - 1 freq hulls (1) - 9 freq bulls (1) - 11 freq ills (1) - 36 freq pulls (1) - 61 freq wulls (1) - 2 freq culls (1) - 2 freq mulls (1) - 6 freq ull (1) - 24 freq uis (2) - 17 freq sles (2) - 1 freq uill (2) - 4 freq ujlt (2) - 2 freq wels (2) - 5 freq alas (2) - 43 freq curls (2) - 37 freq olds (2) - 3 freq wls (2) - 1 freq uks (2) - 1 freq lle (2) - 1 freq umes (2) - 1 freq |
ulls (0) - 1 freq ills (1) - 36 freq yalls (2) - 2 freq allus (2) - 4 freq ull (2) - 24 freq alles (2) - 1 freq yills (2) - 2 freq yells (2) - 10 freq lols (2) - 2 freq mulls (2) - 6 freq ellis (2) - 3 freq dulls (2) - 1 freq culls (2) - 2 freq lulls (2) - 2 freq gulls (2) - 20 freq fulls (2) - 2 freq bulls (2) - 11 freq hulls (2) - 9 freq wulls (2) - 2 freq pulls (2) - 61 freq sls (3) - 8 freq aulds (3) - 3 freq all' (3) - 3 freq tyls (3) - 1 freq ils (3) - 1 freq |
SoundEx code - U420 'uls' - 1 freq ulujk - 1 freq ulg - 1 freq ulls - 1 freq |
MetaPhone code - ULS 'uls' - 1 freq ulls - 1 freq |
ULLS |
| Time to execute Levenshtein function - 0.248587 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.337190 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.028659 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.038786 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.001149 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. |