| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jurors (0) - 24 freq ejurors (1) - 1 freq juror (1) - 6 freq curers (2) - 1 freq gurrs (2) - 1 freq jury's (2) - 1 freq jubous (2) - 1 freq aurora (2) - 10 freq juries (2) - 1 freq burrs (2) - 2 freq juniors (2) - 16 freq duror (2) - 1 freq furrs (2) - 1 freq tudors (2) - 2 freq euros (2) - 7 freq errors (2) - 7 freq purrs (2) - 3 freq luxors (2) - 1 freq tutors (2) - 6 freq urrs (2) - 1 freq burry (3) - 1 freq a-ors (3) - 1 freq buroo (3) - 10 freq tutor (3) - 8 freq minors (3) - 1 freq |
jurors (0) - 24 freq ejurors (1) - 1 freq juror (2) - 6 freq errors (3) - 7 freq furrs (3) - 1 freq urrs (3) - 1 freq juniors (3) - 16 freq purrs (3) - 3 freq burrs (3) - 2 freq jury's (3) - 1 freq gurrs (3) - 1 freq curers (3) - 1 freq juries (3) - 1 freq roars (4) - 23 freq kerrs (4) - 9 freq jerries (4) - 11 freq perrs (4) - 1 freq joris (4) - 1 freq rorys (4) - 1 freq jirr (4) - 1 freq jours (4) - 1 freq brurs (4) - 1 freq jornos (4) - 2 freq jerry (4) - 15 freq serrs (4) - 5 freq |
SoundEx code - J662 jurors - 24 freq |
MetaPhone code - JRRS jurors - 24 freq |
JURORS |
| Time to execute Levenshtein function - 0.198602 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.325796 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.028994 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.038279 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.000940 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. |