Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
oorselves (0) - 5 freq ourselves (1) - 10 freq wurselves (2) - 1 freq oorsel's (2) - 2 freq oorsells (2) - 3 freq oorsels (2) - 140 freq yourselves (2) - 7 freq oorsels (3) - 1 freq morsels (3) - 4 freq oorseels (3) - 2 freq oorsel (3) - 10 freq bookshelves (3) - 1 freq thirselves (3) - 1 freq oursels (3) - 3 freq selves (3) - 4 freq observes (3) - 3 freq corsels (3) - 1 freq elves (4) - 10 freq hersel-as (4) - 1 freq grieves (4) - 2 freq gorbel's (4) - 1 freq corsets (4) - 1 freq nurseries (4) - 1 freq horses (4) - 113 freq greves (4) - 1 freq |
oorselves (0) - 5 freq ourselves (1) - 10 freq yourselves (2) - 7 freq oorsells (3) - 3 freq oorsels (3) - 140 freq oorsel's (3) - 2 freq wurselves (3) - 1 freq selves (4) - 4 freq oorseels (4) - 2 freq oursels (4) - 3 freq reserves (5) - 4 freq yoursels (5) - 14 freq salves (5) - 2 freq eersels (5) - 1 freq irsels (5) - 1 freq yirsels (5) - 5 freq yersels (5) - 97 freq yursels (5) - 1 freq observes (5) - 3 freq oorsel (5) - 10 freq morsels (5) - 4 freq yersel's (5) - 10 freq solves (5) - 3 freq thirselves (5) - 1 freq corsels (5) - 1 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 - ORSLFS ourselves - 10 freq oorselves - 5 freq |
OORSELVES |
Time to execute Levenshtein function - 0.209580 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.398948 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.027534 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.038763 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.001058 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. |