[Corpora-List] Feature structures unification algorithm

Rob Malouf rmalouf at mail.sdsu.edu
Wed Feb 20 17:21:47 CET 2008


There's a basic implementation of a no-frills unifier in python as part of nltk:


and there's a much fancier one in LISP that's part of the LKB:


Neither are in C/C++, but they are pretty straightforward procedural implementations, so they should be pretty easy to translate (unlike a prolog version...)

--- Rob Malouf <rmalouf at mail.sdsu.edu> Department of Linguistics and Asian/Middle Eastern Languages San Diego State University

On Feb 20, 2008, at 8:00 AM, Ken Litkowski wrote:

> Can anyone point me to a C or C++ implementation of the standard
> unification algorithm, perhaps with an occur check and other
> extensions
> noted in the literature (path inequalities, negation, set-valued
> features, disjunction). The implementations I've seen (which all
> appear
> to be quite dated) seem to be in Prolog, where I believe the nature of
> the language itself is exploited in the unification process. It is
> not
> necessary for me that this code be publicly available.
> Ken
> --
> Ken Litkowski TEL.: 301-482-0237
> CL Research EMAIL: ken at clres.com
> 9208 Gue Road
> Damascus, MD 20872-1025 USA Home Page: http://www.clres.com
> _______________________________________________
> Corpora mailing list
> Corpora at uib.no
> http://mailman.uib.no/listinfo/corpora

More information about the Corpora mailing list