| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| us-led (0) - 1 freq hustled (2) - 1 freq rustled (2) - 4 freq used (2) - 682 freq fussled (2) - 7 freq fustled (2) - 1 freq ushed (2) - 1 freq sled (2) - 7 freq tummled (3) - 4 freq wyled (3) - 2 freq culled (3) - 3 freq sles (3) - 1 freq iled (3) - 1 freq busked (3) - 5 freq spiled (3) - 7 freq soed (3) - 1 freq gushed (3) - 1 freq scaled (3) - 7 freq jiled (3) - 5 freq veiled (3) - 3 freq shaed (3) - 4 freq fumbled (3) - 5 freq yalled (3) - 5 freq reled (3) - 1 freq tusseled (3) - 1 freq |
us-led (0) - 1 freq sled (3) - 7 freq easy-led (3) - 1 freq solid (4) - 73 freq sealed (4) - 18 freq selled (4) - 1 freq sld (4) - 9 freq soiled (4) - 2 freq asleid (4) - 1 freq salad (4) - 30 freq sailed (4) - 32 freq sklid (4) - 1 freq styled (4) - 1 freq sold (4) - 26 freq spyled (4) - 5 freq sauled (4) - 4 freq suld (4) - 11 freq smiled (4) - 238 freq scaled (4) - 7 freq rustled (4) - 4 freq slid (4) - 33 freq used (4) - 682 freq fustled (4) - 1 freq fussled (4) - 7 freq ushed (4) - 1 freq |
SoundEx code - U243 us-led - 1 freq uxelledonium - 1 freq uggledlugs - 13 freq ujlt - 2 freq |
MetaPhone code - USLT us-led - 1 freq |
US-LED |
| Time to execute Levenshtein function - 0.234279 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.424795 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.028414 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.038176 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.001123 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. |