<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="becker-heckmann-2000-parsing">
    <titleInfo>
        <title>Parsing Mildly Context-sensitive RMS</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Tilman</namePart>
        <namePart type="family">Becker</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Dominik</namePart>
        <namePart type="family">Heckmann</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 introduce Recursive Matrix Systems (RMS) which encompass mildly context-sensitive formalisms and present efficient parsing algorithms for linear and context-free variants of RMS. The time complexities are $\mathcalO(n^2h + 1)$, and $\mathcalO(n^3h)$ respectively, where $h$ is the height of the matrix. It is possible to represent Tree Adjoining Grammars (TAG [1], MC-TAG [2], and R-TAG [3]) as RMS uniformly.</abstract>
    <identifier type="citekey">becker-heckmann-2000-parsing</identifier>
    <location>
        <url>https://aclanthology.org/2000.iwpt-1.29</url>
    </location>
    <part>
        <date>2000-feb&quot; 23-25&quot;</date>
        <extent unit="page">
            <start>293</start>
            <end>294</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T Parsing Mildly Context-sensitive RMS
%A Becker, Tilman
%A Heckmann, Dominik
%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 becker-heckmann-2000-parsing
%X We introduce Recursive Matrix Systems (RMS) which encompass mildly context-sensitive formalisms and present efficient parsing algorithms for linear and context-free variants of RMS. The time complexities are $\mathcalO(n^2h + 1)$, and $\mathcalO(n^3h)$ respectively, where $h$ is the height of the matrix. It is possible to represent Tree Adjoining Grammars (TAG [1], MC-TAG [2], and R-TAG [3]) as RMS uniformly.
%U https://aclanthology.org/2000.iwpt-1.29
%P 293-294

Markdown (Informal)

[Parsing Mildly Context-sensitive RMS](https://aclanthology.org/2000.iwpt-1.29) (Becker & Heckmann, IWPT 2000)

• Parsing Mildly Context-sensitive RMS (Becker & Heckmann, IWPT 2000)

ACL

• Tilman Becker and Dominik Heckmann. 2000. Parsing Mildly Context-sensitive RMS. In Proceedings of the Sixth International Workshop on Parsing Technologies, pages 293–294, Trento, Italy. Association for Computational Linguistics.