{"action":"created","issue":{"url":"https://api.github.com/repos/facebookresearch/fastText/issues/533","repository_url":"https://api.github.com/repos/facebookresearch/fastText","labels_url":"https://api.github.com/repos/facebookresearch/fastText/issues/533/labels{/name}","comments_url":"https://api.github.com/repos/facebookresearch/fastText/issues/533/comments","events_url":"https://api.github.com/repos/facebookresearch/fastText/issues/533/events","html_url":"https://github.com/facebookresearch/fastText/issues/533","id":327396139,"node_id":"MDU6SXNzdWUzMjczOTYxMzk=","number":533,"title":"N-gram synonym prediction","user":{"login":"AnshulBasia","id":12856392,"node_id":"MDQ6VXNlcjEyODU2Mzky","avatar_url":"https://avatars3.githubusercontent.com/u/12856392?v=4","gravatar_id":"","url":"https://api.github.com/users/AnshulBasia","html_url":"https://github.com/AnshulBasia","followers_url":"https://api.github.com/users/AnshulBasia/followers","following_url":"https://api.github.com/users/AnshulBasia/following{/other_user}","gists_url":"https://api.github.com/users/AnshulBasia/gists{/gist_id}","starred_url":"https://api.github.com/users/AnshulBasia/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/AnshulBasia/subscriptions","organizations_url":"https://api.github.com/users/AnshulBasia/orgs","repos_url":"https://api.github.com/users/AnshulBasia/repos","events_url":"https://api.github.com/users/AnshulBasia/events{/privacy}","received_events_url":"https://api.github.com/users/AnshulBasia/received_events","type":"User","site_admin":false},"labels":[],"state":"closed","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":1,"created_at":"2018-05-29T16:25:51Z","updated_at":"2018-06-08T20:57:16Z","closed_at":"2018-06-08T20:57:16Z","author_association":"NONE","body":"If I were to get an n-gram synonym to a word, can I do that using fast text? For example, I want to predict \"go along\" for the word \"following\"."},"comment":{"url":"https://api.github.com/repos/facebookresearch/fastText/issues/comments/395888096","html_url":"https://github.com/facebookresearch/fastText/issues/533#issuecomment-395888096","issue_url":"https://api.github.com/repos/facebookresearch/fastText/issues/533","id":395888096,"node_id":"MDEyOklzc3VlQ29tbWVudDM5NTg4ODA5Ng==","user":{"login":"EdouardGrave","id":10478219,"node_id":"MDQ6VXNlcjEwNDc4MjE5","avatar_url":"https://avatars0.githubusercontent.com/u/10478219?v=4","gravatar_id":"","url":"https://api.github.com/users/EdouardGrave","html_url":"https://github.com/EdouardGrave","followers_url":"https://api.github.com/users/EdouardGrave/followers","following_url":"https://api.github.com/users/EdouardGrave/following{/other_user}","gists_url":"https://api.github.com/users/EdouardGrave/gists{/gist_id}","starred_url":"https://api.github.com/users/EdouardGrave/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/EdouardGrave/subscriptions","organizations_url":"https://api.github.com/users/EdouardGrave/orgs","repos_url":"https://api.github.com/users/EdouardGrave/repos","events_url":"https://api.github.com/users/EdouardGrave/events{/privacy}","received_events_url":"https://api.github.com/users/EdouardGrave/received_events","type":"User","site_admin":false},"created_at":"2018-06-08T20:57:16Z","updated_at":"2018-06-08T20:57:16Z","author_association":"MEMBER","body":"Hi @AnshulBasia,\r\n\r\nOne solution for this problem is to also learn representations for phrases, following the method described in the paper [Distributed Representations of Words and Phrases and their Compositionality](http://papers.nips.cc/paper/5021-distributed-representations-of-words-and-phrases-and-their-compositionality.pdf), by using the word2phrase tool. I would advise to not use subwords in that case, by using the command line option `-maxn 0`.\r\n\r\nBest,\r\nEdouard"}}
{"actor":{"display_login":"EdouardGrave"}}