| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| qweer (0) - 11 freq qweed (1) - 1 freq queer (1) - 146 freq qweel (1) - 1 freq sweer (1) - 19 freq weer (1) - 68 freq qweek (1) - 1 freq theer (2) - 1 freq peer (2) - 199 freq meer (2) - 9 freq ewer (2) - 2 freq wee'r (2) - 4 freq sweep (2) - 31 freq veer (2) - 1 freq ow'er (2) - 1 freq wee (2) - 8357 freq sweert (2) - 2 freq iwer (2) - 5 freq wheer (2) - 20 freq zwesr (2) - 1 freq weeer (2) - 2 freq weed (2) - 21 freq we'r (2) - 42 freq wher (2) - 6 freq wear (2) - 162 freq |
qweer (0) - 11 freq qweek (2) - 1 freq qweed (2) - 1 freq sweer (2) - 19 freq weer (2) - 68 freq qweel (2) - 1 freq queer (2) - 146 freq qwaez (3) - 1 freq weir (3) - 139 freq aweir (3) - 1 freq queir (3) - 2 freq ower (3) - 6285 freq sweir (3) - 86 freq weeir (3) - 3 freq qweeat (3) - 2 freq nweir (3) - 6 freq wer (3) - 220 freq weyer (3) - 1 freq swear (3) - 63 freq sweery (3) - 3 freq quear (3) - 1 freq wier (3) - 2 freq qweat (3) - 6 freq weear (3) - 1 freq waer (3) - 2 freq |
SoundEx code - Q600 queer - 146 freq queerie - 8 freq quarry - 61 freq quair - 15 freq query - 2 freq quare - 245 freq qweer - 11 freq queir - 2 freq quhaur - 1 freq quhar - 24 freq quhair - 1 freq 'quarry - 1 freq quiri - 1 freq €œquhaar - 4 freq quhaar - 8 freq queereye - 1 freq qrw - 2 freq qsgr - 1 freq qyr - 1 freq quear - 1 freq |
MetaPhone code - KWR cower - 12 freq qweer - 11 freq g'ower - 1 freq kawar - 1 freq |
QWEER |
| Time to execute Levenshtein function - 0.766584 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 - 1.238035 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.074785 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.095082 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.001207 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. |