About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Abstract
Notepad computers promise a new input paradigm where users communicate with computers in visual languages composed of handwritten text and diagrams. A key problem to be solved before such an interface can be realized is the efficient and accurate recognition (or parsing) of handwritten input. We present techniques for building visual language parsers based on a new formalism, constrained set grammars. Constrained set grammars provide a high-level and declarative specification of visual languages and support the automatic generation of efficient parsers. These techniques have been used to build parsers for several representative visual languages. ©1991 ACM.