* Peter Lavender ([EMAIL PROTECTED]) wrote: Not great replying to yourself, but just for the archive:
> I've been thinking about this for a little while now, but haven't hit on a > suitable solution. > > The DSA I'm querying allows an approximate search, which uses a synonym > lookup. So as an example, if I search for Jim, Jim can also be known as > James, Jamie, Jimmy. What we did in the end was using the sorted method on the search, it returns a list of entries. So effectively what we now do is test the value in the entry does match the original search, and then a second interation over the array testing for the entries that don't match. It works. Might not be optimal though. Pete :wq
