Natural-language rendering of structured search queries
    7.
    发明授权
    Natural-language rendering of structured search queries 有权
    结构化搜索查询的自然语言呈现

    公开(公告)号:US09367607B2

    公开(公告)日:2016-06-14

    申请号:US13731866

    申请日:2012-12-31

    IPC分类号: G06F17/30 G06Q30/02 G06Q50/00

    摘要: 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 portions of the text query, accessing a context-free grammar model, identifying query tokens from the grammar model that correspond to the identified nodes and edges, selecting grammars having query tokens that corresponding to each of the identified nodes and edges, and generating structured queries based on the selected grammars, where the structure queries are based on strings generated by the grammars.

    摘要翻译: 在一个实施例中,一种方法包括访问包括多个节点和边缘的社交图,接收非结构化文本查询,识别对应于文本查询的部分的节点和边缘,访问无上下文的语法模型,识别查询令牌 从对应于所识别的节点和边缘的语法模型中,选择具有与所识别的每个节点和边缘相对应的查询令牌的语法,以及基于所选择的语法生成结构化查询,其中结构查询基于由 语法

    Natural-Language Rendering of Structured Search Queries
    8.
    发明申请
    Natural-Language Rendering of Structured Search Queries 有权
    结构化搜索查询的自然语言呈现

    公开(公告)号:US20140188935A1

    公开(公告)日:2014-07-03

    申请号:US13731866

    申请日:2012-12-31

    IPC分类号: G06F17/30

    摘要: 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 portions of the text query, accessing a context-free grammar model, identifying query tokens from the grammar model that correspond to the identified nodes and edges, selecting grammars having query tokens that corresponding to each of the identified nodes and edges, and generating structured queries based on the selected grammars, where the structure queries are based on strings generated by the grammars.

    摘要翻译: 在一个实施例中,一种方法包括访问包括多个节点和边缘的社交图,接收非结构化文本查询,识别对应于文本查询的部分的节点和边缘,访问无上下文的语法模型,识别查询令牌 从对应于所识别的节点和边缘的语法模型中,选择具有与所识别的每个节点和边缘相对应的查询令牌的语法,以及基于所选择的语法生成结构化查询,其中结构查询基于由 语法

    TIME-WEIGHTED AND SCALING OPTIMIZATION OF ALLOCATION OF ONLINE ADVERTISEMENT INVENTORY
    9.
    发明申请
    TIME-WEIGHTED AND SCALING OPTIMIZATION OF ALLOCATION OF ONLINE ADVERTISEMENT INVENTORY 审中-公开
    时间加权和缩放优化在线广告库存分配

    公开(公告)号:US20100106556A1

    公开(公告)日:2010-04-29

    申请号:US12257241

    申请日:2008-10-23

    IPC分类号: G06Q30/00 G06Q10/00

    摘要: A method for scaling advertisement inventory allocation includes constructing a flow network of nodes having impressions connected to contracts through corresponding arcs such as to satisfy demand requests of the contracts; (a) for each of the contracts: determining a probability distribution over the nodes eligible to supply forecasted impressions to the contract; drawing a plurality of sample nodes from the probability distribution to form a multiset, O, of nodes; (b) for each of the nodes within O: determining a subset of the contracts, H, that can be satisfied by receiving forecasted impressions from the node; weighting a number of forecasted impressions of the node, as a function of the subset of contracts in H, with the probability distribution of the node; and optimally allocating forecasted impressions from each multiset, O, of sample nodes to each corresponding contract during the time period by solving the flow network with a minimum-cost network flow algorithm.

    摘要翻译: 用于缩放广告库存分配的方法包括:通过相应的弧来构建具有与合同相关联的印象的节点的流网络,以满足合同的需求请求; (a)对于每个合同:确定有资格向合同提供预测印象的节点上的概率分布; 从概率分布绘制多个样本节点以形成节点的多集合O; (b)对于O中的每个节点:确定通过从节点接收预测的印象可以满足的合同的子集H; 将节点的预测展示次数作为H中的合同子集的函数与节点的概率分布进行加权; 并且通过使用最小成本网络流算法解决流网络,在时间段内将样本节点的每个多集群O的预测印象最佳地分配给每个对应的合同。