Lexical-Functional Grammar.pptVIP

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
Lexical-Functional Grammar

10/18/2006 Lexical-Functional Grammars Lexical-Functional Grammar A Formal System for Grammatical Representation Kaplan and Bresnan, 1982 Erin Fitzgerald NLP Reading Group October 18, 2006 LFG History Developed by J. Bresnan and R. Kaplan in early 1970’s Believed Chomskyan approach doesn’t model psychological reality of language Other motivations: Supported in wider variety of languages than other formalisms ex nonconfigurational languages with ~free word order/ case marks Movement paradoxes: That he was sick we talked about __ for days. *We talked about that he was sick for days. We talked about the fact that he was sick for days. How it’s different from Chomsky X’ Requires a higher level of mathematical precision Subject, Object, etc considered primitives, not defined from positions in tree Empty categories and funct. projections avoided No movement Unification-based Levels of representation not strictly derived from each other Not assumed that phonological, etc contents are derived from syntactic structure in any way. How it’s different from HPSG No hierarchical classification to deal with vertical and horizontal redundancy LFG focuses on the processing and psychological reality of language HPSG combines all syntactic, phonological, etc information into a single level Generative Power of LFG Not as powerful as general rewriting system or Turing Machine LF languages are context-sensitive But, greater generative capacity than CFG lower bound Allows anbncn, ωω non-CF languages Sources of generative power: Functional Composition: Helps encode range of tree properties Equality Predicate: Enforces a match between properties encoded from different nodes Correspondence Between Levels C onstituent -structure: varies across languages F unctional -structure: Universal properties Structures aren’t isomorphic, but related by different correspondences C-Structure Composed of Terminal strings Syntactic categories Dominance/precedence relations Expressed through phrase s

文档评论(0)

gfh669266 + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档