Parsing Schemata - a framework for specification and analysis of parsing algorithms

Nicolaas Sikkel

    Research output: Book/ReportBookAcademic


    Parsing schemata provide a general framework for specification, analysis and comparison of (sequential and/or parallel) parsing algorithms. A grammar specifies implicitly what the valid parses of a sentence are; a parsing algorithm specifies explicitly how to compute these. Parsing schemata form a well-defined level of abstraction in between grammars and parsing algorithms. A parsing schema specifies the types of intermediate results that can be computed by a parser, and the rules that allow to expand a given set of such results with new results. A parsing schema does not specify the data structures, control structures, and (in case of parallel processing) communication structures that are to be used by a parser. Part I, Exposition, gives a general introduction to the ideas that are worked out in the following parts. Part II, Foundation, unfolds a mathematical theory of parsing schemata. Different kinds of relations between parsing schemata are formally introduced and illustrated with examples drawn from the parsing literature. Part III, Application, discusses a series of applications of parsing schemata. - Feature percolation in unification grammar parsing can be described in an elegant, legible notation. - Because of the absence of algorithmic detail, parsing schemata can be used to get a formal grip on highly complicated algorithms. We give substance to this claim by means of a thorough analysis of Left-Corner and Head-Corner chart parsing. - As an example of structural similarity of parsers, despite differences in form and appearance, we show that the underlying parsing schemata of Earley's algorithm and Tomita's algorithm are virtually identical. Using this structural correspondence we can obtain a novel parallel parser by cross-fertilizing a parallel Earley parser with Tomita's graph-structured stack. - Parsing schemata can be implemented straightforwardly by boolean circuits. This means that, in principle, parsing schemata can be coded directly into hardware.
    Original languageUndefined
    Place of PublicationBerlin
    Number of pages365
    ISBN (Print)3-540-61650-0
    Publication statusPublished - 1997

    Publication series

    NameTexts in Theoretical Computer Science
    PublisherSpringer Verlag


    • HMI-SLT: Speech and Language Technology
    • EWI-10846

    Cite this