| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| qvzca (0) - 1 freq qgcca (2) - 1 freq qvha (2) - 1 freq vici (3) - 1 freq becca (3) - 2 freq barca (3) - 1 freq qua (3) - 2 freq viva (3) - 6 freq pvc (3) - 5 freq quack (3) - 7 freq qzd (3) - 1 freq occa (3) - 1 freq qz (3) - 1 freq orca (3) - 7 freq coca (3) - 1 freq qa (3) - 2 freq ijzcb (3) - 1 freq kca (3) - 1 freq vita (3) - 1 freq ava (3) - 490 freq qlzx (3) - 1 freq vega (3) - 1 freq zct (3) - 1 freq gva (3) - 1 freq 'ca (3) - 2 freq |
qvzca (0) - 1 freq iqczc (4) - 1 freq qvha (4) - 1 freq qgcca (4) - 1 freq avec (5) - 1 freq qvi (5) - 1 freq qwz (5) - 1 freq cvc (5) - 2 freq vz (5) - 4 freq qv (5) - 3 freq vzlu (5) - 1 freq qzaf (5) - 1 freq qvxn (5) - 1 freq vic (5) - 5 freq qzs (5) - 1 freq qvt (5) - 1 freq vc (5) - 8 freq qzp (5) - 1 freq qvkyn (5) - 1 freq qzv (5) - 1 freq vdcy (5) - 1 freq vice (5) - 66 freq qjz (5) - 1 freq qfc (5) - 1 freq qyac (5) - 1 freq |
SoundEx code - Q120 quebec - 3 freq quips - 2 freq quoybeezie - 1 freq qubsu - 1 freq qkqjcfg - 1 freq qbjqscew - 1 freq qpic - 1 freq qpx - 1 freq qjwfk - 1 freq qpvuq - 1 freq qjbfj - 4 freq qyfws - 1 freq qvzca - 1 freq qopwyuj - 1 freq qxpg - 1 freq qcuvvagqxq - 1 freq qiefwkkz - 1 freq qfc - 1 freq |
MetaPhone code - KFSK kfciqa - 1 freq qvzca - 1 freq |
QVZCA |
| Time to execute Levenshtein function - 0.200518 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.336318 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.027716 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.038269 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.001006 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. |