<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="schneider-2000-algebraic">
    <titleInfo>
        <title>Algebraic Construction of Parsing Schemata</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Karl-Michael</namePart>
        <namePart type="family">Schneider</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2000-feb&quot; 23-25&quot;</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the Sixth International Workshop on Parsing Technologies</title>
        </titleInfo>
        <originInfo>
            <publisher>Association for Computational Linguistics</publisher>
            <place>
                <placeTerm type="text">Trento, Italy</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>We propose an algebraic method for the design of tabular parsing algorithms which uses parsing schemata [7]. The parsing strategy is expressed in a tree algebra. A parsing schema is derived from the tree algebra by means of algebraic operations such as homomorphic images, direct products, subalgebras and quotient algebras. The latter yields a tabular interpretation of the parsing strategy. The proposed method allows simpler and more elegant correctness proofs by using general theorems and is not limited to left-right parsing strategies, unlike current automaton-based approaches. Furthermore, it allows to derive parsing schemata for linear indexed grammars (LIG) from parsing schemata for context-free grammars by means of a correctness preserving algebraic transformation. A new bottom-up head corner parsing schema for LIG is constructed to demonstrate the method.</abstract>
    <identifier type="citekey">schneider-2000-algebraic</identifier>
    <location>
        <url>https://aclanthology.org/2000.iwpt-1.24</url>
    </location>
    <part>
        <date>2000-feb&quot; 23-25&quot;</date>
        <extent unit="page">
            <start>242</start>
            <end>253</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T Algebraic Construction of Parsing Schemata
%A Schneider, Karl-Michael
%S Proceedings of the Sixth International Workshop on Parsing Technologies
%D 2000
%8 feb" 23 25"
%I Association for Computational Linguistics
%C Trento, Italy
%F schneider-2000-algebraic
%X We propose an algebraic method for the design of tabular parsing algorithms which uses parsing schemata [7]. The parsing strategy is expressed in a tree algebra. A parsing schema is derived from the tree algebra by means of algebraic operations such as homomorphic images, direct products, subalgebras and quotient algebras. The latter yields a tabular interpretation of the parsing strategy. The proposed method allows simpler and more elegant correctness proofs by using general theorems and is not limited to left-right parsing strategies, unlike current automaton-based approaches. Furthermore, it allows to derive parsing schemata for linear indexed grammars (LIG) from parsing schemata for context-free grammars by means of a correctness preserving algebraic transformation. A new bottom-up head corner parsing schema for LIG is constructed to demonstrate the method.
%U https://aclanthology.org/2000.iwpt-1.24
%P 242-253

Markdown (Informal)

[Algebraic Construction of Parsing Schemata](https://aclanthology.org/2000.iwpt-1.24) (Schneider, IWPT 2000)

• Algebraic Construction of Parsing Schemata (Schneider, IWPT 2000)

ACL

• Karl-Michael Schneider. 2000. Algebraic Construction of Parsing Schemata. In Proceedings of the Sixth International Workshop on Parsing Technologies, pages 242–253, Trento, Italy. Association for Computational Linguistics.