公开(公告)号：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

IPC: G06F17/30 ,  G06Q50/00 ,  G06F17/27

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.

公开(公告)号：US10102273B2

公开(公告)日：2018-10-16

申请号：US14585782

申请日：2014-12-30

Applicant: Facebook, Inc.

Inventor： Russell Lee-Goldman ,  Kurchi Subhra Hazra

IPC: G06Q30/02 ,  G06F17/30

Abstract: In one embodiment, a method includes accessing a post of an online social network, extracting keywords from the content of the first post and the metadata associated with the first post, determining topics associated with each extracted keyword, calculating a topic-score based on a relevance of the topic to the post for each topic, generating a suggested keyword query corresponding to the post, the suggested keyword query comprising extracted keywords corresponding to each topic having a topic-score greater than a threshold topic-score, and sending the post and the suggested keyword query to a client device of a first user for display.

公开(公告)号：US10706481B2

公开(公告)日：2020-07-07

申请号：US15454716

申请日：2017-03-09

Applicant: Facebook, Inc.

Inventor： Maxime Boucher ,  Russell Lee-Goldman ,  Kathryn Hymes ,  Martin Jean Raison

IPC: G06F17/00 ,  G06F7/00 ,  G06Q50/00 ,  G06F16/248 ,  G06F16/242 ,  G06F16/9535 ,  G06F16/2457 ,  G06F16/9032 ,  G06Q30/02

Abstract: In one embodiment, a method includes scoring a set of content objects based on one or more user-engagement factors, identifying one or more related content objects, wherein each related content objects is connected within the online social network to one or more content objects of the set of content objects having a score greater than a threshold score, generating a plurality of structured queries that each comprise references to one or more content objects, wherein at least one of the structured queries is a personalized query comprising a reference to at least one of the related content objects, and sending instructions to a client device for presenting one or more of the generated structured queries to a first user for display on an interface currently accessed by the first user, wherein at least one of the sent structured queries is a personalized query.

公开(公告)号：US20170270126A1

公开(公告)日：2017-09-21

申请号：US15610287

申请日：2017-05-31

Applicant: Facebook, Inc.

Inventor： Maxime Boucher ,  Xiao Li ,  Alexander Perelygin ,  Veselin S. Stoyanov ,  Russell Lee-Goldman ,  Necip Fazil Ayan

IPC: G06F17/30

CPC classification number: G06F16/3322 ,  G06F16/90324

Abstract: In one embodiment, a method includes receiving, from a client system of a first user, a text query including one or more n-grams, including an ambiguous n-gram. The method includes searching multiple keyword generators to identify one or more keyword suggestions matching the ambiguous n-gram, each keyword generator having a particular type. The method includes calculating, by a particular scoring algorithm for each keyword generator, a keyword score for each identified keyword suggestion. The scoring algorithm includes multiple weighting factors chosen based on the type of the keyword generator. The method includes generating a set of suggested queries including at least a portion of the text query and one or more identified keyword suggestions and filtering suggested queries from the set based on privacy settings associated with the identified keyword suggestions. The method includes sending, to the client system, instructions for presenting one or more of the suggested queries.

公开(公告)号：US20160203238A1

公开(公告)日：2016-07-14

申请号：US14592988

申请日：2015-01-09

Applicant: Facebook, Inc.

Inventor： Ilia Cherniavskii ,  Alexander Perelygin ,  Russell Lee-Goldman

IPC: G06F17/30

CPC classification number: G06F16/90332 ,  G06F16/2228 ,  G06F16/23 ,  G06F16/24575 ,  G06F16/3322 ,  G06F16/90324 ,  G06F16/9535

Abstract: In one embodiment, a method includes receiving a text query to search for news-posts of the online social network. The method includes parsing the text query to identify one or more n-grams. The method includes searching an index of keyword phrases to identify one or more keyword phrases matching one or more of the n-grams of the text query. Each of the identified keyword phrases is news-related. The method includes calculating a news-score for each of the identified keyword phrases. The method includes generating one or more suggested queries. Each suggested query includes one or more n-grams identified form the text query and one or more identified keyword phrases having a news-score greater than a threshold news-score. The method includes sending one or more of the suggested queries to search for news-posts of the online social network.

Abstract translation: 在一个实施例中，一种方法包括接收文本查询以搜索在线社交网络的新闻帖子。 该方法包括解析文本查询以识别一个或多个n克。 该方法包括搜索关键词短语的索引以识别匹配文本查询的一个或多个n克的一个或多个关键词短语。 每个识别的关键词短语都是新闻相关的。 该方法包括计算每个所识别的关键词短语的新闻得分。 该方法包括生成一个或多个建议的查询。 每个建议的查询包括从文本查询中识别的一个或多个n-gram，以及具有新闻得分大于阈值新闻得分的一个或多个识别的关键词短语。 该方法包括发送一个或多个建议的查询以搜索在线社交网络的新闻。

公开(公告)号：US20160063093A1

公开(公告)日：2016-03-03

申请号：US14470607

申请日：2014-08-27

Applicant: Facebook, Inc.

Inventor： Maxime Boucher ,  Xiao Li ,  Alexander Perelygin ,  Veselin S. Stoyanov ,  Russell Lee-Goldman ,  Necip Fazil Ayan

IPC: G06F17/30

CPC classification number: G06F17/3064 ,  G06F17/3097

Abstract: In one embodiment, a method includes receiving from a client system of a first user an unstructured text query. The method includes parsing the text query to identify one or more n-grams. At least one of the n-grams is an ambiguous n-gram. The method includes searching a plurality of keyword generators to identify one or more keyword suggestions matching the ambiguous n-gram. The method further includes calculating a keyword score for each identified keyword suggestions and generating one or more suggested queries including one or more n-grams identified from the text query. The one or more identified keyword suggestions having a keyword score greater than a threshold keyword score. The method includes sending one or more of the suggested queries to the client system of the first user for display.

