Patents by Inventor Aurelien Boffy
Aurelien Boffy has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Publication number: 20240013782Abstract: A method includes receiving follow-on audio data captured by an assistant-enabled device, the follow-on audio data corresponding to a follow-on query spoken by a user of the assistant-enabled device to a digital assistant subsequent to the user submitting a previous query to the digital assistant. The method also includes processing, using a speech recognizer, the follow-on audio data to generate multiple candidate hypotheses, each candidate hypothesis corresponding to a candidate transcription for the follow-on query and represented by a respective sequence of hypothesized terms. For each corresponding candidate hypothesis among the multiple candidate hypotheses, the method also includes determining a corresponding similarity metric between the previous query and the corresponding candidate hypothesis and determining a transcription of the follow-on query spoken by the user based on the similarity metrics determined for the multiple candidate hypotheses.Type: ApplicationFiled: July 11, 2022Publication date: January 11, 2024Applicant: Google LLCInventors: Patrick Siegler, Aurélien Boffy, Ágoston Weisz
-
Publication number: 20230402034Abstract: Implementations relate to correcting a speech recognition hypothesis based on prior correction(s) made by a user and/or fulfillment data associated with fulfilling a request embodied in the speech recognition hypothesis. A candidate speech recognition hypothesis can be generated in response to the user providing a spoken utterance to an application, such as an automated assistant. When a confidence metric for the candidate speech recognition hypothesis does not satisfy a threshold, one or more terms of the candidate speech recognition hypothesis can be compared to correcting data. The correcting data can indicate whether the user previously corrected any term(s) present in the candidate speech recognition hypothesis and, if so, correct the term(s) accordingly. Fulfillment data generated for the candidate hypothesis and/or for the corrected hypothesis can also be processed to determine whether to utilize the candidate hypothesis or the corrected hypothesis in responding to the user.Type: ApplicationFiled: June 16, 2022Publication date: December 14, 2023Inventors: Ágoston Weisz, Miroslaw Michalski, Aurélien Boffy
-
Patent number: 11574013Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for providing contextual information to a user. In one aspect, a method includes receiving, from a user device, a query-independent request for contextual information relevant to an active resource displayed in an application environment on the user device, generating multiple queries from displayed content from the resource, determining a quality score for each of the multiple queries, selecting one or more of the multiple queries based on their respective quality scores, and providing, to the user device for each of the selected one or more queries, a respective user interface element for display with the active resource, wherein each user interface element includes contextual information regarding the respective query and includes the respective query.Type: GrantFiled: September 10, 2021Date of Patent: February 7, 2023Assignee: Google LLCInventors: Michal Jastrzebski, Aurelien Boffy, Gokhan H. Bakir, Behshad Behzadi, Marcin M. Nowak-Przygodzki
-
Patent number: 11514035Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for determining query refinements using search data. In one aspect, a method includes receiving a first query and a second query each comprising one or more n-grams for a user session, determining a first set of query refinements for the first query, determining a second set of query refinements from the first set of query refinements, each query refinement in the second set of query refinements including at least one n-gram that is similar to an n-gram from the first query and at least on n-gram that is similar to an n-gram from the second query, scoring each query refinement in the second set of query refinements, selecting a third query from a group consisting of the second set of query refinements and the second query, and providing the third query as input to a search operation.Type: GrantFiled: June 1, 2020Date of Patent: November 29, 2022Assignee: GOOGLE LLCInventors: Matthias Heiler, Behshad Behzadi, Evgeny A. Cherepanov, Nils Grimsmo, Aurelien Boffy, Alessandro Agostini, Karoly Csalogany, Fredrik Bergenlid, Marcin M. Nowak-Przygodzki
-
Patent number: 11120083Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for providing contextual information to a user. In one aspect, a method includes receiving, from a user device, a query-independent request for contextual information relevant to an active resource displayed in an application environment on the user device, generating multiple queries from displayed content from the resource, determining a quality score for each of the multiple queries, selecting one or more of the multiple queries based on their respective quality scores, and providing, to the user device for each of the selected one or more queries, a respective user interface element for display with the active resource, wherein each user interface element includes contextual information regarding the respective query and includes the respective query.Type: GrantFiled: November 14, 2019Date of Patent: September 14, 2021Assignee: GOOGLE LLCInventors: Michal Jastrzebski, Aurelien Boffy, Gokhan H. Bakir, Behshad Behzadi, Marcin M. Nowak-Przygodzki
-
Patent number: 10691680Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for determining query refinements using search data. In one aspect, a method includes receiving a first query and a second query each comprising one or more n-grams for a user session, determining a first set of query refinements for the first query, determining a second set of query refinements from the first set of query refinements, each query refinement in the second set of query refinements including at least one n-gram that is similar to an n-gram from the first query and at least on n-gram that is similar to an n-gram from the second query, scoring each query refinement in the second set of query refinements, selecting a third query from a group consisting of the second set of query refinements and the second query, and providing the third query as input to a search operation.Type: GrantFiled: June 8, 2017Date of Patent: June 23, 2020Assignee: Google LLCInventors: Matthias Heiler, Behshad Behzadi, Evgeny A. Cherepanov, Nils Grimsmo, Aurelien Boffy, Alessandro Agostini, Karoly Csalogany, Fredrik Bergenlid, Marcin M. Nowak-Przygodzki
-
Patent number: 10489459Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for providing contextual information to a user. In one aspect, a method includes receiving, from a user device, a query-independent request for contextual information relevant to an active resource displayed in an application environment on the user device, generating multiple queries from displayed content from the resource, determining a quality score for each of the multiple queries, selecting one or more of the multiple queries based on their respective quality scores, and providing, to the user device for each of the selected one or more queries, a respective user interface element for display with the active resource, wherein each user interface element includes contextual information regarding the respective query and includes the respective query.Type: GrantFiled: December 22, 2016Date of Patent: November 26, 2019Assignee: Google LLCInventors: Michal Jastrzebski, Aurelien Boffy, Gokhan H. Bakir, Behshad Behzadi, Marcin M. Nowak-Przygodzki
-
Patent number: 9727603Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for determining query refinements using search data. In one aspect, a method includes receiving a first query and a second query each comprising one or more n-grams for a user session, determining a first set of query refinements for the first query, determining a second set of query refinements from the first set of query refinements, each query refinement in the second set of query refinements including at least one n-gram that is similar to an n-gram from the first query and at least on n-gram that is similar to an n-gram from the second query, scoring each query refinement in the second set of query refinements, selecting a third query from a group consisting of the second set of query refinements and the second query, and providing the third query as input to a search operation.Type: GrantFiled: July 30, 2015Date of Patent: August 8, 2017Assignee: Google Inc.Inventors: Matthias Heiler, Behshad Behzadi, Evgeny A. Cherepanov, Nils Grimsmo, Aurelien Boffy, Alessandro Agostini, Karoly Csalogany, Fredrik Bergenlid, Marcin M. Nowak-Przygodzki
-
Patent number: 9336277Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for generating query suggestions based on search data. In one aspect, a method includes receiving, by one or more computers, a first query, determining query refinements based on the first query, generating, from the query refinements, refinement clusters, each refinement cluster corresponding to a particular topic and each refinement cluster including query refinements that are determined to belong to the particular topic to which the refinement cluster corresponds, ranking the refinement clusters, and selecting the refinement cluster that is highest in the ranking relative to other refinement clusters in the ranking as a first search refinement cluster for the first query.Type: GrantFiled: May 31, 2013Date of Patent: May 10, 2016Assignee: Google Inc.Inventors: Behshad Behzadi, Evgeny A. Cherepanov, Nils Grimsmo, Aurelien Boffy, Alessandro Agostini, Karoly Csalogany, Fredrik Bergenlid, Matthias Heiler, Marcin M. Nowak-Przygodzki
-
Patent number: 9116952Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for determining query refinements using search data. In one aspect, a method includes receiving a first query and a second query each comprising one or more n-grams for a user session, determining a first set of query refinements for the first query, determining a second set of query refinements from the first set of query refinements, each query refinement in the second set of query refinements including at least one n-gram that is similar to an n-gram from the first query and at least on n-gram that is similar to an n-gram from the second query, scoring each query refinement in the second set of query refinements, selecting a third query from a group consisting of the second set of query refinements and the second query, and providing the third query as input to a search operation.Type: GrantFiled: May 31, 2013Date of Patent: August 25, 2015Assignee: Google Inc.Inventors: Matthias Heiler, Behshad Behzadi, Evgeny A. Cherepanov, Nils Grimsmo, Aurelien Boffy, Alessandro Agostini, Karoly Csalogany, Fredrik Bergenlid, Marcin M. Nowak-Przygodzki
-
Publication number: 20150088859Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for identifying click magnet images. In one aspect, a method includes obtaining selections vector for images. A selection vector for an image can include vector elements that correspond to a unique search query. The value of each vector element can be proportional to a number of selections of image search results that included a representation of the image when the search results were presented in response to the unique search query. The image can be deemed be a click magnet image based at least in part on a first number of selections of image search results that included a representation of the image for search queries categorized as belonging to a set of categories and a total number of selections of image search results that included a representation of the image.Type: ApplicationFiled: June 21, 2012Publication date: March 26, 2015Inventors: ANDREAS CHRISTIAN WEISSL, Aurelien Boffy, Randall G. Keller, Alexandra Zykova, Michihiro Kuramochi
-
Publication number: 20140358906Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for generating query suggestions based on search data. In one aspect, a method includes receiving, by one or more computers, a first query, determining query refinements based on the first query, generating, from the query refinements, refinement clusters, each refinement cluster corresponding to a particular topic and each refinement cluster including query refinements that are determined to belong to the particular topic to which the refinement cluster corresponds, ranking the refinement clusters, and selecting the refinement cluster that is highest in the ranking relative to other refinement clusters in the ranking as a first search refinement cluster for the first query.Type: ApplicationFiled: May 31, 2013Publication date: December 4, 2014Inventors: Behshad Behzadi, Evgeny A. Cherepanov, Nils Grimsmo, Aurelien Boffy, Alessandro Agostini, Karoly Csalogany, Fredrik Bergenlid, Matthias Heiler, Marcin M. Nowak-Przygodzki