🚀 go-pugleaf

In article <1990Nov16.163342.1076@watdragon.waterloo.edu>, psmielke@lotus.uwaterloo.ca (Peter Mielke) writes:
> ok@goanna.cs.rmit.oz.au (Richard A. O'Keefe) writes:
> > What *is* the NBS/ICST Prolog utility library?
> > What's in it?
> > Where do you get it?

> Well it was a big set of utility predicates (from basic predicates,
> input/output, control, extended logic etc.) that was posted Dec 1986
> under the prolog digest (vol 4 issue 80).

That still doesn't tell me how to _get_ it.  And it doesn't really tell
me what's in it either.  Is it Lagache's library, or the DEC-10 library,
or another?  Which basic predicates &c does it contain, and for which
dialect?

> > > (i'm looking for tree matching routines)
> specifically natural language parse tree matching routines (for
> finding the obect, indirect object etc.)

Yes, but what do your parse trees look like?  Why do you need special
matching routines?  It all depends on how _you_ *chose* to represent
that something is the object, or indirect object, or whatever.  With
one representation, you might write
	subj(Sub/((V/Obj)/Iobj), Sub).
	obj( Sub/((V/Obj)/Iobj), Obj).
	iobj(Sub/((V/Obj)/Iobj), Iobj).
With another representation, you might write something entirely different.
*Everything* in Prolog is a "tree matching routine".  What does *your*
parse tree data structure look like?

-- 
I am not now and never have been a member of Mensa.		-- Ariadne.