Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

word2vec Binary Index & Locally-Sensitive Hashing Module #10

Open
GoogleCodeExporter opened this issue Apr 21, 2015 · 2 comments
Open

Comments

@GoogleCodeExporter
Copy link

Just released a Ruby module that builds an index of a binary word2vec vector 
file, so your code can seek directly to the right position in the file for a 
given word or term. For example, the word "/en/italy" in the English 
"freebase-vectors-skipgram1000-en.bin" file is at byte position 116414 position.

The module also computes a locally-sensitive hash for each vector in a binary 
word2vec file, so you can do a nearest neighbor search (i.e. cosine distance) 
much faster. I get a couple orders of magnitude better performance on my 
machine, with a 10 bit random projection LSH.

https://github.com/someben/treebank/blob/master/src/build_word2vec_index.rb

Thanks for the project, Tomas.

Best,
Ben

Original issue reported on code.google.com by [email protected] on 23 Sep 2013 at 3:48

@GoogleCodeExporter
Copy link
Author

Sounds cool, thanks for sharing your code! By the way, there is a discussion 
forum related to word2vec that might be more suitable for this type of post:

https://groups.google.com/forum/#!forum/word2vec-toolkit

It might be easier for the others to find your post there.

Best,
Tomas

Original comment by [email protected] on 23 Sep 2013 at 5:01

@GoogleCodeExporter
Copy link
Author

Ahh, of course -- I've re-posted there.

Original comment by [email protected] on 23 Sep 2013 at 5:09

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant