It seems to me that the really best way to do this type of searching would be to use
the XML version of the CHILDES database and to write XQuery search strings. One reason for this
is that the identity of the ROOT as a verb is directly available in the XML for each word. Admittedly the root
is usually the verb anyway, but that would make things a bit more reliable. However, the
big issue is the one you mention in the bottom of your message.
You don't really want to be depending on the numbers to guide this
search. For example 1|0|ROOT^2|1|OBJ is the same for your purposes as 2|0|ROOT^3|2|OBJ.
So, you just want to find string where the OBJ has a pointer that matches the serial number of
the ROOT. To do this you would want variables in a search string.
I have never done this myself and we have not yet configured any of our XML search facilities to
do this, but it seems to me that this is the right approach in the long run. Franklin Chen has
been writing some stuff of this type. If you know how to program, you could tackle this or perhaps
get some help. It is certainly an interesting and very general problem. I am copying to
a few other people who may also find this interesting.
-- Brian MacWhinney
> --
> You received this message because you are subscribed to the Google Groups "chibolts" group.
> To post to this group, send email to chib...@googlegroups.com.
> To unsubscribe from this group, send email to chibolts+u...@googlegroups.com.
> For more options, visit this group at http://groups.google.com/group/chibolts?hl=en.
>
>