liu.seSearch for publications in DiVA
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Tree-Adjoining Grammars are not Closed Under Strong Lexicalization
Uppsala universitet, Institutionen för lingvistik och filologi. (Datorlingvistik)ORCID-id: 0000-0002-2492-9872
University of Padua, Padua, Italy.
2012 (engelsk)Inngår i: Computational linguistics - Association for Computational Linguistics (Print), ISSN 0891-2017, E-ISSN 1530-9312, Vol. 38, nr 3, s. 617-629Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

A lexicalized tree-adjoining grammar is a tree-adjoining grammar where each elementary tree contains some overt lexical item. Such grammars are being used to give lexical accounts of syntactic phenomena, where an elementary tree defines the domain of locality of the syntactic and semantic dependencies of its lexical items. It has been claimed in the literature that for every tree-adjoining grammar, one can construct a strongly equivalent lexicalized version. We show that such a procedure does not exist: Tree-adjoining grammars are not closed under strong lexicalization.

sted, utgiver, år, opplag, sider
Cambridge, MA, USA: MIT Press, 2012. Vol. 38, nr 3, s. 617-629
HSV kategori
Forskningsprogram
Datorlingvistik
Identifikatorer
URN: urn:nbn:se:liu:diva-100295DOI: 10.1162/COLI_a_00090ISI: 000308083100006OAI: oai:DiVA.org:liu-100295DiVA, id: diva2:661428
Tilgjengelig fra: 2012-01-09 Laget: 2013-11-04 Sist oppdatert: 2018-01-11bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekst

Personposter BETA

Kuhlmann, Marco

Søk i DiVA

Av forfatter/redaktør
Kuhlmann, Marco
I samme tidsskrift
Computational linguistics - Association for Computational Linguistics (Print)

Søk utenfor DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 19 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf