| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| qkjeo (0) - 1 freq skeo (2) - 1 freq qkjph (2) - 1 freq qket (2) - 1 freq kleo (2) - 1 freq qto (3) - 1 freq qe (3) - 5 freq qkf (3) - 1 freq queet (3) - 2 freq seo (3) - 1 freq skjin (3) - 1 freq enjey (3) - 11 freq egjeu (3) - 1 freq que (3) - 6 freq teo (3) - 1 freq je (3) - 10 freq rodeo (3) - 2 freq ko (3) - 7 freq quaet (3) - 26 freq objek (3) - 5 freq knee (3) - 126 freq kilo (3) - 1 freq quey (3) - 3 freq jeh (3) - 1 freq meo (3) - 1 freq |
qkjeo (0) - 1 freq qket (3) - 1 freq qk (4) - 1 freq qku (4) - 1 freq queek (4) - 22 freq okj (4) - 1 freq qj (4) - 3 freq qzj (4) - 1 freq bkj (4) - 1 freq qmj (4) - 1 freq mkj (4) - 1 freq iqkjb (4) - 1 freq qjj (4) - 1 freq qkdi (4) - 1 freq kj (4) - 4 freq skjooa (4) - 1 freq kleo (4) - 1 freq qkf (4) - 1 freq skeo (4) - 1 freq qkjph (4) - 1 freq wkj (4) - 1 freq mojo (5) - 4 freq jey (5) - 6 freq qweed (5) - 1 freq kloo (5) - 1 freq |
SoundEx code - Q000 quay - 19 freq queue - 82 freq quo - 181 freq qo - 28 freq que - 6 freq quaw - 2 freq quey - 3 freq quha - 17 freq q - 96 freq qu' - 10 freq qua - 2 freq qo' - 2 freq q'yi - 1 freq qa - 2 freq qoooo - 2 freq qooo - 1 freq quoy - 1 freq quoi - 1 freq qey - 1 freq quho - 2 freq quo' - 1 freq qho - 1 freq €˜quh - 1 freq quhy - 2 freq €œquha - 2 freq qq - 4 freq €˜quha - 1 freq €˜quh- - 1 freq qh - 4 freq qawa - 1 freq qjz - 1 freq qku - 1 freq qw - 4 freq qkjeo - 1 freq qg - 1 freq qcy - 1 freq qcu - 1 freq qj - 3 freq qi - 1 freq qe - 5 freq qy - 1 freq qc - 2 freq qscwy - 1 freq qu - 2 freq qgcca - 1 freq qjj - 1 freq qgu - 1 freq qhi - 1 freq qué - 2 freq qwa - 1 freq qzw - 1 freq qs - 2 freq qzj - 1 freq qzs - 1 freq qk - 1 freq qjg - 1 freq qui - 1 freq qcck - 1 freq qx - 1 freq qeu - 1 freq qz - 1 freq |
MetaPhone code - KKJ qkjeo - 1 freq |
QKJEO |
| Time to execute Levenshtein function - 0.470346 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.615654 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.031200 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.094371 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.000860 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. |