| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jdqo (0) - 1 freq jfqo (1) - 1 freq dqb (2) - 1 freq jzq (2) - 1 freq pqo (2) - 1 freq jvqj (2) - 1 freq ydo (2) - 1 freq do (2) - 861 freq bdqx (2) - 1 freq dno (2) - 1 freq juno (2) - 2 freq ado (2) - 4 freq bnqo (2) - 1 freq adio (2) - 1 freq duo (2) - 3 freq jvo (2) - 1 freq ldgqo (2) - 1 freq joco (2) - 37 freq wdho (2) - 1 freq jd (2) - 6 freq jdea (2) - 1 freq dao (2) - 1 freq jql (2) - 1 freq jqn (2) - 1 freq bvqo (2) - 1 freq |
jdqo (0) - 1 freq jfqo (2) - 1 freq hdq (3) - 1 freq ldq (3) - 1 freq dq (3) - 7 freq gdq (3) - 1 freq jdh (3) - 1 freq dqi (3) - 1 freq udqa (3) - 1 freq judo (3) - 2 freq jd (3) - 6 freq jdea (3) - 1 freq jzq (3) - 1 freq yjd (4) - 1 freq 'do (4) - 14 freq jcqn (4) - 1 freq judoon (4) - 1 freq juden (4) - 1 freq joao (4) - 38 freq judy (4) - 19 freq joda (4) - 3 freq jadie (4) - 4 freq judmoo (4) - 4 freq jodie (4) - 1 freq jhdqd (4) - 2 freq |
SoundEx code - J320 judge - 222 freq juidge - 17 freq jots - 5 freq judas - 24 freq jeidge - 5 freq jaddies - 1 freq jt's - 2 freq jets - 5 freq jed's - 4 freq jeedge - 8 freq jutes - 9 freq juts - 1 freq joodge - 1 freq jutish - 1 freq jude's - 1 freq jtxxyow - 1 freq jdqo - 1 freq jzdg - 1 freq jtjh - 1 freq jtc - 1 freq jtk - 4 freq |
MetaPhone code - JTK get-go - 1 freq jdqo - 1 freq jtc - 1 freq jtk - 4 freq |
JDQO |
| Time to execute Levenshtein function - 0.189244 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.358424 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.028505 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.038670 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.000906 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. |