-
公开(公告)号：US09990918B1
公开(公告)日：2018-06-05
申请号：US15788300
申请日：2017-10-19
Applicant: Google Inc.
Inventor： William Chan , Navdeep Jaitly , Quoc V. Le , Oriol Vinyals , Noam M. Shazeer
IPC: G10L15/16 , G06F17/22 , G10L15/183 , G10L15/26
CPC classification number: G10L15/16
Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media for speech recognition. One method includes obtaining an input acoustic sequence, the input acoustic sequence representing an utterance, and the input acoustic sequence comprising a respective acoustic feature representation at each of a first number of time steps; processing the input acoustic sequence using a first neural network to convert the input acoustic sequence into an alternative representation for the input acoustic sequence; processing the alternative representation for the input acoustic sequence using an attention-based Recurrent Neural Network (RNN) to generate, for each position in an output sequence order, a set of substring scores that includes a respective substring score for each substring in a set of substrings; and generating a sequence of substrings that represent a transcription of the utterance.
-
公开(公告)号：US09799327B1
公开(公告)日：2017-10-24
申请号：US15055476
申请日：2016-02-26
Applicant: Google Inc.
Inventor： William Chan , Navdeep Jaitly , Quoc V. Le , Oriol Vinyals , Noam M. Shazeer
IPC: G10L15/16 , G10L15/26 , G06F17/22 , G10L15/183
CPC classification number: G10L15/16
Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media for speech recognition. One method includes obtaining an input acoustic sequence, the input acoustic sequence representing an utterance, and the input acoustic sequence comprising a respective acoustic feature representation at each of a first number of time steps; processing the input acoustic sequence using a first neural network to convert the input acoustic sequence into an alternative representation for the input acoustic sequence; processing the alternative representation for the input acoustic sequence using an attention-based Recurrent Neural Network (RNN) to generate, for each position in an output sequence order, a set of substring scores that includes a respective substring score for each substring in a set of substrings; and generating a sequence of substrings that represent a transcription of the utterance.
-
公开(公告)号：US09235627B1
公开(公告)日：2016-01-12
申请号：US14143622
申请日：2013-12-30
Applicant: Google Inc.
Inventor： Hyung-Jin Kim , Simon Tong , Noam M. Shazeer , Michelangelo Diligenti
CPC classification number: G06F17/3053 , G06F17/30696 , G06F17/30864 , G06F17/30867 , G06Q30/02
Abstract: The present disclosure includes systems and techniques relating to ranking search results of a search query. In general, the subject matter described in this specification can be embodied in a computer-implemented method that includes determining a measure of relevance for a document result within a context of a search query for which the document result is returned, the determining being based on a first number in relation to a second number, the first number corresponding to longer views of the document result, and the second number corresponding to at least shorter views of the document result; and outputting the measure of relevance to a ranking engine for ranking of search results, including the document result, for a new search corresponding to the search query. The subject matter described in this specification can also be embodied in various corresponding computer program products, apparatus and systems.
Abstract translation: 本公开包括与搜索查询的搜索结果排序相关的系统和技术。 通常，本说明书中描述的主题可以体现在计算机实现的方法中，该方法包括确定在返回文档结果的搜索查询的上下文中的文档结果的相关性度量，该确定基于 相对于第二数字的第一数字，对应于文档结果的较长视图的第一数字，以及对应于文档结果的至少较短视图的第二数字; 并且对于与搜索查询相对应的新搜索，输出与包括文档结果在内的搜索结果排序相关的排名引擎的度量。 本说明书中描述的主题也可以体现在各种相应的计算机程序产品，装置和系统中。
-
公开(公告)号：US09811566B1
公开(公告)日：2017-11-07
申请号：US14992959
申请日：2016-01-11
Applicant: Google Inc.
Inventor： Hyung-Jin Kim , Simon Tong , Noam M. Shazeer , Michelangelo Diligenti
CPC classification number: G06F17/3053 , G06F17/30696 , G06F17/30864 , G06F17/30867 , G06Q30/02
Abstract: The present disclosure includes systems and techniques relating to ranking search results of a search query. In general, the subject matter described in this specification can be embodied in a computer-implemented method that includes determining a measure of relevance for a document result within a context of a search query for which the document result is returned, the determining being based on a first number in relation to a second number, the first number corresponding to longer views of the document result, and the second number corresponding to at least shorter views of the document result; and outputting the measure of relevance to a ranking engine for ranking of search results, including the document result, for a new search corresponding to the search query. The subject matter described in this specification can also be embodied in various corresponding computer program products, apparatus and systems.
-
Patent Agency Ranking
公开(公告)号：US20170249662A1
公开(公告)日：2017-08-31
申请号：US15596210
申请日：2017-05-16
Applicant: Google Inc.
Inventor： Ross Koningstein , Valentin Spitkovsky , Georges Harik , Noam M. Shazeer
Abstract: Keyword suggestions that are category-aware (and field-proven) may be used to help advertisers better target the serving of their ads, and may reduce unused ad spot inventory. The advertiser can enter ad information, such as a creative, a landing Webpage, other keywords, etc. for example. A keyword facility may use this entered ad information as seed information to infer one or more categories. It may then request that the advertiser confirm or deny some basic feedback information (e.g., categories, Webpage information, etc.). For example, an advertiser may be provided with candidate categories and may be asked to confirm (e.g., using checkboxes) which of the categories are relevant to their ad. Keywords may be determined using at least the categories. The determined keywords may be provided to the advertiser as suggested keywords, or may automatically populate ad serving constraint information as targeting keywords. The ad server system can run a trial on the determined keywords to qualify or disqualify them as targeting keyword.
-
公开(公告)号：US10580033B2
公开(公告)日：2020-03-03
申请号：US15596210
申请日：2017-05-16
Applicant: Google Inc.
Inventor： Ross Koningstein , Valentin Spitkovsky , Georges Harik , Noam M. Shazeer
Abstract: Keyword suggestions that are category-aware (and field-proven) may be used to help advertisers better target the serving of their ads, and may reduce unused ad spot inventory. The advertiser can enter ad information, such as a creative, a landing Webpage, other keywords, etc. for example. A keyword facility may use this entered ad information as seed information to infer one or more categories. It may then request that the advertiser confirm or deny some basic feedback information (e.g., categories, Webpage information, etc.). For example, an advertiser may be provided with candidate categories and may be asked to confirm (e.g., using checkboxes) which of the categories are relevant to their ad. Keywords may be determined using at least the categories. The determined keywords may be provided to the advertiser as suggested keywords, or may automatically populate ad serving constraint information as targeting keywords. The ad server system can run a trial on the determined keywords to qualify or disqualify them as targeting keyword.
-
公开(公告)号：US20170228414A1
公开(公告)日：2017-08-10
申请号：US15424671
申请日：2017-02-03
Applicant: Google Inc.
Inventor： Noam M. Shazeer , Colin Hearne Evans , Christopher Robert Waterson , Ryan P. Doherty
Abstract: Methods, and systems, including computer programs encoded on computer storage media for generating compressed representations from a co-occurrence matrix. A method includes obtaining a set of sub matrices of a co-occurrence matrix, where each row of the co-occurrence matrix corresponds to a feature from a first feature vocabulary and each column of the co-occurrence matrix corresponds to a feature from a second feature vocabulary; selecting a sub matrix, wherein the sub matrix is associated with a particular row block and column block of the co-occurrence matrix; assigning respective d-dimensional initial row and column embedding vectors to each row and column from the particular row and column blocks, respectively; and determining a final row embedding vector and a final column embedding vector by iteratively adjusting the initial row embedding vectors and the initial column embedding vectors using the co-occurrence matrix.
-
公开(公告)号：US09298852B2
公开(公告)日：2016-03-29
申请号：US13928868
申请日：2013-06-27
Applicant: GOOGLE INC.
Inventor： Emanuel Taropa , Jeffrey A. Dean , Simon Tong , Nitin Gupta , Noam M. Shazeer , Anwis Das , Murtaza A. Basrai
CPC classification number: G06F17/3097 , G06F17/3064 , G06F17/30646 , G06F17/30672
Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for reranking query completions based on activity session data. One of the methods includes receiving a query prefix from a user. Query completions are obtained for the query prefix. One or more likely queries that are likely to co-occur with a reference query in user activity sessions are obtained. If one of the likely queries matches one of the query completions, a modified ranking of the query completions is determined, including boosting a ranking of matching query completions. The modified ranking of the query completions is provided in response to receiving the query prefix.
Abstract translation: 方法，系统和装置，包括在计算机存储介质上编码的计算机程序，用于基于活动会话数据重新排列查询完成。 其中一种方法包括从用户接收查询前缀。 获取查询前缀的查询完成。 获得在用户活动会话中可能与参考查询共存的一个或多个可能的查询。 如果一个可能的查询与其中一个查询完成相匹配，则确定查询完成的修改排名，包括提升匹配查询完成的排名。 响应于接收查询前缀而提供查询完成的修改排名。
-
公开(公告)号：US20150169578A1
公开(公告)日：2015-06-18
申请号：US13928868
申请日：2013-06-27
Applicant: GOOGLE INC.
Inventor： Emanuel Taropa , Jeffrey A. Dean , Simon Tong , Nitin Gupta , Noam M. Shazeer , Anwis Das , Murtaza A. Basrai
IPC: G06F17/30
CPC classification number: G06F17/3097 , G06F17/3064 , G06F17/30646 , G06F17/30672
Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for reranking query completions based on activity session data. One of the methods includes receiving a query prefix from a user. Query completions are obtained for the query prefix. One or more likely queries that are likely to co-occur with a reference query in user activity sessions are obtained. If one of the likely queries matches one of the query completions, a modified ranking of the query completions is determined, including boosting a ranking of matching query completions. The modified ranking of the query completions is provided in response to receiving the query prefix.
Abstract translation: 方法，系统和装置，包括在计算机存储介质上编码的计算机程序，用于基于活动会话数据重新排列查询完成。 其中一种方法包括从用户接收查询前缀。 获取查询前缀的查询完成。 获得在用户活动会话中可能与参考查询共存的一个或多个可能的查询。 如果一个可能的查询与其中一个查询完成相匹配，则确定查询完成的修改排名，包括提升匹配查询完成的排名。 响应于接收查询前缀而提供查询完成的修改排名。
-
-
-
-
-
-
-
-
Search Results
9
records
(took 0.047 seconds)
