<?xml version="1.0" standalone="yes"?>
<Paper uid="C90-2072">
  <Title>An Efficient Implementation of PATR for Categorial Unification Grammar</Title>
  <Section position="5" start_page="420" end_page="420" type="concl">
    <SectionTitle>
5 Conclusion
</SectionTitle>
    <Paragraph position="0"> C-PATR has advantages in size, speed, and portability over its predecessors. By choosing C as our implementation language, we gained in all three areas. Earlier PATR implementations, written in Lisp and Prolog, require the high overhead of an interpreter.</Paragraph>
    <Paragraph position="1"> C- PATRs 135k of source code compiles into a 58k stand-alone application on the Mac, and an 82k stand-alone on the Sun-4. C-PATR is an order of magnitude faster than D-PATR. C-PATR has been compiled on the Macintosh and on various Unix systems.</Paragraph>
    <Paragraph position="2"> There are currently plans to enhance C-PATRs existing syntactic component with a two-level morphological analyzer \[3\]. The sample grammars treatment of yonda \[see Appendix\] is an example of how one might make use of morphologically analyzed forms.</Paragraph>
    <Paragraph position="3"> C-PATR is available through the Center for the Study of Language and Information at Stanford.</Paragraph>
  </Section>
class="xml-element"></Paper>