使用Java，nlp的Pharse级依赖解析器 [英] Pharse level dependency parser using java,nlp

问题描述

有人可以详细说明如何使用Stanfords的自然语言处理词法分析器-开源Java代码获取短语级依赖性"吗?

Can someone please elaborate on how to obtain " pharse level dependency" using the Stanfords's Natural Language Processing Lexical Parser- open source Java code? http://svn.apache.org/repos/asf/nutch/branches/branch-1.2/src/plugin/lib-http/src/java/org/apache/nutch/protocol/http/api/RobotRulesParser.java

http://docs.mongodb.org/manual/reference/sql-comparison /

例如

相位依赖

意外--------->发生

The accident --------->happened

下降--------->为

falling ---------> as

黑夜---------->坠落

the night ---------->falling

更多……

谢谢！

推荐答案

您可以将单词分组在一个标记中，以便获得短语级别的依存关系.至少，这涵盖了多单词表达式(MWE)和命名实体.这也可以提高依赖性解析期间的准确性(尤其是将命名实体作为一个令牌分组).

You can group the words in one token, so you can get phrase-level dependency. At the very least, this covers multi-word expressions (MWE) and named-entities. This can also increase the accuracy (particularly for grouping named-entities as one token) during dependency parsing.

在您的示例中，将确定子分组在一起，我认为您可以对它们进行后处理.获取依赖关系分析树后，可以将"the"添加到"accident".您可以根据需要从组成分析树中建立它，

In your example, on determiners being grouped together, what I think you can do is to post-process them. After getting the dependency parse tree , you can add "the" to "accident". You can base it from the constituent parse tree if you want,

(NP (DT The) (NN accident))

查看属于相同名词短语或其他短语的那些短语.不太确定这将是有用的，还是不确定此方法可能会引起什么问题.您可以使用斯坦福解析器(

looking at those that belongs to the same noun phrase or other phrases. Not quite sure how this will be useful, or what issues may arise from this approach. You can do some experiments using Stanford parser (demo).

这篇关于使用Java，nlp的Pharse级依赖解析器的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！