Dear John Machin
So sorry about the typo. It should be: "the program should *see* that
the designated *words* are..."
"a long way" has two parentheses to the left -- (VP (DT -- before it
hits a separate group -- VBD came). If there are three parenthesis,
for instance (NP, this will means that wha
On Apr 17, 8:22 am, John Machin wrote:
> On 17/04/2009 7:32 PM, Clarendon wrote:
>
> > Dear John Machin
>
> I presume that you replied to me instead of the list accidentally.
>
>
>
> > So sorry about the typo. It should be: "the program should *see* that
> > the designated *words* are..."
>
> > "a
On 17/04/2009 7:32 PM, Clarendon wrote:
Dear John Machin
I presume that you replied to me instead of the list accidentally.
So sorry about the typo. It should be: "the program should *see* that
the designated *words* are..."
"a long way" has two parentheses to the left -- (VP (DT -- before
On Apr 17, 4:03 am, Clarendon wrote:
> Thank you very much for this information. It seems to point me to the
> right direction. However, I do not fully understand the flatten
> function and its output. Some indices seem to be inaccurate. I tried
> to find this function at nltk.tree.Tree.flatten, b
Thank you very much for this information. It seems to point me to the
right direction. However, I do not fully understand the flatten
function and its output. Some indices seem to be inaccurate. I tried
to find this function at nltk.tree.Tree.flatten, but it returns a
flattened tree, not a tuple.
On Apr 16, 10:16 pm, John Machin wrote:
> On Apr 17, 8:55 am, Clarendon wrote:
>
>
>
> > Hello!
>
> > I need a program that accesses a parse tree based on the designated
> > words (terminals) within the tree. For instance, in:
>
> > I came a long way in changing my habit.
>
> > (ROOT
> > (S
> >
On Apr 17, 8:55 am, Clarendon wrote:
> Hello!
>
> I need a program that accesses a parse tree based on the designated
> words (terminals) within the tree. For instance, in:
>
> I came a long way in changing my habit.
>
> (ROOT
> (S
> (NP (PRP I))
> (VP (VBD came)
> (NP (DT a) (JJ l
Hello!
I need a program that accesses a parse tree based on the designated
words (terminals) within the tree. For instance, in:
I came a long way in changing my habit.
(ROOT
(S
(NP (PRP I))
(VP (VBD came)
(NP (DT a) (JJ long) (NN way))
(PP (IN in)
(S
(VP (
