| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wheeker (0) - 25 freq wheekers (1) - 1 freq theeker (1) - 1 freq wheeter (1) - 1 freq wheeked (1) - 8 freq wheeler (1) - 4 freq when'er (2) - 1 freq whaeever (2) - 1 freq whe'er (2) - 1 freq wherever (2) - 10 freq keeker (2) - 3 freq heeder (2) - 1 freq wheezes (2) - 1 freq wee'er (2) - 8 freq wheekin (2) - 3 freq whenever (2) - 77 freq weeked (2) - 2 freq theeter (2) - 1 freq whaever (2) - 12 freq checker (2) - 5 freq steeker (2) - 1 freq chekker (2) - 1 freq seeker (2) - 2 freq whether (2) - 182 freq queeker (2) - 4 freq |
wheeker (0) - 25 freq wheeler (2) - 4 freq wheeter (2) - 1 freq wheeked (2) - 8 freq theeker (2) - 1 freq wheekers (2) - 1 freq werker (3) - 2 freq whaever (3) - 12 freq whoever (3) - 15 freq whisker (3) - 1 freq waeker (3) - 1 freq wheek (3) - 8 freq whacker (3) - 1 freq wheekin (3) - 3 freq whe'er (3) - 1 freq whaeever (3) - 1 freq wheer (3) - 20 freq weaker (3) - 4 freq wheneer (3) - 1 freq where (4) - 706 freq wisker (4) - 1 freq whaiver (4) - 30 freq whaler (4) - 1 freq waiker (4) - 5 freq hooker (4) - 4 freq |
SoundEx code - W260 wycer - 6 freq wiser - 26 freq waiker - 5 freq wisker - 1 freq washer - 5 freq washer' - 1 freq wheecher - 2 freq wager - 9 freq weaker - 4 freq wicker - 2 freq whacker - 1 freq waaker - 1 freq whiskery - 1 freq wajer - 1 freq wokir - 1 freq wiker - 1 freq wauger - 3 freq wikker - 1 freq waeker - 1 freq whisker - 1 freq wheeker - 25 freq wasser - 1 freq wyacry - 1 freq wkr - 1 freq wwjr - 1 freq |
MetaPhone code - WKR waiker - 5 freq weaker - 4 freq wicker - 2 freq whacker - 1 freq waaker - 1 freq wokir - 1 freq wiker - 1 freq wikker - 1 freq waeker - 1 freq wheeker - 25 freq |
WHEEKER |
| Time to execute Levenshtein function - 0.230084 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.346500 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.028280 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.036642 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.000877 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. |