| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oracle (0) - 5 freq coracle (1) - 1 freq horace (2) - 23 freq crackle (2) - 9 freq oral (2) - 22 freq cracke (2) - 1 freq orange (2) - 136 freq trace (2) - 35 freq 'race (2) - 1 freq orare (2) - 2 freq morale (2) - 4 freq cradle (2) - 23 freq treacle (2) - 24 freq arable (2) - 8 freq trachle (2) - 22 freq miracle (2) - 43 freq brace (2) - 30 freq traicle (2) - 11 freq race (2) - 139 freq gracie (2) - 21 freq raucle (2) - 5 freq rale (2) - 78 freq orally (2) - 2 freq grace (2) - 153 freq bryce (3) - 5 freq |
oracle (0) - 5 freq raucle (2) - 5 freq coracle (2) - 1 freq miracle (3) - 43 freq arable (3) - 8 freq treacle (3) - 24 freq traicle (3) - 11 freq reclee (3) - 1 freq rale (3) - 78 freq recile (3) - 1 freq orally (3) - 2 freq race (3) - 139 freq oral (3) - 22 freq recl (3) - 1 freq cycle (4) - 22 freq azacly (4) - 11 freq rile (4) - 3 freq rachel (4) - 17 freq racin (4) - 43 freq rack (4) - 19 freq racine (4) - 3 freq rawly (4) - 1 freq raceen (4) - 1 freq icicle (4) - 3 freq rawl (4) - 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 - ORKL oracle - 5 freq orquil' - 1 freq |
ORACLE |
| Time to execute Levenshtein function - 0.299861 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.556066 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.027249 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.070320 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.000806 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. |