| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| waaker (0) - 1 freq waaket (1) - 1 freq warker (1) - 7 freq walker (1) - 25 freq weaker (1) - 4 freq waiker (1) - 5 freq taaker (1) - 1 freq waaken (1) - 16 freq waaked (1) - 3 freq maaker (1) - 1 freq waater (1) - 34 freq waeker (1) - 1 freq wanker (1) - 14 freq whaler (2) - 1 freq waukers (2) - 1 freq waatur (2) - 1 freq warked (2) - 23 freq wafer (2) - 2 freq aaner (2) - 1 freq wauken (2) - 25 freq canker (2) - 4 freq waiter (2) - 34 freq wager (2) - 9 freq waarkers (2) - 4 freq waket (2) - 1 freq |
waaker (0) - 1 freq waiker (1) - 5 freq weaker (1) - 4 freq waeker (1) - 1 freq waater (2) - 34 freq wanker (2) - 14 freq walker (2) - 25 freq wiker (2) - 1 freq maaker (2) - 1 freq waaket (2) - 1 freq warker (2) - 7 freq waaked (2) - 3 freq taaker (2) - 1 freq waaken (2) - 16 freq joaker (3) - 1 freq wauger (3) - 3 freq water (3) - 252 freq waatir (3) - 11 freq waar (3) - 70 freq wauner (3) - 2 freq watier (3) - 1 freq hawker (3) - 1 freq worker (3) - 23 freq raker (3) - 2 freq waakie (3) - 1 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 |
WAAKER |
| Time to execute Levenshtein function - 0.257922 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.409147 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.031139 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.037621 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.000867 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. |