<?xml version="1.0" standalone="yes"?>
<Paper uid="P89-1017">
  <Title>How to cover a grammar Ren6 Leermakers</Title>
  <Section position="3" start_page="0" end_page="0" type="intro">
    <SectionTitle>
1 Introduction
</SectionTitle>
    <Paragraph position="0"> A major problem of computational linguistics is the inefficiency of parsing natural language. The most popular parsing method for context-free natural language grammars, is the genera/ context-free parsing method of Earley \[1\]. It was noted by Lang \[2\], that Earley-like methods can be used for simulating a class of non-determlnistic pushdown antomata(NPDA). Recently, Tondta \[3\] presented an algorithm that simulates non-determlnistic LRoparsers, and claimed it to be a fast Mgorithm for practical natural language processing systems. The purpose of the present paper is threefold: 1 A novel formalism is presented for Earley-like parsers.</Paragraph>
    <Paragraph position="1"> A key rSle herein is played by the concept of bilinear grammaxs. These are defined as context-free grammars, that satisfy the constraint that the right hand side of each grammar rule have at most two non-terminals. The construction of parse matrices * for bilinear grammars can be accomplished in cubic time, by an algorithm called C-paxser. It includes an elegant way to represent the (possibly infinite) set of parse trees. A case in point is the use of predict functions, which impose restrictions on the parse matrix, if part of it is known. The exact form and effectiveness of predict functions depend on the bilineax grammar at hand. In order to parse a genera\] context-free grammar G, a possible strategy is to define a cover for G that satisfies the bilinear grammar constraint, and subsequently parse it with C-parser using appropriate predict functions.</Paragraph>
    <Paragraph position="2"> The resulting parsers axe named Earley-like, and differ only in the precise description for deriving covers, and predict functions.</Paragraph>
    <Paragraph position="3"> 2 We present the Lang algorithm by giving a bilinear grammar corresponding to an NPDA. Employing the correct predict functions, the parser for this grammar is equivalent to Lang's algorithm, although it works for a slightly different class of NPDA's. We show that simulation of non-deterministic LR-parsers can be performed in our version of the Lang framework. It follows that Earley-like Tomita parsers can handle all context-free grammars, including cyclic ones, although Tomita suggested differently\[3\].</Paragraph>
    <Paragraph position="4"> 3 The formalism is illustrated by applying it to Recursire Transition Networka(RTN)\[S\]: Applying the techniques of deterministic LR-parsing to grammars written as RTN's has been the subject of recent studies \[9,10\]. Using this research, we show how to construct efficient non-deterministic LR-parsers for RTN's.</Paragraph>
  </Section>
class="xml-element"></Paper>