Abstract
Minimalist Grammars are a rigorous formalization of the sort of grammars proposed in the linguistic framework of Chomsky’s Minimalist Program. One notable property of Minimalist Grammars is that they allow constituents to move during the derivation of a sentence, thus creating discontinuous constituents. In this paper we will present a bottom-up parsing method for Minimalist Grammars, prove its correctness, and discuss its complexity.- Anthology ID:
- 2000.iwpt-1.13
- 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, John Carroll, 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:
- 111–122
- Language:
- URL:
- https://aclanthology.org/2000.iwpt-1.13
- DOI:
- Bibkey:
- Cite (ACL):
- Henk Harkema. 2000. A Recognizer for Minimalist Grammars. In Proceedings of the Sixth International Workshop on Parsing Technologies, pages 111–122, Trento, Italy. Association for Computational Linguistics.
- Cite (Informal):
- A Recognizer for Minimalist Grammars (Harkema, IWPT 2000)
- Copy Citation:
- PDF:
- https://aclanthology.org/2000.iwpt-1.13.pdf
Export citation
@inproceedings{harkema-2000-recognizer, title = "A Recognizer for {M}inimalist {G}rammars", author = "Harkema, Henk", editor = "Lavelli, Alberto and Carroll, John and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Carroll, John 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.13", pages = "111--122", abstract = "Minimalist Grammars are a rigorous formalization of the sort of grammars proposed in the linguistic framework of Chomsky{'}s Minimalist Program. One notable property of Minimalist Grammars is that they allow constituents to move during the derivation of a sentence, thus creating discontinuous constituents. In this paper we will present a bottom-up parsing method for Minimalist Grammars, prove its correctness, and discuss its complexity.", }
<?xml version="1.0" encoding="UTF-8"?> <modsCollection xmlns="http://www.loc.gov/mods/v3"> <mods ID="harkema-2000-recognizer"> <titleInfo> <title>A Recognizer for Minimalist Grammars</title> </titleInfo> <name type="personal"> <namePart type="given">Henk</namePart> <namePart type="family">Harkema</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>Minimalist Grammars are a rigorous formalization of the sort of grammars proposed in the linguistic framework of Chomsky’s Minimalist Program. One notable property of Minimalist Grammars is that they allow constituents to move during the derivation of a sentence, thus creating discontinuous constituents. In this paper we will present a bottom-up parsing method for Minimalist Grammars, prove its correctness, and discuss its complexity.</abstract> <identifier type="citekey">harkema-2000-recognizer</identifier> <location> <url>https://aclanthology.org/2000.iwpt-1.13</url> </location> <part> <date>2000-feb 23-25</date> <extent unit="page"> <start>111</start> <end>122</end> </extent> </part> </mods> </modsCollection>
%0 Conference Proceedings %T A Recognizer for Minimalist Grammars %A Harkema, Henk %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 harkema-2000-recognizer %X Minimalist Grammars are a rigorous formalization of the sort of grammars proposed in the linguistic framework of Chomsky’s Minimalist Program. One notable property of Minimalist Grammars is that they allow constituents to move during the derivation of a sentence, thus creating discontinuous constituents. In this paper we will present a bottom-up parsing method for Minimalist Grammars, prove its correctness, and discuss its complexity. %U https://aclanthology.org/2000.iwpt-1.13 %P 111-122
Markdown (Informal)
[A Recognizer for Minimalist Grammars](https://aclanthology.org/2000.iwpt-1.13) (Harkema, IWPT 2000)
- A Recognizer for Minimalist Grammars (Harkema, IWPT 2000)
ACL
- Henk Harkema. 2000. A Recognizer for Minimalist Grammars. In Proceedings of the Sixth International Workshop on Parsing Technologies, pages 111–122, Trento, Italy. Association for Computational Linguistics.