A Parsing Fast, Exact Viterbi Parse Selection:分析快速,准确的维特比解析选择.pptVIP

  • 3
  • 0
  • 约1.41万字
  • 约 48页
  • 2018-06-24 发布于四川
  • 举报

A Parsing Fast, Exact Viterbi Parse Selection:分析快速,准确的维特比解析选择.ppt

A Parsing Fast, Exact Viterbi Parse Selection:分析快速,准确的维特比解析选择

Natural Language Parsing: Graphs, the A* Algorithm, and Modularity Christopher Manning and Dan Klein, Roger Levy Depts of Computer Science and Linguistics Stanford University /~manning/ 1. Hasn’t this been solved? Time complexity of (general) CFG parsing is dominated by the number of traversals done. Traversals represent the combination of two adjacent parse items into a larger one: Is the problem just cycles? Bill Gates, Remarks to Gartner Symposium, October 6, 1997: Applications always become more demanding. Until the computer can speak to you in perfect English and understand everything you say to it and learn in the same way that an assistant would learn – until it has the power to do that – we need all the cycles. We need to be optimized to do the best we can. Right now linguistics are right on the edge of what the processor can do. As we get another factor of two, then speech will start to be on the edge of what it can do. Why is Natural Language Understanding difficult? The hidden structure of language is highly ambiguous Tree for: Fed raises interest rates 0.5% in effort to control inflation (NYT headline 5/17/00) Where are the ambiguities? The bad effects of V/N ambiguities The ambiguity of language: Newspaper headlines Ban on Nude Dancing on Governors Desk – from a Georgia newspaper discussing current legislation Juvenile Court to Try Shooting Defendant Teacher Strikes Idle Kids Stolen Painting Found by Tree Local High School Dropouts Cut in Half Red Tape Holds Up New Bridges and a couple of new ones: China to orbit human on Oct. 15 Moon wants to go to space Goal: Information ? Knowledge Lots of unstructured text/web information that we’d like to turn into usable knowledge employs(stanfordUniversity, chrisManning) ?t ?e ?x1 ?x2 (employing(e) employer(e, x1) employed(e, x2) name(x2, “Christopher Manning”) name(x1, “Stanford University) at(e, t) t ? [1999, 2003] Question answering (QA) from text TREC 8+ Question A competition With massive c

您可能关注的文档

文档评论(0)

1亿VIP精品文档

相关文档