Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
lug-rattlin (0) - 1 freq prattlin (4) - 1 freq sprattlin (4) - 4 freq brattlin (4) - 8 freq rattlin (4) - 52 freq leg-marlin (4) - 1 freq lug-dirlin (4) - 1 freq grabblin (5) - 1 freq futtlin (5) - 1 freq traitlin (5) - 1 freq graftin (5) - 6 freq gratin (5) - 4 freq cuttlin (5) - 1 freq drittlin (5) - 2 freq migratin (5) - 1 freq luxuriatin (5) - 1 freq battlin (5) - 5 freq wrastlin (5) - 3 freq grantin (5) - 2 freq littlin (5) - 17 freq lug-in (5) - 4 freq scrattin (5) - 10 freq liberatin (5) - 2 freq sugarallie (5) - 3 freq regrettin (5) - 7 freq |
lug-rattlin (0) - 1 freq leg-marlin (7) - 1 freq rattlin (7) - 52 freq lug-dirlin (7) - 1 freq prattlin (7) - 1 freq sprattlin (7) - 4 freq brattlin (7) - 8 freq regrettin (8) - 7 freq rattlan (8) - 5 freq rettlin (8) - 2 freq trottlin (8) - 1 freq drittlin (8) - 2 freq littlin (8) - 17 freq grittin (8) - 3 freq gruntlin (8) - 2 freq scrittlin (8) - 1 freq out-pittin (9) - 1 freq brastlin (9) - 1 freq gyratin (9) - 1 freq ingratiatin (9) - 1 freq lang-lastin (9) - 1 freq lattin (9) - 53 freq greittin (9) - 2 freq ill-fittin (9) - 3 freq lang-settled (9) - 1 freq |
SoundEx code - L263 lizard - 32 freq lizard's - 7 freq lucrative - 2 freq lacquert - 1 freq laceratin - 1 freq lizards - 4 freq lazaretto - 1 freq lacerated - 1 freq leisured - 1 freq lug-rattlin - 1 freq lockhart - 4 freq lockhart's - 1 freq laceratit - 1 freq laggered - 2 freq logarithms - 1 freq lgarden - 1 freq luxuriatin - 1 freq lozart - 1 freq |
MetaPhone code - LKRTLN lug-rattlin - 1 freq |
LUG-RATTLIN |
Time to execute Levenshtein function - 0.308296 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.514971 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.030921 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.043274 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.001211 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. |