Take the 2-minute tour ×

I want to extract the complete relationship between two entities using Stanford CoreNLP (or maybe other tools).

For example:

Windows is more popular than Linux.

This tool requires Java.

Football is the most popular game in the World.

What is the fastest way? And what is the best practice for that?

Thanks in advance

share|improve this question

3 Answers 3

up vote 3 down vote accepted

You are probably looking for dependency relations between nouns. Stanford Parser provides such output. Have a look here. You can combine what Pete said (i.e. the POS graph) with the dependency graph to identify what relationship (for example, direct object or nominal subject, etc.) a pair of nouns (or noun phrases) share.

share|improve this answer

ReVerb focuses on Open IE. You can start by reading their paper "Identifying Relations for Open Information Extraction" and checking the demo site.

share|improve this answer

So you are looking for the verb phrase that links noun phrases. That is actually dead simple in Stanford CoreNLP. Just run it through the pipeline and traverse the POS graph to get what you want. You will have to come up with ways of handling complex sentences and of course you will want to use the co-reference system to deal with anaphora.

It is non-trivial so can you break your question down somewhat to a question that can be answered? If your question is, is this possible to do? Then the answer is yes. If it is "how can I do it?" then I suggest you start using the system and answer that question yourself.

share|improve this answer
What do you call a POS graph? –  mbatchkarov Dec 15 '12 at 21:34
(ROOT (S (NP (PRP$ My) (NN dog)) (ADVP (RB also)) (VP (VBZ likes) (S (VP (VBG eating) (S (ADJP (NNS bananas)))))) (. .))) –  Pete Mancini Dec 17 '12 at 21:10
Isn't that a parse tree? –  mbatchkarov Dec 18 '12 at 13:22

Your Answer


