Parsing with Relational Unification Grammars

Kent Wittenburg


Abstract
In this paper we present a unification-based grammar formalism and parsing algorithm for the purposes of defining and processing non-concatenative languages. In order to encompass languages that are characterized by relations beyond simple string concatenation, we introduce relational constraints into a linguistically-based unification grammar formalism and extend bottom-up chart parsing methods. This work is currently being applied in the interpretation of hand-sketched mathematical expressions and structured flowcharts on notebook computers and interactive worksurfaces.
Anthology ID:
1991.iwpt-1.26
Volume:
Proceedings of the Second International Workshop on Parsing Technologies
Month:
February 13-25
Year:
1991
Address:
Cancun, Mexico
Venue:
IWPT
SIG:
SIGPARSE
Publisher:
Association for Computational Linguistics
Note:
Pages:
225–234
Language:
URL:
https://aclanthology.org/1991.iwpt-1.26
DOI:
Bibkey:
Cite (ACL):
Kent Wittenburg. 1991. Parsing with Relational Unification Grammars. In Proceedings of the Second International Workshop on Parsing Technologies, pages 225–234, Cancun, Mexico. Association for Computational Linguistics.
Cite (Informal):
Parsing with Relational Unification Grammars (Wittenburg, IWPT 1991)
Copy Citation:
PDF:
https://aclanthology.org/1991.iwpt-1.26.pdf