arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv cmp-lg/9606022cmp-lgcs.CL
收藏

关于面向数据解析的两个问题

Two Questions about Data-Oriented Parsing

Rens Bod

摘要:

在本文中,我目前正在进行的工作,面向数据的解析(DOP)模型。在以前的工作中,DOP进行了测试,从宾夕法尼亚州树库的一组清理的分析部分的语音字符串,取得了良好的测试结果。然而,这留下了两个重要的问题没有回答:(1)如果在未经编辑的数据上测试,DOP如何执行,以及(2)DOP如何用于解析包含未知单词的单词串?本文探讨了这些问题。我们表明,未编辑的数据上的解析结果比清理后的数据更差,虽然与其他模型相比非常有竞争力。至于单词串的解析,我们表明,这个问题的难度并不取决于未知的单词,但在以前看不见的词汇类别的已知单词。我们给出了一种新的方法来分析这些话,通过估计未知子树的概率。该方法是普遍感兴趣的,因为它表明,可以获得良好的性能,而不使用一部分的语音标记。据我们所知,我们的方法优于其他统计分析器测试Penn Treebank字串。

英文摘要:

In this paper I present ongoing work on the data-oriented parsing (DOP) model. In previous work, DOP was tested on a cleaned-up set of analyzed part-of-speech strings from the Penn Treebank, achieving excellent test results. This left, however, two important questions unanswered: (1) how does DOP perform if tested on unedited data, and (2) how can DOP be used for parsing word strings that contain unknown words? This paper addresses these questions. We show that parse results on unedited data are worse than on cleaned-up data, although very competitive if compared to other models. As to the parsing of word strings, we show that the hardness of the problem does not so much depend on unknown words, but on previously unseen lexical categories of known words. We give a novel method for parsing these words by estimating the probabilities of unknown subtrees. The method is of general interest since it shows that good performance can be obtained without the use of a part-of-speech tagger. To the best of our knowledge, our method outperforms other statistical parsers tested on Penn Treebank word strings.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