| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| errors (0) - 7 freq terrors (1) - 3 freq errows (1) - 1 freq error (1) - 16 freq mirrors (2) - 24 freq terror (2) - 39 freq euros (2) - 7 freq jurors (2) - 24 freq err's (2) - 1 freq errins (2) - 1 freq errour (2) - 1 freq werrers (2) - 1 freq erroll (2) - 1 freq ejurors (2) - 1 freq eros (2) - 16 freq horrors (2) - 18 freq errs (2) - 1 freq errol (2) - 2 freq kerrots (2) - 1 freq arrows (2) - 4 freq eross (2) - 1 freq merro's (2) - 1 freq nervous (3) - 73 freq terrorism (3) - 3 freq export (3) - 10 freq |
errors (0) - 7 freq error (2) - 16 freq errows (2) - 1 freq terrors (2) - 3 freq werrers (3) - 1 freq ejurors (3) - 1 freq errs (3) - 1 freq errour (3) - 1 freq horrors (3) - 18 freq errins (3) - 1 freq arrows (3) - 4 freq mirrors (3) - 24 freq jurors (3) - 24 freq err's (3) - 1 freq torrs (4) - 2 freq purrs (4) - 3 freq terrs (4) - 1 freq warriors (4) - 20 freq rorys (4) - 1 freq triers (4) - 2 freq pryers (4) - 1 freq serrs (4) - 5 freq rrus (4) - 1 freq kerries (4) - 8 freq earrins (4) - 2 freq |
SoundEx code - E662 errors - 7 freq eurerjq - 1 freq eiirhrcvw - 1 freq |
MetaPhone code - ERRS errors - 7 freq |
ERRORS |
| Time to execute Levenshtein function - 0.321002 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.693814 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.062267 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.045228 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.000941 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. |