中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

30 records (took 0.036 seconds)

    Search Result Snippets for Structured Search Queries
    12.
    发明申请
    Search Result Snippets for Structured Search Queries 审中-公开

    公开(公告)号：US20170262514A1

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

    申请号：US15608759

    申请日：2017-05-30

    Applicant: Facebook, Inc.

    Inventor： Craig S. Campbell ,  Lars Eilstrup Rasmussen ,  Keith Peiris

    IPC: G06F17/30 ,  G06Q50/00

    CPC classification number: G06F16/248 ,  G06F16/24522 ,  G06F16/24575 ,  G06F17/271 ,  G06Q50/01

    Abstract: In one embodiment, a method includes receiving, from a client system of a first user of an online social network, a first structured query comprising a natural-language string generated by a context-free grammar model and references to one or more objects associated with the online social network; identifying one or more objects associated with the online social network matching the first structured query; and sending, to the client system, instructions for presenting a search-results interface comprising one or more of the search results corresponding to one or more of the identified objects, respectively, each search result comprising one or more snippets, each snippet comprising contextual information about the identified object corresponding to the search result, wherein at least one of the snippets of each search result comprises one or more references to the one or more objects referenced in the first structured query.

    DETERMINING VISIBILITY OF GROUP CONTENT TO A USER BASED ON INFERRED CONNECTIONS BETWEEN USERS OF AN ONLINE SYSTEM
    13.
    发明申请
    DETERMINING VISIBILITY OF GROUP CONTENT TO A USER BASED ON INFERRED CONNECTIONS BETWEEN USERS OF AN ONLINE SYSTEM 审中-公开

    公开(公告)号：US20170237810A1

    公开(公告)日：2017-08-17

    申请号：US15046346

    申请日：2016-02-17

    Applicant: Facebook, Inc.

    Inventor： John David Egan ,  Lars Eilstrup Rasmussen ,  Fabio Lopiano

    IPC: H04L29/08

    CPC classification number: H04W4/21 ,  G06Q50/01 ,  H04L67/306

    Abstract: An online system allows users to join groups and interact with other members of group that they have joined. The online system identifies relationships between users in an organization using information about the users, such as roles and connections from an organizational chart. The online system establishes inferred connections between the users based on information from the organizational chart. The online system then determines whether to make group content visible to a user by applying visibility criteria for a group to the inferred connections between a user and members of the group, if any. Depending on this determination, groups are then made visible to certain users by presenting content associated with the group to the user.

    Ambiguous structured search queries on online social networks
    14.
    发明授权
    Ambiguous structured search queries on online social networks 有权
    在线社交网络上的模糊结构化搜索查询

    公开(公告)号：US08868603B2

    公开(公告)日：2014-10-21

    申请号：US13732101

    申请日：2012-12-31

    Applicant: Facebook, Inc.

    Inventor： Yofay Kari Lee ,  Keith L. Peiris ,  William R. Maschmeyer ,  Lars Eilstrup Rasmussen ,  Joshua Keith Duck

    IPC: G06F17/30 ,  G06Q50/00 ,  G06Q10/10

    CPC classification number: G06F17/3097 ,  G06F17/30392 ,  G06F17/30528 ,  G06F17/3064 ,  G06F17/30864 ,  G06F17/30985 ,  G06Q10/101 ,  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 comprising an ambiguous n-gram, identifying nodes and edges that correspond to the ambiguous n-gram, generating a first set of structured queries corresponding to the identified second nodes and edges, receiving from the first user a selection of a first structured query form the first set, and generating a second set of structured queries based on the selected first structured query.

    Abstract translation: 在一个实施例中，一种方法包括访问包括多个节点和边缘的社交图，接收包括不明确的n-gram的非结构化文本查询，识别对应于模糊n-gram的节点和边缘，生成第一组 与所识别的第二节点和边缘相对应的结构化查询，从第一用户接收第一集合的第一结构化查询的选择，以及基于所选择的第一结构化查询生成第二组结构化查询。

    Suggested terms for ambiguous search queries
    16.
    发明授权
    Suggested terms for ambiguous search queries 有权

    公开(公告)号：US10282377B2

    公开(公告)日：2019-05-07

    申请号：US15331563

    申请日：2016-10-21

    Applicant: Facebook, Inc.

    Inventor： Yofay Kari Lee ,  Keith L. Peiris ,  William R. Maschmeyer ,  Lars Eilstrup Rasmussen ,  Joshua Keith Duck

    IPC: G06F16/242 ,  G06F16/2457 ,  G06F16/332 ,  G06F16/903 ,  G06F16/9032 ,  G06F16/951 ,  G06Q10/10 ,  G06Q50/00

    Abstract: In one embodiment, a method includes receiving, from a client system, a character string having n characters entered by the first user into a query field, wherein a term comprising the nth character of the character string is an ambiguous term, identifying one or more objects corresponding to the ambiguous term based on a calculated probability that the ambiguous term corresponds to the identified objects, sending instructions for presenting a set of suggested queries to the first user, each suggested query from the set of suggested queries corresponding to one of the identified objects and comprising a reference to the corresponding identified object, receiving a selection of a suggested query corresponding to a first object of the identified objects, and sending, responsive to receiving the selection of the suggested query, instructions for modifying the ambiguous term in the query field to include a reference to the first object.

    Suggested Terms for Ambiguous Search Queries
    19.
    发明申请
    Suggested Terms for Ambiguous Search Queries 审中-公开
    模糊搜索查询的建议条款

    公开(公告)号：US20170039210A1

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

    申请号：US15331563

    申请日：2016-10-21

    Applicant: Facebook, Inc.

    Inventor： Yofay Kari Lee ,  Keith L. Peiris ,  William R. Maschmeyer ,  Lars Eilstrup Rasmussen ,  Joshua Keith Duck

    IPC: G06F17/30

    CPC classification number: G06F17/3097 ,  G06F17/30392 ,  G06F17/30528 ,  G06F17/3064 ,  G06F17/30864 ,  G06F17/30985 ,  G06Q10/101 ,  G06Q50/01

    Abstract: In one embodiment, a method includes receiving, from a client system, a character string having n characters entered by the first user into a query field, wherein a term comprising the nth character of the character string is an ambiguous term, identifying one or more objects corresponding to the ambiguous term based on a calculated probability that the ambiguous term corresponds to the identified objects, sending instructions for presenting a set of suggested queries to the first user, each suggested query from the set of suggested queries corresponding to one of the identified objects and comprising a reference to the corresponding identified object, receiving a selection of a suggested query corresponding to a first object of the identified objects, and sending, responsive to receiving the selection of the suggested query, instructions for modifying the ambiguous term in the query field to include a reference to the first object.

    Abstract translation: 在一个实施例中，一种方法包括从客户端系统接收具有由第一用户输入的n个字符的字符串到查询字段中，其中包括字符串的第n个字符的术语是不明确的术语，识别一个或多个 基于所计算的概率，所述歧义术语对应于所识别的对象的发送指令，向所述第一用户发送用于呈现一组建议查询的指令，所述建议查询集合与对应于所识别的一个 对象并且包括对相应的识别对象的引用，接收与所识别的对象的第一对象相对应的建议查询的选择，以及响应于接收到所建议查询的选择，发送用于修改查询中的模糊项的指令 字段以包括对第一个对象的引用。

    Detecting Social Graph Elements for Structured Search Queries
    20.
    发明申请
    Detecting Social Graph Elements for Structured Search Queries 审中-公开
    检测结构化搜索查询的社交图元素

    公开(公告)号：US20160378825A1

    公开(公告)日：2016-12-29

    申请号：US15258772

    申请日：2016-09-07

    Applicant: Facebook, Inc.

    Inventor： Yofay Kari Lee ,  Michael Benjamin Cohen ,  Maxime Boucher ,  Alisson Gusatti Azzolini ,  Xiao Li ,  Lars Eilstrup Rasmussen

    IPC: G06F17/30

    CPC classification number: G06F17/30448 ,  G06F17/30522 ,  G06F17/30528 ,  G06F17/3053 ,  G06F17/30864 ,  G06F17/30979

    Abstract: In particular embodiments, a method includes receiving, from a client device associated with a first user of an online social network, an unstructured text query, parsing the text query to identify one or more n-grams, determining a score for each n-gram, wherein the score for each n-gram is a probability that the n-gram corresponds to a particular data object of a plurality of data objects associated with the online social network, identifying one or more data objects based on the scores of their corresponding n-grams, each identified data object corresponding to at least one of the n-grams, and generating one or more structured queries that each comprise references to one or more of the identified data objects.

    Abstract translation: 在特定实施例中，一种方法包括从与在线社交网络的第一用户相关联的客户端设备接收非结构化文本查询，解析文本查询以识别一个或多个n克，确定每个n-gram的得分 其中每个n-gram的分数是n-gram对应于与在线社交网络相关联的多个数据对象的特定数据对象的概率，基于其对应的n的分数来识别一个或多个数据对象 每个识别的数据对象对应于n克中的至少一个，并且生成一个或多个结构化查询，每个结构化查询包括对所标识的一个或多个数据对象的引用。

Patent Agency Ranking