| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| qmj (0) - 1 freq qzj (1) - 1 freq qmy (1) - 1 freq mj (1) - 6 freq qj (1) - 3 freq tmj (1) - 1 freq qm (1) - 1 freq qjj (1) - 1 freq qmg (1) - 1 freq qmh (1) - 1 freq ym (2) - 2 freq fm (2) - 90 freq vvmj (2) - 1 freq bqmzj (2) - 1 freq cj (2) - 8 freq qzv (2) - 1 freq mw (2) - 2 freq qvt (2) - 1 freq mo (2) - 32 freq am- (2) - 2 freq qo' (2) - 2 freq qkf (2) - 1 freq wmt (2) - 1 freq ej (2) - 1 freq qvi (2) - 1 freq |
qmj (0) - 1 freq qm (2) - 1 freq qjj (2) - 1 freq qmh (2) - 1 freq tmj (2) - 1 freq qmg (2) - 1 freq qj (2) - 3 freq qzj (2) - 1 freq qmy (2) - 1 freq mj (2) - 6 freq quaj (3) - 1 freq oqm (3) - 1 freq qamjs (3) - 2 freq qmqe (3) - 1 freq qmul (3) - 2 freq jmaj (3) - 1 freq uqj (3) - 2 freq qyms (3) - 1 freq moj (3) - 2 freq mjr (4) - 23 freq mhj (4) - 1 freq omm (4) - 1 freq xgj (4) - 1 freq bmg (4) - 1 freq qui (4) - 1 freq |
SoundEx code - Q520 queen's - 55 freq queens - 40 freq quine's - 18 freq quines - 156 freq quines' - 2 freq queyn's - 2 freq quinie's - 12 freq queans - 5 freq queanie's - 1 freq quinies - 7 freq quhaams - 1 freq quango - 1 freq quince - 2 freq quench - 1 freq queenis - 1 freq quynes - 1 freq quines - 1 freq qnksa - 1 freq quins - 1 freq qyms - 1 freq qnq - 1 freq qamjs - 2 freq qmg - 1 freq quinikie - 1 freq queenies - 1 freq qmqe - 1 freq qmj - 1 freq |
MetaPhone code - KMJ gummidge - 2 freq qmj - 1 freq |
QMJ |
| Time to execute Levenshtein function - 0.321082 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.580884 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.031090 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.071023 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.004117 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. |