<?xml version="1.0" standalone="yes"?>
<Paper uid="P98-1113">
  <Title>A FLEXIBLE EXAMPLE-BASED PARSER BASED ON THE SSTC&amp;quot;</Title>
  <Section position="6" start_page="692" end_page="692" type="concl">
    <SectionTitle>
5. CONCLUSION
</SectionTitle>
    <Paragraph position="0"> In this paper, we sketch an approach for parsing NL string, which is an example-based approach relies on the examples that already parsed to their representation structures, and on the knowledge that we can get from these examples information needed to parse the input sentence.</Paragraph>
    <Paragraph position="1"> A flexible annotation schema called Structured String-Tree Correspondence (SSTC) is introduced to express linguistic phenomena such as featurisation, lexicalisation and crossed dependencies. We also present an overview of the algorithm to parse natural language sentences based on the SSTC annotation schema. However, to obtain a full version of the parsing algorithm, there are several other problems which needed to be considered further, i.e. the handling of multiple substitutions, an efficient method to calculate the distance between the input sentence and the examples, and lastly a detailed formula to compute the resultant SSTC obtained from the combination process especially when deletion of optional substitutions are involved.</Paragraph>
  </Section>
class="xml-element"></Paper>