公开(公告)号：US08914279B1

公开(公告)日：2014-12-16

申请号：US13624280

申请日：2012-09-21

Applicant: Google Inc.

Inventor： Slav Petrov ,  Alexander Rush

IPC: G06F17/27 ,  G06F17/20 ,  G06F17/21

CPC classification number: G06F17/2715 ,  G06F17/271

Abstract: A dependency parsing method can include determining an index set of possible head-modifier dependencies for a sentence. The index set can include inner arcs and outer arcs, inners arcs representing possible dependency between words in the sentence separated by a distance less than or equal to a threshold and outer arcs representing possible dependency between words in the sentence separated by a distance greater than the threshold. The index set can be pruned to include: (i) each specific inner arc when a likelihood that the specific inner arc is appropriate is greater than a first threshold, and (ii) the outer arcs when a likelihood that there exists any possible outer arc that is appropriate is greater than the first threshold. The method can include further pruning the pruned index set based on a second parsing algorithm, and determining a most-likely parse for the sentence from the pruned index set.

Abstract translation: 依赖性解析方法可以包括确定句子的可能的头修饰符依赖性的索引集合。 索引集可以包括内弧和外弧，内圆弧表示句子中的词之间的距离小于或等于阈值的可能依赖性，外弧表示句子中的词之间的距离大于 阈。 索引集可以被修剪为包括：（i）当特定内弧适合的可能性大于第一阈值时的每个特定内弧，以及（ii）当存在任何可能的外弧的可能性时的外弧 这是适当的大于第一阈值。 该方法可以包括基于第二解析算法进一步修剪修剪的索引集合，并且从修剪的索引集合确定对于该句子的最有可能的解析。

公开(公告)号：US09507852B2

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

申请号：US14102087

申请日：2013-12-10

Applicant: Google Inc.

Inventor： Slav Petrov ,  Alexander Rush

IPC: G10L15/18 ,  G06F17/30 ,  G06F17/27 ,  G10L15/26

CPC classification number: G06F17/30654 ,  G06F17/2775 ,  G10L15/1822 ,  G10L15/26

Abstract: A computer-implemented method can include receiving a speech input representing a question, converting the speech input to a string of characters, and obtaining tokens each representing a potential word. The method can include determining one or more part-of-speech (POS) tags for each token and determining sequences of the POS tags for the tokens, each sequence of the POS tags including one POS tag per token. The method can include determining one or more parses for each sequence of the POS tags for the tokens and determining a most-likely parse and its corresponding sequence of the POS tags for the tokens to obtain a selected parse and a selected sequence of the POS tags for the tokens. The method can also include determining a most-likely answer to the question using the selected parse and the selected sequence of the POS tags for the tokens and outputting the most-likely answer.

Abstract translation: 计算机实现的方法可以包括接收表示问题的语音输入，将语音输入转换成一串字符，以及获得每个代表潜在词的令牌。 该方法可以包括为每个令牌确定一个或多个词性（POS）标签，并确定令牌的POS标签的序列，每个标记的每个POS标签序列包括一个POS标签。 该方法可以包括为令牌的POS标签的每个序列确定一个或多个解析，并确定用于令牌的POS标签的最有可能的解析及其相应序列，以获得所选择的解析和所选择的POS标签序列 为令牌。 该方法还可以包括使用所选择的解析和用于令牌的所选择的POS标签序列来确定问题的最可能的答案并输出最可能的答案。

公开(公告)号：US20150161996A1

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

申请号：US14102087

申请日：2013-12-10

Applicant: Google Inc.

Inventor： Slav Petrov ,  Alexander Rush

IPC: G10L15/18

CPC classification number: G06F17/30654 ,  G06F17/2775 ,  G10L15/1822 ,  G10L15/26

Abstract: A computer-implemented method can include receiving a speech input representing a question, converting the speech input to a string of characters, and obtaining tokens each representing a potential word. The method can include determining one or more part-of-speech (POS) tags for each token and determining sequences of the POS tags for the tokens, each sequence of the POS tags including one POS tag per token. The method can include determining one or more parses for each sequence of the POS tags for the tokens and determining a most-likely parse and its corresponding sequence of the POS tags for the tokens to obtain a selected parse and a selected sequence of the POS tags for the tokens. The method can also include determining a most-likely answer to the question using the selected parse and the selected sequence of the POS tags for the tokens and outputting the most-likely answer.

Abstract translation: 计算机实现的方法可以包括接收表示问题的语音输入，将语音输入转换成一串字符，以及获得每个代表潜在词的令牌。 该方法可以包括为每个令牌确定一个或多个词性（POS）标签，并确定令牌的POS标签的序列，每个标记的每个POS标签序列包括一个POS标签。 该方法可以包括为令牌的POS标签的每个序列确定一个或多个解析，并确定用于令牌的POS标签的最有可能的解析及其相应序列，以获得所选择的解析和所选择的POS标签序列 为令牌。 该方法还可以包括使用所选择的解析和用于令牌的所选择的POS标签序列来确定问题的最可能的答案并输出最可能的答案。