| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oorvyce (0) - 119 freq oorbye (2) - 1 freq force (3) - 126 freq joyce (3) - 138 freq sarvice (3) - 5 freq oove (3) - 1 freq vyce (3) - 334 freq oonce (3) - 2 freq horace (3) - 23 freq mornice (3) - 2 freq oorie (3) - 42 freq morrice (3) - 150 freq mortice (3) - 4 freq morice (3) - 1 freq gryce (3) - 1 freq novice (3) - 5 freq oo've (3) - 3 freq no-wyce (3) - 2 freq pryce (3) - 1 freq ootbye (3) - 98 freq ootsyde (3) - 4 freq forbye (3) - 427 freq oorlich (3) - 2 freq foraye (3) - 13 freq royce (3) - 5 freq |
oorvyce (0) - 119 freq royce (4) - 5 freq service (4) - 196 freq voyce (4) - 4 freq vyce (4) - 334 freq novice (4) - 5 freq oorbye (4) - 1 freq sarvice (4) - 5 freq recce (5) - 1 freq reece (5) - 1 freq rove (5) - 2 freq crevice (5) - 2 freq yvyc (5) - 1 freq orca (5) - 7 freq oevci (5) - 2 freq reyyce (5) - 1 freq rejyce (5) - 1 freq orifice (5) - 15 freq ryve (5) - 2 freq sairvice (5) - 7 freq vice (5) - 66 freq race (5) - 139 freq vvce (5) - 1 freq arvie (5) - 1 freq rice (5) - 106 freq |
SoundEx code - O612 orifice - 15 freq orpheus - 4 freq owerfest - 1 freq owrebauchled - 1 freq ower-vizzie - 2 freq orifices - 1 freq owerfaced - 1 freq oorvyce - 119 freq orubbish - 1 freq orbsscfc - 5 freq |
MetaPhone code - ORFS orifice - 15 freq orpheus - 4 freq oorvyce - 119 freq |
OORVYCE |
| Time to execute Levenshtein function - 0.177670 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.331825 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.027277 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.037206 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.000805 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. |