Yves Jaradin wrote:
Here is a (possibly) more elegant solution using a nested search and constraints rather than pure logic programming. It doesn't scale well to big dictionaries because it only use their first letter to decide whether to try to match them or not but this can be improved.
Thanks very much for taking the trouble to produce this constraint-based alternative, Yves - it looks like a very interesting approach, and I will be studying it in depth...
I am after all looking for the best way of doing it in _Oz_ (if it's concurrent, so much the better), regardless of paradigm.
Best Alex _________________________________________________________________________________ mozart-users mailing list [email protected] http://www.mozart-oz.org/mailman/listinfo/mozart-users
