| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| qjm (0) - 1 freq jm (1) - 57 freq ljm (1) - 1 freq qjj (1) - 1 freq ajm (1) - 1 freq qm (1) - 1 freq kjm (1) - 1 freq qjg (1) - 1 freq qj (1) - 3 freq qjz (1) - 1 freq lnm (2) - 1 freq jl (2) - 4 freq jb (2) - 2 freq iim (2) - 2 freq jr (2) - 17 freq jim (2) - 235 freq qby (2) - 1 freq gum (2) - 19 freq eum (2) - 1 freq 'ja (2) - 1 freq ljt (2) - 1 freq ihm (2) - 5 freq nsm (2) - 1 freq lj (2) - 2 freq rm (2) - 11 freq |
qjm (0) - 1 freq kjm (2) - 1 freq qjg (2) - 1 freq qj (2) - 3 freq qm (2) - 1 freq qjz (2) - 1 freq jm (2) - 57 freq ajm (2) - 1 freq ljm (2) - 1 freq qjj (2) - 1 freq qmy (3) - 1 freq jam (3) - 84 freq qejg (3) - 1 freq qwmi (3) - 1 freq oqm (3) - 1 freq 'jam (3) - 1 freq vijm (3) - 1 freq jom (3) - 1 freq qrme (3) - 1 freq qtme (3) - 1 freq iqwm (3) - 1 freq cjem (3) - 1 freq qjte (3) - 1 freq uqj (3) - 2 freq jim (3) - 235 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 - KJM cjem - 1 freq kjm - 1 freq qjm - 1 freq |
QJM |
| Time to execute Levenshtein function - 0.337897 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.686485 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.077957 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.050518 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.000907 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. |