Paper: Semantic Parsing As Graph Language Transformation - A Multidimensional Approach To Parsing Highly Inflectional Languages

ACL ID P84-1110
Title Semantic Parsing As Graph Language Transformation - A Multidimensional Approach To Parsing Highly Inflectional Languages
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 1984
Authors
  • Eero Hyvonen (Helsinki University of Technology, Helsinki Finland)

The structure of many languages with "free" word order and rich morphology like Finnish is rather configurational than linear. Although non-linear structures can be represented by linear formalisms it is often more natural to study multidimensional arrangement of symbols. Graph grammars are a multidimensional generalization of linear string grammars. In graph grammars string rewrite rules are generalized into graph rewrite rules. This paper presents a graph grammar formalism and parsing scheme for parsing languages with inherent configurational flavor. A small experimental Finnish parsing system has been implemented (Hyv6nen 1983). A SIMPLE GRAPH GRAMMAR FORMALISM WITH A CONTROL FACILITY In applying string grammars to parsing natural Finnish several problems arise in representing complex w...