Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
taiglesome (0) - 6 freq canglesome (2) - 1 freq taigles (3) - 4 freq taiversome (3) - 2 freq wranglesome (3) - 1 freq halesome (3) - 9 freq hailsome (3) - 3 freq toilsome (3) - 1 freq tiresome (3) - 6 freq taigled (4) - 3 freq laithsome (4) - 8 freq timorsome (4) - 13 freq awesome (4) - 35 freq trauchlesome (4) - 5 freq kittlesome (4) - 8 freq litesome (4) - 1 freq lanesome (4) - 29 freq angersome (4) - 1 freq taiglet (4) - 1 freq eightsome (4) - 6 freq hecklesome (4) - 1 freq aigles (4) - 1 freq gledsome (4) - 7 freq langsome (4) - 8 freq hairtsome (4) - 5 freq |
taiglesome (0) - 6 freq taigilsum (4) - 1 freq taigles (4) - 4 freq toilsome (4) - 1 freq canglesome (4) - 1 freq tiresome (5) - 6 freq hailsome (5) - 3 freq taiversome (5) - 2 freq halesome (5) - 9 freq tuithsome (6) - 1 freq wholesome (6) - 1 freq dulesome (6) - 18 freq mettlesome (6) - 2 freq tangles (6) - 3 freq aigles (6) - 1 freq wilsome (6) - 1 freq taigle (6) - 10 freq glegsome (6) - 3 freq troublesome (6) - 4 freq treesome (6) - 1 freq gledsome (6) - 7 freq taiglet (6) - 1 freq angersome (6) - 1 freq kittlesome (6) - 8 freq timorsome (6) - 13 freq |
SoundEx code - T242 taigles - 4 freq tough-lookin - 1 freq tickles - 5 freq tashless - 3 freq taigilsum - 1 freq tousles - 3 freq tequilas - 1 freq tassels - 1 freq tigellius - 3 freq theesels - 1 freq taiglesome - 6 freq toggles - 1 freq tassles - 1 freq tousie-lyeukin - 1 freq tossils - 1 freq touzles - 1 freq toozles - 1 freq thick-lasht - 1 freq tsl's - 1 freq tackles - 3 freq tagalog - 2 freq tossels - 1 freq ticklish - 2 freq taeclaas - 1 freq ttaczulizi - 1 freq thegellick - 1 freq theglasgowvoice - 1 freq tjcllqef - 1 freq tycalskd - 1 freq |
MetaPhone code - TKLSM taiglesome - 6 freq |
TAIGLESOME |
Time to execute Levenshtein function - 0.197398 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.355065 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.028288 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.042491 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.000944 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. |