| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| langlegs (0) - 3 freq lang-legs (1) - 1 freq landles (2) - 2 freq manglers (2) - 1 freq langues (2) - 1 freq bangles (2) - 3 freq rangles (2) - 1 freq angles (2) - 25 freq tangles (2) - 3 freq anglers (2) - 1 freq sangless (2) - 2 freq dangles (2) - 1 freq mingles (3) - 1 freq langl't (3) - 2 freq kungles (3) - 1 freq lanley's (3) - 1 freq hangers (3) - 1 freq langue (3) - 2 freq lang'ls (3) - 2 freq languge (3) - 1 freq longley (3) - 2 freq lanley (3) - 1 freq gargles (3) - 1 freq handles (3) - 4 freq danglies (3) - 2 freq |
langlegs (0) - 3 freq lang-legs (2) - 1 freq anglers (4) - 1 freq sangless (4) - 2 freq languages (4) - 313 freq tangles (4) - 3 freq langages (4) - 23 freq dangles (4) - 1 freq angles (4) - 25 freq landles (4) - 2 freq langues (4) - 1 freq manglers (4) - 1 freq bangles (4) - 3 freq rangles (4) - 1 freq lang's (5) - 32 freq glegs (5) - 1 freq lingers (5) - 6 freq langs (5) - 1 freq ingle's (5) - 2 freq ingles (5) - 1 freq langelt (5) - 1 freq singles (5) - 5 freq legless (5) - 3 freq angeles (5) - 4 freq anglais (5) - 2 freq |
SoundEx code - L524 langholm - 7 freq lainsel - 2 freq loincloth - 1 freq lang-luggit - 3 freq lang-shillit - 1 freq lincluden - 8 freq linklater - 2 freq lang-lippit - 1 freq lang-loast - 1 freq lang-lost - 1 freq langl't - 2 freq lang'ls - 2 freq lang'lt - 1 freq lang-legged - 1 freq lang-legs - 1 freq lang'l - 1 freq lingel-backit - 1 freq longley - 2 freq lang-lestin - 1 freq lang'll - 1 freq lang-liggit - 1 freq lincoln - 3 freq langlegs - 3 freq lang-lugged - 2 freq lang-lown - 1 freq lang-lastin - 1 freq langlie-itis - 1 freq lang-lie-itis - 2 freq long-lost - 1 freq langelt - 1 freq leanneglenxox - 3 freq liammcilvanney - 4 freq liamgallagher - 1 freq limekilns - 1 freq langlumreek - 1 freq llinoselinowen - 1 freq lmjlm - 1 freq laingcollection - 1 freq |
MetaPhone code - LNKLKS lang-legs - 1 freq langlegs - 3 freq |
LANGLEGS |
| Time to execute Levenshtein function - 0.198485 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.358325 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.028049 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.038210 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.000892 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. |