中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

12 records (took 0.016 seconds)

    Identifying underserved command inputs
    3.
    发明授权
    Identifying underserved command inputs 有权

    公开(公告)号：US09812124B1

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

    申请号：US15624339

    申请日：2017-06-15

    Applicant: Google Inc.

    Inventor： Jakob D. Uszkoreit ,  Percy Liang ,  Daniel M. Bikel

    IPC: G06F17/27 ,  G10L15/18 ,  G10L15/22

    CPC classification number: G10L15/1822 ,  G06F17/27 ,  G06F17/2705 ,  G06F17/274 ,  G06F17/2785 ,  G10L15/22 ,  G10L2015/223

    Abstract: A language processing system identifies first command input sentences that do not successfully parse by any parsing rule in a set of parsing rules. Each of the parsing rules is associated with an action, and a user device performs the action associated with a parsing rule in response to an input sentence being successfully parsed by the parsing rule. For each of these identified first sentences, the system determines whether the first input sentence has an underserving signal that is indicative of one or more actions being underserved. If the first sentence has the underserving signal, then the first sentence is selected as a candidate input sentence. Each candidate input sentence is provided to an action analysis processes that determines whether a candidate input sentence is to be associated with one action, and upon a positive determination generates a parsing rule for the candidate input sentence.

    Lattice semantic parsing
    4.
    发明授权
    Lattice semantic parsing 有权
    格子语义解析

    公开(公告)号：US09280970B1

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

    申请号：US13926669

    申请日：2013-06-25

    Applicant: Google Inc.

    Inventor： Jakob D. Uszkoreit ,  Percy Liang ,  Daniel M. Bikel

    IPC: G10L15/18

    CPC classification number: G10L15/1822 ,  G10L15/083 ,  G10L15/193

    Abstract: A language processing system uses a lattice parser that semantically parses a command input represented by a lattice. The parser receives a hypotheses space of outputs as encoded in a lattice. Annotations of the input are projected back into the lattice and then lattice parsing is performed to rectify with the annotations. Parsing rules are applied to path fragments in the lattice. The rules that successfully parse from the start node to the end node of the lattice are used to determine whether the command input sentence invokes a specific action, and if so, what arguments are to be passed to the invocation of the action.

    Abstract translation: 语言处理系统使用语义分析由格子表示的命令输入的点阵解析器。 解析器接收以格子编码的输出的假设空间。 将输入的注释投射回格子，然后执行格子解析以用注释进行纠正。 解析规则应用于格子中的路径片段。 用于从起始节点到网格的结束节点成功解析的规则用于确定命令输入句是否调用特定的动作，如果是，则将传递给动作调用的参数。

    Corpus specific queries for corpora from search query
    5.
    发明授权
    Corpus specific queries for corpora from search query 有权
    语料库查询查询语料库

    公开(公告)号：US09251202B1

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

    申请号：US13926649

    申请日：2013-06-25

    Applicant: Google Inc.

    Inventor： Jakob D. Uszkoreit ,  Percy Liang ,  Daniel M. Bikel ,  Pravir K. Gupta ,  Omer Bar-or

    IPC: G06F17/30

    CPC classification number: G06F17/30864 ,  G06F17/30672

    Abstract: A system determines search hypotheses for a search query, each search hypothesis defining a search type and respectively corresponding to a resource corpus of a type that matches the search type; for each search hypothesis, generate a hypothesis search query based on the search query and the search type and submits the hypothesis search query to a search service to determine a search hypothesis score, and for each search hypothesis having a search hypothesis score meeting a search hypothesis threshold, providing search results for the search operation performed for the hypothesis search query determined for the search hypothesis; and for each search hypothesis not having a search hypothesis score meeting a search hypothesis threshold, not providing search results for the search operation performed for the hypothesis search query determined for the search hypothesis.

    Abstract translation: 系统确定搜索查询的搜索假设，每个搜索假设定义搜索类型并且分别对应于与搜索类型匹配的类型的资源语料库; 对于每个搜索假设，基于搜索查询和搜索类型生成假设搜索查询，并将搜索查询提交给搜索服务以确定搜索假设得分，并且对于具有满足搜索假设的搜索假设得分的每个搜索假设 提供针对为搜索假设确定的假设搜索查询执行的搜索操作的搜索结果; 并且对于不具有满足搜索假设阈值的搜索假设得分的每个搜索假设，不提供针对为搜索假设确定的假设搜索查询执行的搜索操作的搜索结果。

    Parsing annotator framework from external services
    6.
    发明授权
    Parsing annotator framework from external services 有权
    从外部服务解析注释框架

    公开(公告)号：US09183196B1

    公开(公告)日：2015-11-10

    申请号：US13926915

    申请日：2013-06-25

    Applicant: Google Inc.

    Inventor： Jakob D. Uszkoreit ,  Percy Liang ,  Daniel M. Bikel

    IPC: G06F17/27 ,  G06F17/28

    CPC classification number: G06F17/278 ,  G06F17/2705 ,  G06F17/271 ,  G06F17/2715 ,  G06F17/2755 ,  G06F17/28

    Abstract: A language processing system uses annotation services that are external to the language processing system to identify n-grams that identify entities in an input sentence. The n-grams are annotated by the annotation services. The annotations are used to determine which n-grams, if any, correspond to instances of an entity type (e.g., values for a variable or terminals for a non-terminal). After determining which n-grams correspond to entity types, parse initializations are generated for parsing rules and parses for each rule are attempted. The rules that successfully parse are used to determine whether the input sentence invokes a specific action, and if so, what arguments are to be passed to the invocation of the action.

    Abstract translation: 语言处理系统使用语言处理系统外部的注释服务来识别识别输入句中的实体的n-gram。 n-gram由注释服务注释。 注释用于确定哪个n克（如果有的话）对应于实体类型的实例（例如，用于非终端的变量或终端的值）。 在确定哪些n-gram对应于实体类型之后，将生成解析初始化以用于解析规则，并尝试对每个规则进行解析。 成功解析的规则用于确定输入的句子是否调用特定的动作，如果是这样，那么什么参数将被传递给动作的调用。

    Identifying underserved command inputs
    7.
    发明授权
    Identifying underserved command inputs 有权
    识别服务不足的命令输入

    公开(公告)号：US09177553B1

    公开(公告)日：2015-11-03

    申请号：US13926943

    申请日：2013-06-25

    Applicant: Google Inc.

    Inventor： Jakob D. Uszkoreit ,  Percy Liang ,  Daniel M. Bikel

    IPC: G06F17/27 ,  G10L15/22

    CPC classification number: G10L15/1822 ,  G06F17/27 ,  G06F17/2705 ,  G06F17/274 ,  G06F17/2785 ,  G10L15/22 ,  G10L2015/223

    Abstract: A language processing system identifies first command input sentences that do not successfully parse by any parsing rule in a set of parsing rules. Each of the parsing rules is associated with an action, and a user device performs the action associated with a parsing rule in response to an input sentence being successfully parsed by the parsing rule. For each of these identified first sentences, the system determines whether the first input sentence has an underserving signal that is indicative of one or more actions being underserved. If the first sentence has the underserving signal, then the first sentence is selected as a candidate input sentence. Each candidate input sentence is provided to an action analysis processes that determines whether a candidate input sentence is to be associated with one action, and upon a positive determination generates a parsing rule for the candidate input sentence.

    Abstract translation: 语言处理系统识别在一组解析规则中的任何解析规则无法成功解析的第一个命令输入句子。 解析规则中的每一个与动作相关联，并且用户设备响应于由解析规则成功解析的输入句子来执行与解析规则相关联的动作。 对于每个这些识别的第一句子，系统确定第一输入句是否具有指示一个或多个动作不足的不足的信号。 如果第一句话具有不良信号，则选择第一句作为候选输入句。 每个候选输入句被提供给动作分析处理，该动作分析处理确定候选输入句是否与一个动作相关联，并且在肯定确定时生成候选输入句的解析规则。

    Identifying underserved command inputs
    8.
    发明授权
    Identifying underserved command inputs 有权

    公开(公告)号：US09704481B1

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

    申请号：US14870325

    申请日：2015-09-30

    Applicant: Google Inc.

    Inventor： Jakob D. Uszkoreit ,  Percy Liang ,  Daniel M. Bikel

    IPC: G06F17/27 ,  G10L15/18 ,  G10L15/22

    CPC classification number: G10L15/1822 ,  G06F17/27 ,  G06F17/2705 ,  G06F17/274 ,  G06F17/2785 ,  G10L15/22 ,  G10L2015/223

    Abstract: A language processing system identifies first command input sentences that do not successfully parse by any parsing rule in a set of parsing rules. Each of the parsing rules is associated with an action, and a user device performs the action associated with a parsing rule in response to an input sentence being successfully parsed by the parsing rule. For each of these identified first sentences, the system determines whether the first input sentence has an underserving signal that is indicative of one or more actions being underserved. If the first sentence has the underserving signal, then the first sentence is selected as a candidate input sentence. Each candidate input sentence is provided to an action analysis processes that determines whether a candidate input sentence is to be associated with one action, and upon a positive determination generates a parsing rule for the candidate input sentence.

    Parsing rule augmentation based on query sequence and action co-occurrence
    10.
    发明授权
    Parsing rule augmentation based on query sequence and action co-occurrence 有权
    基于查询序列和动作共现分析规则增强

    公开(公告)号：US09299339B1

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

    申请号：US13926795

    申请日：2013-06-25

    Applicant: Google Inc.

    Inventor： Jakob D. Uszkoreit ,  Percy Liang ,  Daniel M. Bikel ,  Ciprian I. Chelba

    IPC: G10L15/06 ,  G10L15/19 ,  G10L15/01

    CPC classification number: G06F17/2705 ,  G10L15/19 ,  G10L15/22

    Abstract: A language processing system identifies sequential command inputs in user session data stored in logs. Each sequence command input is a first command input followed by a second command input. The system determines user actions in response to each command input. For the second command input, an action was taken at the user device in response to the command input, and there is no parsing rule associated with the action that parses to the first command input. If there is a sufficient co-occurrence of the first and second command inputs and the resulting action in the logs, then a parsing rule for the action may be augmented with a rule for the first command input.

    Abstract translation: 语言处理系统识别存储在日志中的用户会话数据中的顺序命令输入。 每个序列命令输入都是第一个命令输入，后跟第二个命令输入。 系统根据每个命令输入确定用户动作。 对于第二个命令输入，响应于命令输入在用户设备上采取了一个操作，并且没有与解析到第一个命令输入的操作相关联的解析规则。 如果在日志中存在足够的第一和第二命令输入和所产生的动作的同时发生，则可以用第一命令输入的规则来增加动作的解析规则。

Patent Agency Ranking