Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
oral (0) - 22 freq oval (1) - 7 freq ora (1) - 1 freq otral (1) - 1 freq ormal (1) - 1 freq cral (1) - 1 freq moral (1) - 88 freq coral (1) - 5 freq orral (1) - 6 freq baal (2) - 13 freq waal (2) - 45 freq feal (2) - 1 freq iraq (2) - 8 freq rel (2) - 1 freq oracle (2) - 5 freq rora (2) - 2 freq weal (2) - 8 freq orca (2) - 7 freq oru (2) - 1 freq koran (2) - 1 freq oba (2) - 2 freq viral (2) - 3 freq sal (2) - 55 freq orams (2) - 1 freq atal (2) - 2 freq |
oral (0) - 22 freq rael (2) - 109 freq real (2) - 565 freq rel (2) - 1 freq ryal (2) - 3 freq rl (2) - 2 freq rail (2) - 29 freq url (2) - 1 freq rale (2) - 78 freq aural (2) - 1 freq eraly (2) - 1 freq royal (2) - 172 freq ormal (2) - 1 freq cral (2) - 1 freq otral (2) - 1 freq ora (2) - 1 freq oval (2) - 7 freq coral (2) - 5 freq moral (2) - 88 freq ril (2) - 1 freq orral (2) - 6 freq foal (3) - 2 freq hoal (3) - 4 freq ran (3) - 448 freq rab (3) - 169 freq |
SoundEx code - O640 orral - 6 freq orwell - 4 freq oral - 22 freq orally - 2 freq owerly - 1 freq owerlay - 1 freq oorwullie - 2 freq oreilly - 1 freq |
MetaPhone code - ORL orral - 6 freq oral - 22 freq orally - 2 freq oreilly - 1 freq |
ORAL |
Time to execute Levenshtein function - 0.183871 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.469044 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.029510 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.076668 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.000825 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. |