Online hand-sketched figure recognition
Pattern Recognition
Proceedings of the third international conference on human-computer interaction on Designing and using human-computer interfaces and knowledge based systems (2nd ed.)
An efficient context-free parsing algorithm
Communications of the ACM
Graph-Grammars and Their Application to Computer Science
Graph-Grammars and Their Application to Computer Science
The theory of parsing, translation, and compiling
The theory of parsing, translation, and compiling
Proceedings of the Third International Conference on Logic Programming
The design of a computer language for linguistic information
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
Using restriction to extend parsing algorithms for complex-feature-based formalisms
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
A method for the structural analysis of two-dimensional mathematical expressions
Information Sciences: an International Journal
The specification of visual language syntax
Journal of Visual Languages and Computing
Syntax-directed recognition of hand-printed two-dimensional mathematics
Symposium on Interactive Systems for Experimental Applied Mathematics: Proceedings of the Association for Computing Machinery Inc. Symposium
Generating multimodal grammars for multimodal dialogue processing
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
| Hi-index | 0.00 |
In this paper we present a unification-based grammar formalism and parsing algorithm for the purposes of defining and processing generalizations of concatenative languages such as those found in two-dimensional graphical domains. In order to encompass languages whose elements are combined by operations other than simple string concatenation, we extend the PATR unification-based grammar formalism with functionally specified constraints. In order to parse with these grammars, we extend tabular parsing methods and discuss a bottom-up algorithm that can process input incrementally in a maximally flexible order. This work is currently being applied in the interpretation of handsketched mathematical expressions and structured flowcharts on notebook computers and interactive worksurfaces.