Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
lintels (0) - 2 freq lintel (1) - 6 freq lintols (1) - 2 freq winters (2) - 21 freq incels (2) - 1 freq inte's (2) - 13 freq lintie's (2) - 3 freq lines (2) - 216 freq lintul's (2) - 1 freq liners (2) - 2 freq pinters (2) - 1 freq listens (2) - 24 freq ainsels (2) - 1 freq linties (2) - 3 freq blinters (2) - 1 freq linens (2) - 1 freq winkels (2) - 1 freq line's (2) - 2 freq ingels (2) - 2 freq landels (2) - 1 freq lentils (2) - 2 freq lingers (2) - 6 freq lires (3) - 1 freq intult (3) - 1 freq pintle (3) - 2 freq |
lintels (0) - 2 freq lintols (1) - 2 freq lentils (2) - 2 freq lintel (2) - 6 freq linties (3) - 3 freq landels (3) - 1 freq lintul's (3) - 1 freq lintie's (3) - 3 freq lingers (4) - 6 freq dentals (4) - 1 freq lanths (4) - 1 freq lunts (4) - 1 freq rentals (4) - 2 freq ingels (4) - 2 freq entaels (4) - 1 freq lentil (4) - 5 freq lenths (4) - 6 freq lents (4) - 1 freq listens (4) - 24 freq lines (4) - 216 freq pinters (4) - 1 freq line's (4) - 2 freq liners (4) - 2 freq inte's (4) - 13 freq incels (4) - 1 freq |
SoundEx code - L534 landlady - 9 freq landlord - 8 freq lintel - 6 freq land-tiller - 1 freq lintul's - 1 freq lintels - 2 freq landline - 1 freq lentil - 5 freq limitless - 1 freq landlockit - 1 freq lintols - 2 freq landlairds - 1 freq lentils - 2 freq landles - 2 freq landels - 1 freq landladies - 1 freq |
MetaPhone code - LNTLS lintul's - 1 freq lintels - 2 freq lintols - 2 freq lentils - 2 freq landles - 2 freq landels - 1 freq |
LINTELS |
Time to execute Levenshtein function - 0.361606 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.588859 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.029484 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.085443 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.000956 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. |