<?xml version="1.0" standalone="yes"?>
<Paper uid="J87-1001">
  <Title>RESTRICTING LOGIC GRAMMARS WITH GOVERNMENT-BINDING THEORY</Title>
  <Section position="1" start_page="0" end_page="0" type="abstr">
    <SectionTitle>
RESTRICTING LOGIC GRAMMARS
WITH GOVERNMENT-BINDING THEORY
</SectionTitle>
    <Paragraph position="0"> A parser formalism for natural languages that is so restricted as to rule out the definition of linguistic structures that do not occur in any natural language can make the task of grammar construction easier, whether it is done manually (by a programmer) or automatically (by a grammar induction system). A restrictive grammar formalism for logic programming languages is presented that imposes some of the constraints suggested by recent Chomskian linguistic theory. In spite of these restrictions, this formalism allows for relatively elegant characterizations of natural languages that can be translated into efficient prolog parsers.</Paragraph>
  </Section>
class="xml-element"></Paper>