On 6/6/07, galo <[EMAIL PROTECTED]> wrote:
3. I'm trying to implement another index where I store a number of int
values for each document. Everything works ok as integers but i'd like
to have some sort of fuzzy searches based on the bit representation of
the numbers. Essentially, this number:

1001001010100

would be compared to these two

1011001010100
1001001010111

And the first would get a bigger score than the second, as it has only 1
flipped bit while the second has 2.

You could store the numbers as a string field with the binary representation,
then try a fuzzy search.

 myfield:1001001010100~

-Yonik

Reply via email to