We lifted 2 functions out of this paper's own repositories and ran 2 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| LouisTernon/NLP | reimplementation | 2 of 2 |
| Function | Status | Where it lives |
|---|---|---|
| loadPairs | Ran | LouisTernon/NLP/skipGram.py pointer only (licence: NONE) · get_code("24b8995c9efdcdb7") |
| text2sentences | Ran | LouisTernon/NLP/skipGram.py pointer only (licence: NONE) · get_code("375693019fa03226") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
The word2vec software of Tomas Mikolov and colleagues (https://code.google.com/p/word2vec/ ) has gained a lot of traction lately, and provides state-of-the-art word embeddings. The learning models behind the software are described in two research papers. We found the description of the models in these papers to be somewhat cryptic and hard to follow. While the motivations and presentation may be obvious to the neural-networks language-modeling crowd, we had to struggle quite a bit to figure out the rationale behind the equations. This note is an attempt to explain equation (4) (negative sampling) in "Distributed Representations of Words and Phrases and their Compositionality" by Tomas Mikolov, Ilya Sutskever, Kai Chen, Greg Corrado and Jeffrey Dean.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1402.3722")
get_code_for_paper("1402.3722")
have("1402.3722")
Connect an agent — have() is free.