| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oorsels (0) - 140 freq morsels (1) - 4 freq oorsel (1) - 10 freq corsels (1) - 1 freq oorsel's (1) - 2 freq oorseels (1) - 2 freq oorsells (1) - 3 freq oursels (1) - 3 freq oorsels (2) - 1 freq coorses (2) - 16 freq yersels (2) - 97 freq corses (2) - 1 freq oursel (2) - 1 freq tossels (2) - 1 freq ootsets (2) - 6 freq coonsels (2) - 1 freq yoursels (2) - 14 freq ootrels (2) - 18 freq wersels (2) - 1 freq oorselves (2) - 5 freq coorsely (2) - 1 freq yursels (2) - 1 freq possels (2) - 8 freq fordels (2) - 1 freq horse's (2) - 7 freq |
oorsels (0) - 140 freq oorseels (1) - 2 freq oursels (1) - 3 freq yersels (2) - 97 freq irsels (2) - 1 freq eersels (2) - 1 freq yirsels (2) - 5 freq corsels (2) - 1 freq yursels (2) - 1 freq oorsel (2) - 10 freq oorsel's (2) - 2 freq morsels (2) - 4 freq oorsells (2) - 3 freq yoursels (2) - 14 freq wursels (3) - 7 freq birsels (3) - 1 freq yaersels (3) - 1 freq hirsels (3) - 3 freq wirsels (3) - 77 freq yeirsels (3) - 1 freq wersels (3) - 1 freq oorselves (3) - 5 freq oursel (3) - 1 freq arses (4) - 6 freq ourselves (4) - 10 freq |
SoundEx code - O624 oorsels - 140 freq ourselves - 10 freq oorseels - 2 freq oorsells - 3 freq oorselves - 5 freq oorsel - 10 freq oor-gless - 1 freq oorglaiss - 1 freq oracle - 5 freq ooerglass - 1 freq orgill - 1 freq orquil' - 1 freq owerslairkt - 1 freq oursels - 3 freq owerclose - 1 freq ooerglaiss - 1 freq oorsel's - 2 freq oorgless - 1 freq ooir-gless - 1 freq oursel - 1 freq oorsels - 1 freq |
MetaPhone code - ORSLS oorsels - 140 freq oorseels - 2 freq oorsells - 3 freq oursels - 3 freq oorsel's - 2 freq oorsels - 1 freq |
OORSELS |
| Time to execute Levenshtein function - 0.189341 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.339919 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.030034 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.036992 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.000828 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. |