Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
restless (0) - 15 freq pastless (2) - 1 freq wrestles (2) - 1 freq ruitless (2) - 2 freq reckless (2) - 2 freq trestles (2) - 1 freq resiles (2) - 1 freq meatless (2) - 1 freq listless (2) - 1 freq reekless (2) - 1 freq eeseless (2) - 6 freq tentless (2) - 7 freq hertless (2) - 11 freq heatless (2) - 1 freq fearless (3) - 10 freq greatness (3) - 2 freq mesters (3) - 1 freq fendless (3) - 1 freq reevles (3) - 1 freq westies (3) - 1 freq vastness (3) - 1 freq breithless (3) - 2 freq enless (3) - 12 freq refleks (3) - 1 freq rescuers (3) - 2 freq |
restless (0) - 15 freq ruitless (3) - 2 freq listless (3) - 1 freq pastless (3) - 1 freq tentless (4) - 7 freq heatless (4) - 1 freq tasteless (4) - 4 freq unstlass (4) - 3 freq eeseless (4) - 6 freq hertless (4) - 11 freq reekless (4) - 1 freq wrestles (4) - 1 freq trestles (4) - 1 freq reckless (4) - 2 freq meatless (4) - 1 freq resiles (4) - 1 freq relentless (5) - 9 freq seemless (5) - 1 freq coatless (5) - 1 freq sealess (5) - 1 freq seamless (5) - 5 freq rustle (5) - 11 freq distress (5) - 11 freq rustled (5) - 4 freq bassless (5) - 1 freq |
SoundEx code - R234 restless - 15 freq rustl't - 1 freq rustlin - 10 freq rustle - 11 freq rightly - 10 freq rustlt - 1 freq recitals - 2 freq richtly - 49 freq rustled - 4 freq rest'll - 1 freq ruggedly - 2 freq richtlie' - 1 freq richtlie - 14 freq restlessness - 1 freq richt-like - 2 freq rustlan - 1 freq rustly - 1 freq reestled - 1 freq resattled - 1 freq re-sattled - 1 freq restalrig - 1 freq residual - 1 freq ragdolled - 1 freq ragdoll - 1 freq richt-weel - 1 freq reestle - 1 freq rosewoodlondon - 3 freq recital - 1 freq rhxdylultv - 1 freq |
MetaPhone code - RSTLS restless - 15 freq recitals - 2 freq wrestles - 1 freq |
RESTLESS rest - 696 freq resting - 4 freq rests - 11 freq rested - 12 freq restin - 31 freq restless - 15 freq restit - 18 freq unrest - 6 freq |
Time to execute Levenshtein function - 0.308546 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.651533 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.027642 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.090934 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.000968 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. |