Online parsing of visual languages using adjacency grammars

Authors:
J. A. P. Jorge;E. P. Glinert
Affiliations:
-;-
Venue:
VL '95 Proceedings of the 11th International IEEE Symposium on Visual Languages
Year:
1995

Citing 0
Cited 9

Understanding Web query interfaces: best-effort parsing with hidden syntax

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Representing and Parsing Sketched Symbols Using Adjacency Grammars and a Grid-Directed Parser

Graphics Recognition. Recent Advances and New Opportunities
Eager interpretation of on-line hand-drawn structured documents: The DALI methodology

Pattern Recognition
A syntactic approach based on distortion-tolerant Adjacency Grammars and a spatial-directed parser to interpret sketched diagrams

Pattern Recognition
Creating the perception-based LADDER sketch recognition language

Proceedings of the 8th ACM Conference on Designing Interactive Systems
SSP: sketching slide presentations, a syntactic approach

GREC'09 Proceedings of the 8th international conference on Graphics recognition: achievements, challenges, and evolution
An incremental parser to recognize diagram symbols and gestures represented by adjacency grammars

GREC'05 Proceedings of the 6th international conference on Graphics Recognition: ten Years Review and Future Perspectives
An adjacency grammar to recognize symbols and gestures in a digital pen framework

IbPRIA'05 Proceedings of the Second Iberian conference on Pattern Recognition and Image Analysis - Volume Part II
Automatic learning of symbol descriptions avoiding topological ambiguities

SBM'06 Proceedings of the Third Eurographics conference on Sketch-Based Interfaces and Modeling

Quantified Score

Hi-index	0.00

Visualization

Abstract

Visual computing environments continue to grow in importance, yet fast, general parsing algorithms for visual languages remain elusive. In this paper, we present an incremental parsing algorithm for a broad class of visual languages which do not contain overlapping elements. Our algorithm is based on the concept of adjacency grammars, where adjacencies are defined so as to encompass both spatial and logical constraints. Our approach combines bottom-up and top-down methods to support incremental parsing of visual input, allowing for measurably efficient online parsing of diagram-like visual languages, with observed linear run-times for large visual sentences.