-
公开(公告)号：US08782080B2
公开(公告)日：2014-07-15
申请号：US13556072
申请日：2012-07-23
申请人： Yofay Kari Lee , Michael Benjamin Cohen , Maxime Boucher , Alisson Gusatti Azzolini , Xiao Li , Lars Eilstrup Rasmussen
发明人： Yofay Kari Lee , Michael Benjamin Cohen , Maxime Boucher , Alisson Gusatti Azzolini , Xiao Li , Lars Eilstrup Rasmussen
IPC分类号： G06F17/30
CPC分类号： G06F17/30448 , G06F17/30522 , G06F17/30528 , G06F17/3053 , G06F17/30864 , G06F17/30979
摘要： In particular embodiments, a method includes receiving an unstructured text query, parsing the text query to identify n-grams; determining a score that the n-grams correspond to particular nodes and edges from a social graph, identifying those nodes and edges with a score greater than a threshold score, and then generating structured queries that include references to the identified nodes and edges.
摘要翻译： 在特定实施例中，一种方法包括接收非结构化文本查询，解析文本查询以识别n克; 确定n克对应于来自社交图的特定节点和边缘的分数，识别具有大于阈值分数的分数的那些节点和边缘，然后生成包括对所识别的节点和边缘的引用的结构化查询。
-
公开(公告)号：US20130191416A1
公开(公告)日：2013-07-25
申请号：US13556072
申请日：2012-07-23
申请人： Yofay Kari Lee , Michael Benjamin Cohen , Maxime Boucher , Alisson Gusatti Azzolini , Xiao Li , Lars Eilstrup Rasmussen
发明人： Yofay Kari Lee , Michael Benjamin Cohen , Maxime Boucher , Alisson Gusatti Azzolini , Xiao Li , Lars Eilstrup Rasmussen
IPC分类号： G06F17/30
CPC分类号： G06F17/30448 , G06F17/30522 , G06F17/30528 , G06F17/3053 , G06F17/30864 , G06F17/30979
摘要： In particular embodiments, a method includes receiving an unstructured text query, parsing the text query to identify n-grams; determining a score that the n-grams correspond to particular nodes and edges from a social graph, identifying those nodes and edges with a score greater than a threshold score, and then generating structured queries that include references to the identified nodes and edges.
摘要翻译： 在特定实施例中，一种方法包括接收非结构化文本查询，解析文本查询以识别n克; 确定n克对应于来自社交图的特定节点和边缘的分数，识别具有大于阈值分数的分数的那些节点和边缘，然后生成包括对所识别的节点和边缘的引用的结构化查询。
-
公开(公告)号：US20130191372A1
公开(公告)日：2013-07-25
申请号：US13556046
申请日：2012-07-23
申请人： Yofay Kari Lee , Michael Benjamin Cohen , Maxime Boucher , Alisson Gusatti Azzolini , Xiao Li , Lars Eilstrup Rasmussen
发明人： Yofay Kari Lee , Michael Benjamin Cohen , Maxime Boucher , Alisson Gusatti Azzolini , Xiao Li , Lars Eilstrup Rasmussen
IPC分类号： G06F17/30
CPC分类号： G06F17/30867 , G06F17/30958 , G06F17/3097 , G06Q10/10 , G06Q50/01 , H04L51/32 , H04L67/306
摘要： In particular embodiments, a method includes receiving an text query, identifying nodes and edges from a social graph that correspond to character strings from the text query, and then generating recommended queries that include references to the identified nodes and edges.
摘要翻译： 在特定实施例中，一种方法包括从文本查询中接收文本查询，识别来自社交图表的对应于字符串的节点和边缘，然后生成包括对所识别的节点和边缘的引用的推荐查询。
-
公开(公告)号：US09105068B2
公开(公告)日：2015-08-11
申请号：US13674695
申请日：2012-11-12
申请人： Yofay Kari Lee , Michael Benjamin Cohen , Maxime Boucher , Alisson Gusatti Azzolini , Xiao Li , Lars Eilstrup Rasmussen , Kathryn Hymes , Amy Campbell
发明人： Yofay Kari Lee , Michael Benjamin Cohen , Maxime Boucher , Alisson Gusatti Azzolini , Xiao Li , Lars Eilstrup Rasmussen , Kathryn Hymes , Amy Campbell
CPC分类号： G06F17/3097 , G06F17/274 , G06F17/3053 , G06F17/30604 , G06F17/30634 , G06F17/30867 , G06F17/3087 , G06F17/30958 , G06Q50/01
摘要： 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.
摘要翻译： 在一个实施例中，一种方法包括访问包括多个节点和边缘的社交图，接收非结构化文本查询，识别对应于文本查询的n-gram的节点和边，访问无上下文的语法模型，识别 具有对应于所识别的节点和边缘的查询令牌的语法，确定每个识别的语法的分数，然后基于基于由语法生成的字符串的所识别的语法生成结构化查询。
-
公开(公告)号：US08751521B2
公开(公告)日：2014-06-10
申请号：US13556046
申请日：2012-07-23
申请人： Yofay Kari Lee , Michael Benjamin Cohen , Maxime Boucher , Alisson Gusatti Azzolini , Xiao Li , Lars Eilstrup Rasmussen
发明人： Yofay Kari Lee , Michael Benjamin Cohen , Maxime Boucher , Alisson Gusatti Azzolini , Xiao Li , Lars Eilstrup Rasmussen
CPC分类号： G06F17/30867 , G06F17/30958 , G06F17/3097 , G06Q10/10 , G06Q50/01 , H04L51/32 , H04L67/306
摘要： In particular embodiments, a method includes receiving an text query, identifying nodes and edges from a social graph that correspond to character strings from the text query, and then generating recommended queries that include references to the identified nodes and edges.
摘要翻译： 在特定实施例中，一种方法包括从文本查询中接收文本查询，识别来自社交图表的对应于字符串的节点和边缘，然后生成包括对所识别的节点和边缘的引用的推荐查询。
-
公开(公告)号：US08732208B2
公开(公告)日：2014-05-20
申请号：US13556060
申请日：2012-07-23
申请人： Yofay Kari Lee , Michael Benjamin Cohen , Maxime Boucher , Alisson Gusatti Azzolini , Xiao Li , Lars Eilstrup Rasmussen
发明人： Yofay Kari Lee , Michael Benjamin Cohen , Maxime Boucher , Alisson Gusatti Azzolini , Xiao Li , Lars Eilstrup Rasmussen
IPC分类号： G06F17/30
CPC分类号： G06F17/30528 , G06F17/30392 , G06F17/30401 , G06F17/3053 , G06F17/30687 , G06F17/30867 , G06F17/30958 , H04L63/105
摘要： In particular embodiments, a method includes receiving an unstructured text query, identifying nodes and edges from a social graph that correspond to n-grams in the text query, and then generating structured queries that include references to the identified nodes and edges.
摘要翻译： 在特定实施例中，一种方法包括接收非结构化文本查询，从社交图中识别与文本查询中的n-gram对应的节点和边缘，然后生成包括对所标识的节点和边缘的引用的结构化查询。
-
公开(公告)号：US20140136564A1
公开(公告)日：2014-05-15
申请号：US13674695
申请日：2012-11-12
申请人： Yofay Kari Lee , Michael Benjamin Cohen , Maxime Boucher , Alisson Gusatti Azzolini , Xiao Li , Lars Eilstrup Rasmussen , Kathryn Hymes , Amy Campbell
发明人： Yofay Kari Lee , Michael Benjamin Cohen , Maxime Boucher , Alisson Gusatti Azzolini , Xiao Li , Lars Eilstrup Rasmussen , Kathryn Hymes , Amy Campbell
IPC分类号： G06F17/30
CPC分类号： G06F17/3097 , G06F17/274 , G06F17/3053 , G06F17/30604 , G06F17/30634 , G06F17/30867 , G06F17/3087 , G06F17/30958 , G06Q50/01
摘要： 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.
摘要翻译： 在一个实施例中，一种方法包括访问包括多个节点和边缘的社交图，接收非结构化文本查询，识别对应于文本查询的n-gram的节点和边缘，访问无上下文的语法模型，识别 具有对应于所识别的节点和边缘的查询令牌的语法，确定每个识别的语法的分数，然后基于基于由语法生成的字符串的所识别的语法生成结构化查询。
-
公开(公告)号：US20130124538A1
公开(公告)日：2013-05-16
申请号：US13556060
申请日：2012-07-23
申请人： Yofay Kari Lee , Michael Benjamin Cohen , Maxime Boucher , Alisson Gusatti Azzolini , Xiao Li , Lars Eilstrup Rasmussen
发明人： Yofay Kari Lee , Michael Benjamin Cohen , Maxime Boucher , Alisson Gusatti Azzolini , Xiao Li , Lars Eilstrup Rasmussen
IPC分类号： G06F17/30
CPC分类号： G06F17/30528 , G06F17/30392 , G06F17/30401 , G06F17/3053 , G06F17/30687 , G06F17/30867 , G06F17/30958 , H04L63/105
摘要： In particular embodiments, a method includes receiving an unstructured text query, identifying nodes and edges from a social graph that correspond to n-grams in the text query, and then generating structured queries that include references to the identified nodes and edges.
摘要翻译： 在特定实施例中，一种方法包括接收非结构化文本查询，从社交图中识别与文本查询中的n-gram对应的节点和边缘，然后生成包括对所标识的节点和边缘的引用的结构化查询。
-
公开(公告)号：US20130124542A1
公开(公告)日：2013-05-16
申请号：US13732175
申请日：2012-12-31
申请人： Yofay Kari Lee , Keith L. Peiris , William R. Maschmeyer , Lars Eilstrup Rasmussen , Aaron Sittig , Craig S. Campbell
发明人： Yofay Kari Lee , Keith L. Peiris , William R. Maschmeyer , Lars Eilstrup Rasmussen , Aaron Sittig , Craig S. Campbell
IPC分类号： G06F17/30
CPC分类号： G06F17/3053 , G06F17/30392 , G06F17/30528 , G06Q30/02 , G06Q50/01 , H04L12/1813
摘要： In one embodiment, a method includes accessing a social graph that includes a plurality of nodes and edges, identifying a nodes corresponding to a page currently accessed by a first user, generating one or more structured queries, where each structured query comprises a reference to the identified node and one or more edges that are connected to the identified node, and transmitting one or more of the structured queries to the first user for display on the page.
-
公开(公告)号：US20130144899A1
公开(公告)日：2013-06-06
申请号：US13732101
申请日：2012-12-31
申请人： Yofay Kari Lee , Keith L. Peiris , William R. Maschmeyer , Lars Eilstrup Rasmussen , Joshua Keith Duck
发明人： Yofay Kari Lee , Keith L. Peiris , William R. Maschmeyer , Lars Eilstrup Rasmussen , Joshua Keith Duck
IPC分类号： G06F17/30
CPC分类号： G06F17/3097 , G06F17/30392 , G06F17/30528 , G06F17/3064 , G06F17/30864 , G06F17/30985 , G06Q10/101 , G06Q50/01
摘要： 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.
摘要翻译： 在一个实施例中，一种方法包括访问包括多个节点和边缘的社交图，接收包括不明确的n-gram的非结构化文本查询，识别对应于模糊n-gram的节点和边缘，生成第一组 与所识别的第二节点和边缘相对应的结构化查询，从第一用户接收第一集合的第一结构化查询的选择，以及基于所选择的第一结构化查询生成第二组结构化查询。
-
-
-
-
-
-
-
-
-
搜索结果
25 条记录 (耗时 0.05 秒)
