Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
teenless (0) - 1 freq cenless (2) - 1 freq teeniest (2) - 1 freq enless (2) - 12 freq needless (2) - 16 freq thenkless (2) - 1 freq teetles (2) - 1 freq keenness (2) - 1 freq tentless (2) - 7 freq bienless (2) - 2 freq reekless (2) - 1 freq weerless (2) - 2 freq peerless (2) - 1 freq seemless (2) - 1 freq treeless (2) - 3 freq heedless (2) - 6 freq deedless (2) - 1 freq teenies (2) - 3 freq yearless (3) - 1 freq soonless (3) - 2 freq thowless (3) - 5 freq kennlers (3) - 1 freq feyness (3) - 1 freq teegers (3) - 36 freq beetles (3) - 2 freq |
teenless (0) - 1 freq bienless (3) - 2 freq treeless (3) - 3 freq tentless (3) - 7 freq tuneless (3) - 2 freq cenless (3) - 1 freq enless (3) - 12 freq oonless (4) - 4 freq winless (4) - 1 freq timeless (4) - 5 freq sounless (4) - 2 freq towless (4) - 1 freq stainless (4) - 3 freq onless (4) - 7 freq muinless (4) - 4 freq dinless (4) - 1 freq moonless (4) - 1 freq 'unless (4) - 4 freq tapless (4) - 2 freq tenses (4) - 8 freq wanless (4) - 3 freq sunless (4) - 1 freq boonless (4) - 1 freq bounless (4) - 1 freq tireless (4) - 1 freq |
SoundEx code - T542 tunnels - 11 freq tuneless - 2 freq timeliest - 1 freq timeless - 5 freq time-less - 1 freq tummles - 2 freq taenails - 2 freq taen-like - 3 freq tunnel's - 1 freq then-always - 1 freq teenless - 1 freq toonmils - 1 freq taen-lik - 1 freq tonnels - 1 freq |
MetaPhone code - TNLS tunnels - 11 freq daniel's - 17 freq tuneless - 2 freq daniels - 1 freq taenails - 2 freq tunnel's - 1 freq dinnles - 1 freq dinless - 1 freq teenless - 1 freq tonnels - 1 freq |
TEENLESS |
Time to execute Levenshtein function - 0.252721 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.400973 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.030242 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.044017 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.001026 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. |