| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jury (0) - 109 freq jura (1) - 3 freq jure (1) - 1 freq fury (1) - 32 freq ury (1) - 2 freq jury- (1) - 2 freq july (1) - 73 freq dury (1) - 1 freq judy (1) - 19 freq bury (1) - 24 freq fur' (2) - 1 freq cura (2) - 1 freq ture (2) - 2 freq wurr (2) - 27 freq murr (2) - 1 freq burp (2) - 9 freq jarl (2) - 36 freq vary (2) - 3 freq curly (2) - 53 freq wary (2) - 11 freq lory (2) - 42 freq jul (2) - 1 freq evry (2) - 12 freq jour (2) - 2 freq lure (2) - 6 freq |
jury (0) - 109 freq jure (1) - 1 freq jura (1) - 3 freq jer (2) - 1 freq jour (2) - 2 freq jar (2) - 41 freq jaur (2) - 23 freq bury (2) - 24 freq jr (2) - 17 freq jru (2) - 1 freq fury (2) - 32 freq ury (2) - 2 freq jury- (2) - 2 freq july (2) - 73 freq judy (2) - 19 freq dury (2) - 1 freq very (3) - 698 freq wiry (3) - 11 freq jus (3) - 39 freq tery (3) - 1 freq fure (3) - 1 freq jey (3) - 6 freq jars (3) - 21 freq dry (3) - 472 freq juk (3) - 2 freq |
SoundEx code - J600 jar - 41 freq jaur - 23 freq jury - 109 freq jerry - 15 freq jr - 17 freq jckrrh - 1 freq jure - 1 freq jour - 2 freq jeer - 7 freq jury- - 2 freq jer - 1 freq jaurie - 1 freq jiyro - 1 freq jura - 3 freq jerrie - 5 freq jieir - 1 freq jirr - 1 freq jrr - 1 freq jerah - 3 freq jru - 1 freq jjrea - 1 freq jxryi - 1 freq jsr - 1 freq |
MetaPhone code - JR gear - 237 freq jar - 41 freq jaur - 23 freq jury - 109 freq gyre - 13 freq jerry - 15 freq jr - 17 freq giro - 12 freq jure - 1 freq geari - 1 freq geer - 16 freq jour - 2 freq jeer - 7 freq gerry - 13 freq jury- - 2 freq giaur - 1 freq gear' - 1 freq jer - 1 freq jaurie - 1 freq geir - 14 freq gier - 2 freq jiyro - 1 freq jura - 3 freq jerrie - 5 freq gearie - 4 freq jieir - 1 freq geerie - 1 freq ger - 2 freq jirr - 1 freq ger- - 1 freq jrr - 1 freq gie-owre - 1 freq jerah - 3 freq jru - 1 freq jjrea - 1 freq wwjr - 1 freq |
JURY |
| Time to execute Levenshtein function - 0.248657 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.504207 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.061006 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.038124 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.035024 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. |