首页    期刊浏览 2024年11月25日 星期一
登录注册

文章基本信息

  • 标题:Tree-Adjoining Grammars Are Not Closed Under Strong Lexicalization
  • 本地全文:下载
  • 作者:Marco Kuhlmann ; Giorgio Satta
  • 期刊名称:Computational Linguistics
  • 印刷版ISSN:0891-2017
  • 电子版ISSN:1530-9312
  • 出版年度:2012
  • 卷号:38
  • 期号:3
  • 页码:617-629
  • DOI:10.1162/COLI_a_00090
  • 语种:English
  • 出版社:MIT Press
  • 摘要: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.
国家哲学社会科学文献中心版权所有