0
$\begingroup$

I would like to implement fuzzy search based on Bloom Filter and LSH hashing.

The problem is that:

I have found almost ready package to get ngrams from words, now I don't know how to generate vector from this unigrams. For example, based on English alphabet's index. For example, 'd' is the 4th in alphabet and the corresponding 4th bit will be set to 1, others will be setted to 0. for example word "diabetic" has unigrams of {'d', 'i', 'a',...} so on.

I am new in this field so I am sorry if I didn't explain this clear enough.

My question is about generate bit vector (ex. 1010001001) to apply LSH hashing for that.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.