title: Java CoreNLP and word dependency tree
body: <p>Say I have two list of words.
  The first list is: [&quot;fixed&quot;, &quot;solved&quot;]
  and the second list is: [&quot;bug&quot;, &quot;issue&quot;]</p>
  <p>I am trying to detect if in a given sentence, a relation exist between the first list and the second.
  For example, &quot;She had fixed the most annoying bug&quot;.</p>
  <p>Here, the verb 'fixed' refers to the noun 'bug'. That would mean a relation is found between the two list. So far, I was able to draw a tree like this:</p>
  <p><code>(S (NP (PRP She)) (VP (VBD had) (VP (VBN fixed) (NP (DT the) (ADJP (RBS most) (JJ annoying)) (NN bug))))) </code></p>
  <p>How do I now find the relation in Java with the coreNLP library?</p>