| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| quhan (0) - 51 freq quhat (1) - 23 freq wuhan (1) - 2 freq quean (1) - 5 freq quhar (1) - 24 freq quhen (1) - 4 freq quha (1) - 17 freq quran (1) - 2 freq quham (1) - 1 freq chan (2) - 1 freq queen (2) - 641 freq uha (2) - 2 freq vhan (2) - 1 freq quat (2) - 31 freq quorn (2) - 1 freq queans (2) - 5 freq quhy (2) - 2 freq sukan (2) - 1 freq quay (2) - 19 freq wuman (2) - 40 freq shan (2) - 10 freq nuhin (2) - 48 freq 'than (2) - 1 freq ulan (2) - 1 freq quhaur (2) - 1 freq |
quhan (0) - 51 freq quhen (1) - 4 freq quran (2) - 2 freq quhat (2) - 23 freq quham (2) - 1 freq quha (2) - 17 freq wuhan (2) - 2 freq quean (2) - 5 freq quhar (2) - 24 freq quhit (3) - 33 freq quhaar (3) - 8 freq quhais (3) - 1 freq achan (3) - 2 freq qu'on (3) - 1 freq quho (3) - 2 freq lhan (3) - 1 freq ythan (3) - 6 freq quhom (3) - 1 freq dhan (3) - 1 freq khan (3) - 3 freq than (3) - 2715 freq ethan (3) - 1 freq whan (3) - 2751 freq qan (3) - 1 freq quhv (3) - 1 freq |
SoundEx code - Q500 queen - 641 freq quine - 587 freq queyn - 3 freq queynie - 1 freq quinie - 82 freq qu'on - 1 freq qwine - 2 freq 'queen - 1 freq queenie - 3 freq quean - 5 freq quhan - 51 freq quine' - 2 freq queuein - 3 freq quyne - 4 freq quene - 12 freq queuin - 3 freq quinnie - 7 freq quhen - 4 freq quhom - 1 freq queen- - 1 freq qin - 1 freq quiney - 5 freq €˜queen - 1 freq qan - 1 freq €œquhan - 5 freq quham - 1 freq quinne - 2 freq qon - 1 freq qmh - 1 freq qmy - 1 freq qwmi - 1 freq quineÂ’ - 1 freq queen' - 1 freq qnu - 1 freq quÂ’un - 2 freq qn - 5 freq qm - 1 freq qjm - 1 freq qqmw - 1 freq ‘queen - 1 freq qine - 1 freq |
MetaPhone code - KHN quhan - 51 freq cohen - 1 freq quhen - 4 freq khan - 3 freq €œquhan - 5 freq kahoona - 1 freq |
QUHAN |
| Time to execute Levenshtein function - 0.172179 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.315218 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.026763 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.036853 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.000793 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. |