Hi All, I have created a new package called Freenet.search in which I have started to place some files which will be nescessary for a fuzzy searching mechanism.
Some of the operators I am planning are: equals(s), and(x,y), or(x,y), not(x), contains(s) The fact that they must return smooth values rather than just true or false make the implementation of some of these interesting. As an example, equals(s) will return 1 if the string is equals, but if not it will return a value which would correspond to the lexographic similarity as with the current freenet searching mechanism (providing backward compatibility). Contains(s) will return 1 if the string contains s, and less than one in proportion to how much of s is actually contained by the larger string, until it reaches 0 if they share no characters. and, or, and not are the standard fuzzy ways of doing this (namely min, max, and 1-x respectively). If anyone has any other ideas for operators (and how they would work fuzzily) then now is the time. The main concern is to make these nice and efficient (they would be easy to implement inefficiently). Ian. _______________________________________________ Freenet-dev mailing list Freenet-dev at lists.sourceforge.net http://lists.sourceforge.net/mailman/listinfo/freenet-dev
