<?xml version="1.0" standalone="yes"?>
<Paper uid="C92-1033">
  <Title>TTP: A FAST AND ROBUST PARSER FOR NATURAL LANGUAGE</Title>
  <Section position="9" start_page="0" end_page="0" type="ackno">
    <SectionTitle>
7. ACKNOWLEDGEMENTS
</SectionTitle>
    <Paragraph position="0"> We wish to thank Ralph Weischedel and Heidi Fox of BBN for assisting in the use of the part of speech tagger. ACM has generously provided us with the Computer Library text database. This paper is based upon work supported by the Defense Advanced Research Project Agency under Contract N00014-90-J-1851 from the Office of Naval Research, the National Science Foundation under Grant IRI-8902304, and by the Canadian Institute for Robotics and Intelligent Systems (IRIS).</Paragraph>
    <Paragraph position="1"> APPENDIX: Sample parses A few examples of non-standard output generated by TTP are shown in Figures 1 to 3. In Figure 1, &amp;quot;ITP has failed to find the main verb and it had to jump over much of the last phrase such as the LR(k) grammars, partly due to an improper tokenization of LR(k) (note skipped nodes indicating the material ignored in the first pass). In Figure 2, the parser has initially assumed that the conjunction in the sentence has the narrow scope, then it realized that something went wrong but, apparently, there was no time left to back up. Note, however, that little has been lost: a complete strncture of the second half of this sentence following the conjuction and is easily recovered from the parse tree (var points up to the dominating rip). Occasionally, sentences may come out substantially truncated, as shown in Figure 3, where although has been mis-tagged as a preposition.</Paragraph>
    <Paragraph position="2"> SENTF~CE: The problem of determining whether an arbitrary context-free grammar is a member of some easily parsed subclass of grammars such as the LR(k) grammars is considered.</Paragraph>
    <Paragraph position="3">  SENTENCE: The TX-2 computer at MIT Lincoln Laboratory was used for the implementation of such a system and the characteristics of this implementation are reported.  SENTENCE: In principle, the system can deal with any orthography, although at present it is limited to 4000 Chinese characters and some mathematical symbols.</Paragraph>
  </Section>
class="xml-element"></Paper>