<?xml version="1.0" standalone="yes"?>
<Paper uid="P84-1110">
  <Title>SEMANIIC PARSING AS GRAPH LANGUAGE TRANSFORMATION - A MULIIDIMENSIONAL APPROACH TO PARSING HIGHLY INFLECTIONAL LANGUAGES</Title>
  <Section position="2" start_page="0" end_page="0" type="intro">
    <SectionTitle>
FINLAND
ABSTRACT
</SectionTitle>
    <Paragraph position="0"> The structure of many languages with &amp;quot;free&amp;quot; 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.</Paragraph>
    <Paragraph position="1"> Graph grammars are a multidimensional generalization of linear string grammars.</Paragraph>
    <Paragraph position="2"> In graph grammars string rewrite rules are generalized into graph rewrite rules.</Paragraph>
    <Paragraph position="3"> 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).</Paragraph>
  </Section>
class="xml-element"></Paper>