Parsing Mildly Context-sensitive RMS

Tilman Becker; Dominik Heckmann

Parsing Mildly Context-sensitive RMS

Correct Metadata for

Use this form to create a GitHub issue with structured data describing the correction. You will need a GitHub account. Once you create that issue, the correction will be reviewed by a staff member.

⚠️ Mobile Users: Submitting this form to create a new issue will only work with github.com, not the GitHub Mobile app.

Important: The Anthology treat PDFs as authoritative. Please use this form only to correct data that is out of line with the PDF. See our corrections guidelines if you need to change the PDF.

Title Adjust the title. Retain tags such as <fixed-case>.

Authors Adjust author names and order to match the PDF.

Abstract Correct abstract if needed. Retain XML formatting tags such as <tex-math>. You may use <b>...</b> for bold, <i>...</i> for italic, and <url>...</url> for URLs.

Verification against PDF Ensure that the new title/authors match the snapshot below. (If there is no snapshot or it is too small, consult the PDF.)

Authors concatenated from the text boxes above:

ALL author names match the snapshot above—including middle initials, hyphens, and accents.

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 𝒪(n^{2h + 1}), and 𝒪(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.

Anthology ID:: 2000.iwpt-1.29
Volume:: Proceedings of the Sixth International Workshop on Parsing Technologies
Month:: February 23-25
Year:: 2000
Address:: Trento, Italy
Editors:: Alberto Lavelli, John Carroll, Robert C. Berwick, Harry C. Bunt, Bob Carpenter, Ken Church, Mark Johnson, Aravind Joshi, Ronald Kaplan, Martin Kay, Bernard Lang, Alon Lavie, Anton Nijholt, Christer Samuelsson, Mark Steedman, Oliviero Stock, Hozumi Tanaka, Masaru Tomita, Hans Uszkoreit, K. Vijay-Shanker, David Weir, Mats Wiren
Venue:: IWPT
SIG:: SIGPARSE
Publisher:: Association for Computational Linguistics
Note:
Pages:: 293–294
Language:
URL:: https://aclanthology.org/2000.iwpt-1.29/
DOI:
Bibkey:
Cite (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.
Cite (Informal):: Parsing Mildly Context-sensitive RMS (Becker & Heckmann, IWPT 2000)
Copy Citation:
PDF:: https://aclanthology.org/2000.iwpt-1.29.pdf

PDF Cite Search Fix data

Export citation

BibTeX
MODS XML
Endnote
Preformatted

@inproceedings{becker-heckmann-2000-parsing,
    title = "Parsing Mildly Context-sensitive {RMS}",
    author = "Becker, Tilman  and
      Heckmann, Dominik",
    editor = "Lavelli, Alberto  and
      Carroll, John  and
      Berwick, Robert C.  and
      Bunt, Harry C.  and
      Carpenter, Bob  and
      Church, Ken  and
      Johnson, Mark  and
      Joshi, Aravind  and
      Kaplan, Ronald  and
      Kay, Martin  and
      Lang, Bernard  and
      Lavie, Alon  and
      Nijholt, Anton  and
      Samuelsson, Christer  and
      Steedman, Mark  and
      Stock, Oliviero  and
      Tanaka, Hozumi  and
      Tomita, Masaru  and
      Uszkoreit, Hans  and
      Vijay-Shanker, K.  and
      Weir, David  and
      Wiren, Mats",
    booktitle = "Proceedings of the Sixth International Workshop on Parsing Technologies",
    month = feb # " 23-25",
    year = "2000",
    address = "Trento, Italy",
    publisher = "Association for Computational Linguistics",
    url = "https://aclanthology.org/2000.iwpt-1.29/",
    pages = "293--294",
    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 $\mathcal{O}(n^{2h + 1})$, and $\mathcal{O}(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."
}

Download as File

<?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 23-25</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the Sixth International Workshop on Parsing Technologies</title>
        </titleInfo>
        <name type="personal">
            <namePart type="given">Alberto</namePart>
            <namePart type="family">Lavelli</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">John</namePart>
            <namePart type="family">Carroll</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Robert</namePart>
            <namePart type="given">C</namePart>
            <namePart type="family">Berwick</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Harry</namePart>
            <namePart type="given">C</namePart>
            <namePart type="family">Bunt</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Bob</namePart>
            <namePart type="family">Carpenter</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Ken</namePart>
            <namePart type="family">Church</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Mark</namePart>
            <namePart type="family">Johnson</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Aravind</namePart>
            <namePart type="family">Joshi</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Ronald</namePart>
            <namePart type="family">Kaplan</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Martin</namePart>
            <namePart type="family">Kay</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Bernard</namePart>
            <namePart type="family">Lang</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Alon</namePart>
            <namePart type="family">Lavie</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Anton</namePart>
            <namePart type="family">Nijholt</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Christer</namePart>
            <namePart type="family">Samuelsson</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Mark</namePart>
            <namePart type="family">Steedman</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Oliviero</namePart>
            <namePart type="family">Stock</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Hozumi</namePart>
            <namePart type="family">Tanaka</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Masaru</namePart>
            <namePart type="family">Tomita</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Hans</namePart>
            <namePart type="family">Uszkoreit</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">K</namePart>
            <namePart type="family">Vijay-Shanker</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">David</namePart>
            <namePart type="family">Weir</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Mats</namePart>
            <namePart type="family">Wiren</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <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²h + 1), and \mathcalO(n³h) 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 23-25</date>
        <extent unit="page">
            <start>293</start>
            <end>294</end>
        </extent>
    </part>
</mods>
</modsCollection>

Download as File

%0 Conference Proceedings
%T Parsing Mildly Context-sensitive RMS
%A Becker, Tilman
%A Heckmann, Dominik
%Y Lavelli, Alberto
%Y Carroll, John
%Y Berwick, Robert C.
%Y Bunt, Harry C.
%Y Carpenter, Bob
%Y Church, Ken
%Y Johnson, Mark
%Y Joshi, Aravind
%Y Kaplan, Ronald
%Y Kay, Martin
%Y Lang, Bernard
%Y Lavie, Alon
%Y Nijholt, Anton
%Y Samuelsson, Christer
%Y Steedman, Mark
%Y Stock, Oliviero
%Y Tanaka, Hozumi
%Y Tomita, Masaru
%Y Uszkoreit, Hans
%Y Vijay-Shanker, K.
%Y Weir, David
%Y Wiren, Mats
%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²h + 1), and \mathcalO(n³h) 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

Download as File

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.