| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| qweel (0) - 1 freq qweer (1) - 11 freq sweel (1) - 20 freq qweek (1) - 1 freq -weel (1) - 1 freq 'weel (1) - 225 freq cweel (1) - 3 freq aweel (1) - 4 freq kweel (1) - 1 freq qweed (1) - 1 freq sqweel (1) - 2 freq weel (1) - 3975 freq queek (2) - 22 freq ‘weel (2) - 1 freq twel (2) - 1 freq qwyml (2) - 1 freq creel (2) - 37 freq queet (2) - 2 freq 'weel' (2) - 3 freq wenl (2) - 1 freq sheel (2) - 3 freq tweed (2) - 26 freq €˜weel (2) - 29 freq asweel (2) - 18 freq qweeat (2) - 2 freq |
qweel (0) - 1 freq aweel (2) - 4 freq kweel (2) - 1 freq sqweel (2) - 2 freq cweel (2) - 3 freq qweed (2) - 1 freq weel (2) - 3975 freq 'weel (2) - 225 freq sweel (2) - 20 freq qweer (2) - 11 freq qweek (2) - 1 freq -weel (2) - 1 freq weil (3) - 141 freq swael (3) - 2 freq sweil (3) - 1 freq weal (3) - 8 freq weyl (3) - 1 freq qwaez (3) - 1 freq wiel (3) - 1 freq wael (3) - 9 freq quell (3) - 5 freq weeel (3) - 3 freq unweel (3) - 2 freq atweel (3) - 26 freq qweat (3) - 6 freq |
SoundEx code - Q400 quelle - 1 freq quile - 1 freq quill - 15 freq quell - 5 freq qual - 3 freq quail - 5 freq qweel - 1 freq quhile - 5 freq quyhle - 1 freq quheill - 1 freq €œqually - 1 freq qkxggjlo - 1 freq qlw - 1 freq qually - 1 freq qalye - 1 freq qgl - 1 freq quhill - 1 freq |
MetaPhone code - KWL kweel - 1 freq qweel - 1 freq cweel - 3 freq |
QWEEL |
| Time to execute Levenshtein function - 0.209691 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.396994 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.032522 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.047825 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.001288 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. |