Abstract translation: 在一个实施例中，一种方法包括从客户端系统接收第一用户非结构化文本查询。 该方法包括解析文本查询以识别一个或多个n克。 n克中至少有一个是不明确的n-gram。 该方法包括搜索多个关键字生成器以识别与模糊n-gram匹配的一个或多个关键字建议。 该方法还包括计算每个识别的关键字建议的关键词分数，并且生成包括从文本查询识别的一个或多个n克的一个或多个建议查询。 所述一个或多个识别的关键字建议具有大于阈值关键词得分的关键词得分。 该方法包括将一个或多个建议的查询发送到第一用户的客户端系统以进行显示。

公开(公告)号：US20140344265A1

公开(公告)日：2014-11-20

申请号：US14449291

申请日：2014-08-01

Applicant: Facebook, Inc.

Inventor： Maxime Boucher ,  Russell Lee-Goldman ,  Kathryn Hymes ,  Martin Jean Raison

IPC: G06F17/30

CPC classification number: G06Q50/01 ,  G06F17/30392 ,  G06F17/30398 ,  G06F17/30528 ,  G06F17/3053 ,  G06F17/30554 ,  G06F17/30867 ,  G06Q30/02 ,  G06Q30/0277

Abstract: In one embodiment, a method includes accessing a social graph that includes a plurality of nodes and edges. A first node corresponds to a first user associated with an online social network and second nodes correspond to a concept or a second user. The method further comprises scoring a first set of nodes of the second nodes based on user-engagement factors. The method further comprises identifying common nodes that are connected by edges to nodes of the first set of nodes that have a score greater than a threshold score. The method further comprises generating structured queries and sending the structured queries to the user, the sent structured queries being a personalized query.

Abstract translation: 在一个实施例中，一种方法包括访问包括多个节点和边缘的社交图。 第一节点对应于与在线社交网络相关联的第一用户，第二节点对应于概念或第二用户。 该方法还包括基于用户参与因素对第二节点的第一组节点进行评分。 该方法还包括将边缘连接的第一组节点的节点的共同节点识别为具有大于阈值分数的分数。 该方法还包括生成结构化查询并将结构化查询发送给用户，所发送的结构化查询是个性化查询。

公开(公告)号：US09703859B2

公开(公告)日：2017-07-11

申请号：US14470607

申请日：2014-08-27

Applicant: Facebook, Inc.

Inventor： Maxime Boucher ,  Xiao Li ,  Alexander Perelygin ,  Veselin S. Stoyanov ,  Russell Lee-Goldman ,  Necip Fazil Ayan

IPC: G06F17/30

CPC classification number: G06F17/3064 ,  G06F17/3097

Abstract: In one embodiment, a method includes receiving from a client system of a first user an unstructured text query. The method includes parsing the text query to identify one or more n-grams. At least one of the n-grams is an ambiguous n-gram. The method includes searching a plurality of keyword generators to identify one or more keyword suggestions matching the ambiguous n-gram. The method further includes calculating a keyword score for each identified keyword suggestions and generating one or more suggested queries including one or more n-grams identified from the text query. The one or more identified keyword suggestions having a keyword score greater than a threshold keyword score. The method includes sending one or more of the suggested queries to the client system of the first user for display.

公开(公告)号：US20170178254A1

公开(公告)日：2017-06-22

申请号：US15454716

申请日：2017-03-09

Applicant: Facebook, Inc.

Inventor： Maxime Boucher ,  Russell Lee-Goldman ,  Kathryn Hymes ,  Martin Jean Raison

IPC: G06Q50/00 ,  G06F17/30

CPC classification number: G06Q50/01 ,  G06F16/2423 ,  G06F16/2428 ,  G06F16/24575 ,  G06F16/24578 ,  G06F16/248 ,  G06F16/90324 ,  G06F16/9535 ,  G06Q30/02 ,  G06Q30/0277

Abstract: In one embodiment, a method includes scoring a set of content objects based on one or more user-engagement factors, identifying one or more related content objects, wherein each related content objects is connected within the online social network to one or more content objects of the set of content objects having a score greater than a threshold score, generating a plurality of structured queries that each comprise references to one or more content objects, wherein at least one of the structured queries is a personalized query comprising a reference to at least one of the related content objects, and sending instructions to a client device for presenting one or more of the generated structured queries to a first user for display on an interface currently accessed by the first user, wherein at least one of the sent structured queries is a personalized query.

公开(公告)号：US09633121B2

公开(公告)日：2017-04-25

申请号：US14449291

申请日：2014-08-01

Applicant: Facebook, Inc.

Inventor： Maxime Boucher ,  Russell Lee-Goldman ,  Kathryn Hymes ,  Martin Jean Raison

IPC: G06F17/30 ,  G06F7/00 ,  G06Q50/00 ,  G06Q30/02

CPC classification number: G06Q50/01 ,  G06F17/30392 ,  G06F17/30398 ,  G06F17/30528 ,  G06F17/3053 ,  G06F17/30554 ,  G06F17/30867 ,  G06Q30/02 ,  G06Q30/0277

Abstract: In one embodiment, a method includes accessing a social graph that includes a plurality of nodes and edges. A first node corresponds to a first user associated with an online social network and second nodes correspond to a concept or a second user. The method further comprises scoring a first set of nodes of the second nodes based on user-engagement factors. The method further comprises identifying common nodes that are connected by edges to nodes of the first set of nodes that have a score greater than a threshold score. The method further comprises generating structured queries and sending the structured queries to the user, the sent structured queries being a personalized query.