Java Reference
In-Depth Information
However, there may be more than one way of parsing a sentence. Parsing is difficult be-
cause it is necessary to handle a wide range of text where many ambiguities may exist.
The following output illustrates other possible dependency trees for the previous example
sentence. The tree was generated using OpenNLP, as will be demonstrated in the
Using
OpenNLP
section later in the chapter:
(TOP (S (NP (DT The) (NN cow)) (VP (VBD jumped) (PP (IN
over) (NP (DT the) (NN moon))))))
(TOP (S (NP (DT The) (NN cow)) (VP (VP (VBD jumped) (PRT
(RP over))) (NP (DT the) (NN moon)))))
(TOP (S (NP (DT The) (NNS cow)) (VP (VBD jumped) (PP (IN
over) (NP (DT the) (NN moon))))))
