Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
tableclothed (0) - 1 freq tablecloth (2) - 4 freq tablecloots (4) - 3 freq tablecover (4) - 1 freq tableclaith (4) - 1 freq tablecloot (4) - 4 freq tableheid (5) - 1 freq allotted (5) - 1 freq table-claith (5) - 1 freq talented (5) - 8 freq belloched (5) - 21 freq bedclothes (5) - 1 freq table-cloot (5) - 4 freq clothed (5) - 2 freq walloched (5) - 1 freq able-bodied (5) - 2 freq alloued (6) - 54 freq false-toothed (6) - 1 freq haufclosed (6) - 1 freq bothed (6) - 1 freq galloped (6) - 7 freq blenched (6) - 2 freq bellowed (6) - 2 freq blecher (6) - 2 freq tallied (6) - 1 freq |
tableclothed (0) - 1 freq tablecloth (3) - 4 freq tableclaith (5) - 1 freq tablecloots (6) - 3 freq tablecloot (6) - 4 freq table-claith (7) - 1 freq bedclothes (8) - 1 freq clothed (8) - 2 freq belloched (8) - 21 freq table-cloot (8) - 4 freq tablecover (8) - 1 freq tableheid (8) - 1 freq calculated (9) - 1 freq boolmoothed (9) - 1 freq bedclathes (9) - 1 freq talented (9) - 8 freq oilcloth (9) - 3 freq bleached (9) - 9 freq walloched (9) - 1 freq allotted (9) - 1 freq ballooned (10) - 1 freq selected (10) - 8 freq deflected (10) - 2 freq inflected (10) - 2 freq table-end (10) - 1 freq |
SoundEx code - T142 tables - 84 freq tablespoon - 3 freq tablecloots - 3 freq thapples - 1 freq taible's - 1 freq thaveless - 3 freq tablecloth - 4 freq table-cloot - 4 freq tablecloot - 4 freq tapless - 2 freq theophilus - 3 freq tableaux - 2 freq topless - 1 freq tablespoons - 1 freq taibils - 1 freq taebles - 2 freq thieveless - 1 freq tablecover - 1 freq thepolis - 1 freq table-claith - 1 freq tableclaith - 1 freq thaveless - 1 freq thapple's - 1 freq tableclothed - 1 freq toiflwc - 1 freq tffpilxiue - 1 freq teevliks - 1 freq tvalsbikqb - 1 freq |
MetaPhone code - TBLKL0T tableclothed - 1 freq |
TABLECLOTHED |
Time to execute Levenshtein function - 0.233880 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.406910 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.029016 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.043599 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.000979 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. |