| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| quham (0) - 1 freq quhar (1) - 24 freq quhan (1) - 51 freq quhom (1) - 1 freq quhat (1) - 23 freq quha (1) - 17 freq quear (2) - 1 freq quay (2) - 19 freq quhy (2) - 2 freq fulham (2) - 1 freq queat (2) - 11 freq quiat (2) - 2 freq quhaar (2) - 8 freq qvha (2) - 1 freq quean (2) - 5 freq uha (2) - 2 freq quhase (2) - 1 freq ogham (2) - 2 freq quat (2) - 31 freq quhyt (2) - 5 freq 'ham (2) - 3 freq wham (2) - 21 freq quhen (2) - 4 freq qhpm (2) - 1 freq quaw (2) - 2 freq |
quham (0) - 1 freq quhom (1) - 1 freq quha (2) - 17 freq quhat (2) - 23 freq quhar (2) - 24 freq quhan (2) - 51 freq sham (3) - 8 freq quhair (3) - 1 freq quhv (3) - 1 freq quhen (3) - 4 freq qualm (3) - 2 freq quhaams (3) - 1 freq quhit (3) - 33 freq quhaur (3) - 1 freq ham (3) - 49 freq quhais (3) - 1 freq tham (3) - 43 freq wham (3) - 21 freq quho (3) - 2 freq uhm (3) - 1 freq qhpm (3) - 1 freq quhy (3) - 2 freq ogham (3) - 2 freq quhase (3) - 1 freq 'ham (3) - 3 freq |
SoundEx code - Q500 queen - 643 freq quine - 588 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 - KHM khayyam - 1 freq quhom - 1 freq quham - 1 freq |
QUHAM |
| Time to execute Levenshtein function - 0.359862 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.644719 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.034199 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.091803 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.000931 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. |