Efficient HPSG Parsing with Supertagging and CFG-Filtering
Efficient HPSG Parsing with Supertagging and CFG-Filtering
复制标题
DOI：
--
复制
发表时间：
2007-01
期刊：
影响因子：
--
通讯作者：
Takuya Matsuzaki;Yusuke Miyao;Junichi Tsujii
中科院分区：
文献类型：
--
作者：
Takuya Matsuzaki;Yusuke Miyao;Junichi Tsujii
提出了一种高效的HPSG解析技术。最近的研究表明，超标注是提高词汇化语法分析速度和准确性的关键技术。我们表明，进一步加快是可能的，通过消除非解析的词汇条目序列的输出的supertagger。通过CFG过滤技术来测试词条序列的可解析性，该技术使用接近HPSG的CFG来测试词条序列。通过CFG过滤器的词条序列通过简单的移位-归约解析算法组合成解析树，其中使用分类器解决结构歧义，并检查原始语法中表示的所有语法约束。实验结果表明，我们的系统提供了相当的准确性与加速的一个因素，6（30毫秒/句子）相比，使用相同的语法最好的公布的结果。
An efficient parsing technique for HPSG is presented. Recent research has shown that supertagging is a key technology to improve both the speed and accuracy of lexicalized grammar parsing. We show that further speed-up is possible by eliminating non-parsable lexical entry sequences from the output of the supertagger. The parsability of the lexical entry sequences is tested by a technique called CFG-filtering, where a CFG that approximates the HPSG is used to test it. Those lexical entry sequences that passed through the CFG-filter are combined into parse trees by using a simple shift-reduce parsing algorithm, in which structural ambiguities are resolved using a classifier and all the syntactic constraints represented in the original grammar are checked. Experimental results show that our system gives comparable accuracy with a speed-up by a factor of six (30 msec/sentence) compared with the best published result using the same grammar.