| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uslanguagesoc (0) - 2 freq oxlanguages (4) - 1 freq 'languages (4) - 1 freq languages' (4) - 2 freq languagesnac (4) - 1 freq languagedom (4) - 1 freq languages (4) - 317 freq language (5) - 1435 freq language's (5) - 3 freq 'language (5) - 5 freq language'll (5) - 1 freq language (5) - 1 freq languedoc (5) - 1 freq language-no (5) - 1 freq langages (5) - 23 freq language' (5) - 13 freq langage (6) - 244 freq islandmagee (6) - 1 freq islan'magee (6) - 2 freq languages (6) - 1 freq languge (6) - 1 freq langues (6) - 1 freq languag (6) - 1 freq lang-ago (6) - 1 freq plagues (7) - 4 freq |
uslanguagesoc (0) - 2 freq languages (6) - 317 freq languagesnac (6) - 1 freq languages' (6) - 2 freq oxlanguages (6) - 1 freq 'languages (6) - 1 freq langages (7) - 23 freq languagedom (7) - 1 freq languedoc (8) - 1 freq language (8) - 1 freq language' (8) - 13 freq language-no (8) - 1 freq language's (8) - 3 freq language (8) - 1435 freq 'language (8) - 5 freq languge (9) - 1 freq langues (9) - 1 freq languag (9) - 1 freq language'll (9) - 1 freq slounges (9) - 1 freq langage (9) - 244 freq langauge (10) - 2 freq langsom (10) - 1 freq lungfaes (10) - 1 freq slings (10) - 2 freq |
SoundEx code - U245 uglian - 2 freq ugliness - 1 freq uslanguagesoc - 2 freq uswlemag - 1 freq ukulemae - 5 freq |
MetaPhone code - USLNKJSK uslanguagesoc - 2 freq |
USLANGUAGESOC |
| Time to execute Levenshtein function - 0.270091 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.450553 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.028338 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.045505 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.001160 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. |