Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
non-english (0) - 5 freq anti-english (3) - 1 freq €˜english (4) - 3 freq daahenglish (4) - 2 freq qmaenglish (4) - 1 freq mcenglish (4) - 2 freq english (4) - 1428 freq ajenglish (4) - 1 freq €œenglish (4) - 1 freq un-inglis (4) - 1 freq nonsense (5) - 77 freq 'english' (5) - 1 freq non-native (5) - 2 freq lukejenglish (5) - 2 freq engish (5) - 2 freq english' (5) - 6 freq northern-english (5) - 1 freq englishy (5) - 1 freq anglish (5) - 1 freq non-nation (5) - 1 freq panglish (5) - 1 freq englis (5) - 6 freq engliesh (5) - 9 freq englisch (5) - 1 freq inglish (5) - 156 freq |
non-english (0) - 5 freq anti-english (4) - 1 freq un-inglis (6) - 1 freq ajenglish (7) - 1 freq english (7) - 1428 freq €œenglish (7) - 1 freq mcenglish (7) - 2 freq €˜english (7) - 3 freq daahenglish (7) - 2 freq qmaenglish (7) - 1 freq panglish (8) - 1 freq anglish (8) - 1 freq engliesh (8) - 9 freq in-gleesh (8) - 4 freq englishy (8) - 1 freq jamesenglish (8) - 2 freq inglish (8) - 156 freq non-inclusion (8) - 1 freq lukejenglish (8) - 2 freq inglesh (9) - 3 freq pentangles (9) - 1 freq engleesh (9) - 9 freq nonsense (9) - 77 freq newfangles (9) - 1 freq monolingulism (9) - 1 freq |
SoundEx code - N552 ninian's - 3 freq newman's - 6 freq non-answers - 1 freq nae-nonsense - 1 freq nine-inch - 1 freq non-english - 5 freq ninians - 3 freq non-inclusion - 1 freq nae-man's-laund - 1 freq naming - 2 freq newmains - 1 freq nominees - 2 freq |
MetaPhone code - NNNKLX non-english - 5 freq |
NON-ENGLISH |
Time to execute Levenshtein function - 0.364754 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.526671 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.027534 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.071632 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.000802 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. |