首页> 外文期刊>Computational linguistics >Parsing Noun Phrases in the Penn Treebank
【24h】

Parsing Noun Phrases in the Penn Treebank

机译:在Penn Treebank中解析名词短语

获取原文
       

摘要

Noun phrases (nps) are a crucial part of natural language, and can have a very complex structure. However, this np structure is largely ignored by the statistical parsing field, as the most widely used corpus is not annotated with it. This lack of gold-standard data has restricted previous efforts to parse nps, making it impossible to perform the supervised experiments that have achieved high performance in so many Natural Language Processing (nlp) tasks. We comprehensively solve this problem by manually annotating np structure for the entire Wall Street Journal section of the Penn Treebank. The inter-annotator agreement scores that we attain dispel the belief that the task is too difficult, and demonstrate that consistent np annotation is possible. Our gold-standard np data is now available for use in all parsers. We experiment with this new data, applying the Collins (2003) parsing model, and find that its recovery of np structure is significantly worse than its overall performance. The parser's F-score is up to 5.69% lower than a baseline that uses deterministic rules. Through much experimentation, we determine that this result is primarily caused by a lack of lexical information. To solve this problem we construct a wide-coverage, large-scale np Bracketing system. With our Penn Treebank data set, which is orders of magnitude larger than those used previously, we build a supervised model that achieves excellent results. Our model performs at 93.8% F-score on the simple task that most previous work has undertaken, and extends to bracket longer, more complex nps that are rarely dealt with in the literature. We attain 89.14% F-score on this much more difficult task. Finally, we implement a post-processing module that brackets nps identified by the Bikel (2004) parser. Our np Bracketing model includes a wide variety of features that provide the lexical information that was missing during the parser experiments, and as a result, we outperform the parser's F-score by 9.04%. These experiments demonstrate the utility of the corpus, and show that many nlp applications can now make use of np structure.
机译:名词短语(nps)是自然语言的重要组成部分,并且可以具有非常复杂的结构。但是,此np结构在统计分析字段中基本上被忽略,因为使用最广泛的语料库没有对此进行注释。缺乏金标准数据限制了以前解析nps的工作,从而使得无法执行在许多自然语言处理(nlp)任务中已实现高性能的监督实验。我们通过为Penn Treebank的整个《华尔街日报》部分手动注释np结构来全面解决此问题。我们在注释者之间达成的协议分数打消了我们认为任务太难的信念,并证明了一致的np注释是可能的。现在,我们的金标准np数据可用于所有解析器。我们使用Collins(2003)解析模型对这一新数据进行了实验,发现其np结构的恢复显着低于其整体性能。解析器的F得分比使用确定性规则的基线低多达5.69%。通过大量实验,我们确定此结果主要是由于缺乏词汇信息引起的。为了解决这个问题,我们构建了一个覆盖面广的大型np包围系统。使用我们的Penn Treebank数据集,该数据集比以前使用的数据集大几个数量级,我们构建了一个可实现出色结果的监督模型。我们的模型在完成大多数以前的工作时所完成的简单任务上的F得分为93.8%,并且可以扩展到更长,更复杂的nps,这在文献中很少涉及。在这项艰巨的任务上,我们获得89.14%的F分数。最后,我们实现了一个后处理模块,该模块将由Bikel(2004)解析器标识的nps括起来。我们的np Bracketing模型包含多种功能,可提供解析器实验期间缺少的词汇信息,因此,我们的表现优于解析器的F得分9.04%。这些实验证明了语料库的效用,并表明许多nlp应用程序现在可以利用np结构。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号