Techniques for post-processing, e.g. correcting the recognition result

Full Title

Character recognition; Recognising digital ink; Document-oriented image-based pattern recognition > Character recognition > Techniques for post-processing, e.g. correcting the recognition result

Classification Context

Section:

PHYSICS

Class:

COMPUTING OR CALCULATING; COUNTING

Subclass:

IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING

Scope Notes

Glossary: n-gram a contiguous sequence of n items from a given sample of text. The items can be syllables, letters, words or base pairs according to the application. Typical examples are bi-grams and tri-grams. trie also called “digital tree” or “prefix tree”, is a type of tree data structure used for locating specific keys (items) from within a set of characters or words. In order to access a key (to recover its value, change it, or remove it), the trie is traversed (usually in a depth-first fashion), following the links between nodes.

Child Classifications

Navigate with arrow keys, Enter to open

• G06V 30/262 using context analysis, e.g. lexical, syntactic or semantic context