| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tablecover (0) - 1 freq takeover (3) - 2 freq allover (4) - 3 freq falconer (4) - 11 freq makeover (4) - 5 freq taegevver (4) - 1 freq blecker (4) - 2 freq blecher (4) - 2 freq tablecloth (4) - 4 freq alcoves (4) - 1 freq toblerone (4) - 1 freq tablecloot (4) - 4 freq bedcover (4) - 1 freq recover (4) - 7 freq tablecloots (4) - 3 freq tableclothed (4) - 1 freq alcove (4) - 4 freq above (5) - 149 freq plover (5) - 9 freq teecher (5) - 1 freq telescope (5) - 20 freq talented (5) - 8 freq welcomer (5) - 1 freq taiglesome (5) - 6 freq table' (5) - 1 freq |
tablecover (0) - 1 freq bedcover (6) - 1 freq blecher (6) - 2 freq tablecloot (6) - 4 freq takeover (6) - 2 freq blecker (6) - 2 freq recover (7) - 7 freq alcove (7) - 4 freq blacker (7) - 4 freq blocker (7) - 2 freq onbelever (7) - 1 freq bleacher (7) - 1 freq tablecloots (7) - 3 freq taegevver (7) - 1 freq toblerone (7) - 1 freq alcoves (7) - 1 freq allover (7) - 3 freq falconer (7) - 11 freq tablecloth (7) - 4 freq tabaccae (8) - 2 freq sleepover (8) - 1 freq beaver (8) - 5 freq blickery (8) - 2 freq recovery (8) - 13 freq palaiver (8) - 2 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 - TBLKFR tablecover - 1 freq |
TABLECOVER |
| Time to execute Levenshtein function - 0.226637 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.385639 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.028434 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.037303 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.000904 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. |