Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
twa-times (0) - 5 freq twatimes (1) - 1 freq twa-tumes (1) - 1 freq tea-time (2) - 8 freq two-timers (2) - 1 freq twa-taed (3) - 2 freq meantimes (3) - 1 freq tae-time (3) - 1 freq awtimes (3) - 1 freq aft-times (3) - 10 freq toasties (3) - 5 freq teatime (3) - 13 freq tatties (3) - 191 freq twantiet (3) - 2 freq taytime (3) - 1 freq thetimes (3) - 6 freq latimes (3) - 1 freq twenties (3) - 11 freq tawties (3) - 2 freq mealtimes (3) - 2 freq twinties (3) - 3 freq twa-wyes (3) - 1 freq aatimes (3) - 1 freq twa-tree (3) - 1 freq twartis (3) - 7 freq |
twa-times (0) - 5 freq twa-tumes (1) - 1 freq twatimes (2) - 1 freq two-timers (3) - 1 freq tea-time (4) - 8 freq twa-wyes (5) - 1 freq twinties (5) - 3 freq tawties (5) - 2 freq twa-tree (5) - 1 freq aw-time (5) - 1 freq twa-three (5) - 129 freq thetimes (5) - 6 freq atween-times (5) - 1 freq twartis (5) - 7 freq twenties (5) - 11 freq tae-time (5) - 1 freq twa-taed (5) - 2 freq awtimes (5) - 1 freq aft-times (5) - 10 freq four-times (6) - 1 freq towartis (6) - 2 freq twa-thrie (6) - 4 freq three-times (6) - 8 freq twae-three (6) - 6 freq bow-ties (6) - 1 freq |
SoundEx code - T352 tutankhamun - 1 freq titanic - 13 freq titans - 1 freq tidins - 8 freq tiding - 1 freq twatimes - 1 freq twa-times - 5 freq twa-tumes - 1 freq tay-things - 1 freq tidiness - 1 freq titanic' - 1 freq titnes - 1 freq tithonus - 1 freq tetanus - 1 freq tattie-masher - 1 freq teathings - 1 freq totems - 3 freq tittensor - 1 freq toting - 1 freq totemism - 1 freq thewitnessfortheprosecution - 1 freq thedons - 1 freq tweeting - 6 freq twiting - 1 freq thetimes - 6 freq thetimesscot - 6 freq touting - 1 freq thethingsyousee - 1 freq |
MetaPhone code - TWTMS twatimes - 1 freq twa-times - 5 freq twa-tumes - 1 freq |
TWA-TIMES |
Time to execute Levenshtein function - 0.212434 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.378267 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.029406 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.044659 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.000769 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. |