Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
wheezled (0) - 1 freq wheedled (1) - 2 freq wheeled (1) - 14 freq wheepled (1) - 3 freq wheezed (1) - 3 freq wheezles (1) - 1 freq wheeched (2) - 47 freq wheelied (2) - 1 freq wheezes (2) - 1 freq whizzled (2) - 3 freq heeled (2) - 1 freq wheeler (2) - 4 freq wheeple (2) - 2 freq wheeples (2) - 1 freq wheezeen (2) - 1 freq wheenged (2) - 1 freq wheedle (2) - 3 freq wheeshed (2) - 3 freq cheetled (2) - 2 freq wheezlin (2) - 1 freq heezed (2) - 40 freq wheeld (2) - 1 freq wheechled (2) - 1 freq wheeped (2) - 5 freq wheeked (2) - 8 freq |
wheezled (0) - 1 freq wheezles (2) - 1 freq wheezed (2) - 3 freq wheepled (2) - 3 freq wheedled (2) - 2 freq wheeled (2) - 14 freq wheeld (3) - 1 freq whizzled (3) - 3 freq wheezlin (3) - 1 freq wheelied (3) - 1 freq wheezes (4) - 1 freq wheeped (4) - 5 freq wheechled (4) - 1 freq wheeze (4) - 4 freq whaized (4) - 1 freq whizzed (4) - 4 freq whurled (4) - 1 freq wheeched (4) - 47 freq heezed (4) - 40 freq wheeked (4) - 8 freq wheeples (4) - 1 freq wheeler (4) - 4 freq heeled (4) - 1 freq wheezeen (4) - 1 freq wheeple (4) - 2 freq |
SoundEx code - W243 wauchelt - 2 freq wiggled - 3 freq wachlet - 1 freq waxcloth - 2 freq wheechled - 1 freq wiggilt - 4 freq wiggult - 2 freq waggilt - 1 freq wiggle't - 1 freq whisselt - 1 freq whizzled - 3 freq wheezled - 1 freq whussilt - 1 freq waggled - 2 freq waggelt - 1 freq weeglet - 1 freq whusslet - 1 freq wsgltwbao - 1 freq whusslit - 1 freq |
MetaPhone code - WSLT whisselt - 1 freq whizzled - 3 freq wheezled - 1 freq whussilt - 1 freq whusslet - 1 freq whusslit - 1 freq |
WHEEZLED |
Time to execute Levenshtein function - 0.225123 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.396490 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.027514 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.037440 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.000873 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. |