-
公开(公告)号:US09679080B2
公开(公告)日:2017-06-13
申请号:US14752407
申请日:2015-06-26
Applicant: Facebook, Inc.
Inventor: Yofay Kari Lee , Michael Benjamin Cohen , Maxime Boucher , Alisson Gusatti Azzolini , Xiao Li , Lars Eilstrup Rasmussen , Kathryn Hymes , Amy Campbell
CPC classification number: G06F17/3097 , G06F17/274 , G06F17/3053 , G06F17/30604 , G06F17/30634 , G06F17/30867 , G06F17/3087 , G06F17/30958 , G06Q50/01
Abstract: In one embodiment, a method includes accessing a social graph that includes a plurality of nodes and edges, receiving an unstructured text query, identifying nodes and edges that correspond to n-grams of the text query, accessing a context-free grammar model, identifying grammars having query tokens that correspond to the identified nodes and edges, determining a score for each identified grammar, and then generating structured queries based on the identified grammars based on strings generated by the grammars.
-
公开(公告)号:US20160042069A1
公开(公告)日:2016-02-11
申请号:US14455798
申请日:2014-08-08
Applicant: FACEBOOK, INC.
Inventor: Russell Lee-Goldman , Lada Ariana Adamic , David M. Goldblatt , Yuval Kesten , Mark Andrew Rich , Nidhi Gupta , Amy Campbell , Andrew Rocco Tresolini Fiore
IPC: G06F17/30
CPC classification number: G06F17/30864 , G06F17/278 , G06F17/3043 , G06Q50/00
Abstract: In one embodiment, a method includes receiving unstructured text from a user of a social-networking system, determining whether the unstructured text includes a request for a recommendation, identifying one or more first entity names in the unstructured text, generating a structured query based upon the one or more first entity names, identifying, in the social graph, one or more second entity names corresponding to the structured query, and presenting the one or more second entity names and the unstructured text in a social context of the user. The unstructured text may include text of a post or message generated by the user on a social-networking system. A score may be generated based on the unstructured text to determine whether the text includes a request for recommendation using a machine-learning model based on comparison of the unstructured text to the one or more predetermined words associated with requests for recommendation.
Abstract translation: 在一个实施例中,一种方法包括从社交网络系统的用户接收非结构化文本,确定非结构化文本是否包括对推荐的请求,识别非结构化文本中的一个或多个第一实体名称,基于 所述一个或多个第一实体名称在所述社交图中标识与所述结构化查询相对应的一个或多个第二实体名称,以及在所述用户的社会环境中呈现所述一个或多个第二实体名称和所述非结构化文本。 非结构化文本可以包括用户在社交网络系统上生成的帖子或消息的文本。 可以基于非结构化文本来生成分数,以基于非结构化文本与与推荐请求相关联的一个或多个预定单词的比较来确定文本是否包括使用机器学习模型的推荐请求。
-
公开(公告)号:US10127316B2
公开(公告)日:2018-11-13
申请号:US14455798
申请日:2014-08-08
Applicant: Facebook, Inc.
Inventor: Russell Lee-Goldman , Lada Ariana Adamic , David M. Goldblatt , Yuval Kesten , Mark Andrew Rich , Nidhi Gupta , Amy Campbell , Andrew Rocco Tresolini Fiore
Abstract: In one embodiment, a method includes receiving unstructured text from a user of a social-networking system, determining whether the unstructured text includes a request for a recommendation, identifying one or more first entity names in the unstructured text, generating a structured query based upon the one or more first entity names, identifying, in the social graph, one or more second entity names corresponding to the structured query, and presenting the one or more second entity names and the unstructured text in a social context of the user. The unstructured text may include text of a post or message generated by the user on a social-networking system. A score may be generated based on the unstructured text to determine whether the text includes a request for recommendation using a machine-learning model based on comparison of the unstructured text to the one or more predetermined words associated with requests for recommendation.
-
公开(公告)号:US20170220590A1
公开(公告)日:2017-08-03
申请号:US15489027
申请日:2017-04-17
Applicant: Facebook, Inc.
Inventor: Yofay Kari Lee , Michael Benjamin Cohen , Maxime Boucher , Alisson Gusatti Azzolini , Xiao Li , Lars Eilstrup Rasmussen , Kathryn Hymes , Amy Campbell
CPC classification number: G06F16/90324 , G06F16/24578 , G06F16/288 , G06F16/33 , G06F16/9024 , G06F16/9535 , G06F16/9537 , G06F17/274 , G06Q50/01
Abstract: In one embodiment, a method includes receiving a text query inputted by a first user, identifying objects associated with the online social network, each identified object having a name string matching at least in part a portion of the text query, determining a probability score for each identified object that the identified object corresponds to a respective portion of the text query, selecting one or more of the identified objects based on the probability score of the identified object, identifying one or more grammars of a grammar model, each identified grammar having query tokens corresponding to at least one of the selected objects, and sending instructions for presenting suggested queries to the first user, each suggested query comprising the text string, a query token corresponding to one of the selected objects, and one or more additional query tokens of the identified grammar corresponding to the respective selected object.
-
公开(公告)号:US20150293931A1
公开(公告)日:2015-10-15
申请号:US14752407
申请日:2015-06-26
Applicant: Facebook, Inc.
Inventor: Yofay Kari Lee , Michael Benjamin Cohen , Maxime Boucher , Alisson Gusatti Azzolini , Xiao Li , Lars Eilstrup Rasmussen , Kathryn Hymes , Amy Campbell
IPC: G06F17/30
CPC classification number: G06F17/3097 , G06F17/274 , G06F17/3053 , G06F17/30604 , G06F17/30634 , G06F17/30867 , G06F17/3087 , G06F17/30958 , G06Q50/01
Abstract: In one embodiment, a method includes accessing a social graph that includes a plurality of nodes and edges, receiving an unstructured text query, identifying nodes and edges that correspond to n-grams of the text query, accessing a context-free grammar model, identifying grammars having query tokens that correspond to the identified nodes and edges, determining a score for each identified grammar, and then generating structured queries based on the identified grammars based on strings generated by the grammars.
Abstract translation: 在一个实施例中,一种方法包括访问包括多个节点和边缘的社交图,接收非结构化文本查询,识别对应于文本查询的n-gram的节点和边缘,访问无上下文的语法模型,识别 具有对应于所识别的节点和边缘的查询令牌的语法,确定每个识别的语法的分数,然后基于基于由语法生成的字符串的所识别的语法生成结构化查询。
-
-
-
-