| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| qnv (0) - 1 freq qnd (1) - 1 freq qnq (1) - 1 freq qnu (1) - 1 freq nv (1) - 5 freq env (1) - 1 freq tnv (1) - 1 freq qlv (1) - 1 freq qhv (1) - 1 freq qv (1) - 3 freq qn (1) - 5 freq qzv (1) - 1 freq znv (1) - 1 freq tnt (2) - 1 freq pv (2) - 3 freq kv (2) - 10 freq rv (2) - 2 freq wqcv (2) - 1 freq qb (2) - 2 freq ong (2) - 2 freq qdf (2) - 1 freq snx (2) - 1 freq qd (2) - 1 freq knj (2) - 1 freq qzs (2) - 1 freq |
qnv (0) - 1 freq qhv (2) - 1 freq qn (2) - 5 freq znv (2) - 1 freq qlv (2) - 1 freq qzv (2) - 1 freq qv (2) - 3 freq tnv (2) - 1 freq qnd (2) - 1 freq qnu (2) - 1 freq qnq (2) - 1 freq nv (2) - 5 freq env (2) - 1 freq qin (3) - 1 freq quhv (3) - 1 freq niv (3) - 5 freq envy (3) - 25 freq gnev (3) - 1 freq qvi (3) - 1 freq inov (3) - 1 freq qon (3) - 1 freq qan (3) - 1 freq invy (3) - 2 freq nva (3) - 2 freq nav (3) - 3 freq |
SoundEx code - Q510 qnv - 1 freq |
MetaPhone code - KNF kinnefa - 1 freq convo - 2 freq convoy - 12 freq convey - 6 freq cnvey - 1 freq connive - 1 freq kinneff - 1 freq canfoo - 1 freq €˜k-nife - 1 freq kennef - 1 freq conf - 1 freq qnv - 1 freq |
QNV |
| Time to execute Levenshtein function - 0.187408 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.327498 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.028600 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.038109 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.001114 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. |