Patents by Inventor Daniel M. Bikel
Daniel M. Bikel 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).
-
Patent number: 9812124Abstract: 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.Type: GrantFiled: June 15, 2017Date of Patent: November 7, 2017Assignee: Google Inc.Inventors: Jakob D. Uszkoreit, Percy Liang, Daniel M. Bikel
-
Patent number: 9704481Abstract: 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.Type: GrantFiled: September 30, 2015Date of Patent: July 11, 2017Assignee: Google Inc.Inventors: Jakob D. Uszkoreit, Percy Liang, Daniel M. Bikel
-
Patent number: 9489378Abstract: A method includes accessing command sentences stored in a data store, wherein each command sentence is a collection of n-grams and each command sentence includes at least one n-gram that is a non-terminal n-gram that maps to a non-terminal type, and wherein the command sentences include non-terminal n-grams that collectively map to a plurality of different non-terminal types; for each of the non-terminal types: identifying n-gram spans; determining clusters of the n-gram spans, each cluster including n-gram spans meeting a measure of similarity of n-grams spans that belong to the cluster; and for each cluster of n-gram spans, determining, from the n-gram spans belonging to the cluster, a new non-terminal type to which the terminal n-grams of the n-gram spans map.Type: GrantFiled: July 6, 2015Date of Patent: November 8, 2016Assignee: Google Inc.Inventors: Jakob D. Uszkoreit, Ashish Venugopal, Daniel M. Bikel
-
Patent number: 9324323Abstract: Speech recognition techniques may include: receiving audio; identifying one or more topics associated with audio; identifying language models in a topic space that correspond to the one or more topics, where the language models are identified based on proximity of a representation of the audio to representations of other audio in the topic space; using the language models to generate recognition candidates for the audio, where the recognition candidates have scores associated therewith that are indicative of a likelihood of a recognition candidate matching the audio; and selecting a recognition candidate for the audio based on the scores.Type: GrantFiled: December 14, 2012Date of Patent: April 26, 2016Assignee: Google Inc.Inventors: Daniel M. Bikel, Kapil R. Thadini, Fernando Pereira, Maria Shugrina, Fadi Biadsy
-
Patent number: 9299339Abstract: 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.Type: GrantFiled: June 25, 2013Date of Patent: March 29, 2016Assignee: Google Inc.Inventors: Jakob D. Uszkoreit, Percy Liang, Daniel M. Bikel, Ciprian I. Chelba
-
Patent number: 9280970Abstract: 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.Type: GrantFiled: June 25, 2013Date of Patent: March 8, 2016Assignee: Google Inc.Inventors: Jakob D. Uszkoreit, Percy Liang, Daniel M. Bikel
-
Patent number: 9275034Abstract: A language processing system identifies, from log data, command inputs that parsed to a parsing rule associated with an action. If the command input has a signal indicative of user satisfaction, where the signal is derived from data that is not generated from performance of the action (e.g., user interactions with data provided in response to the performance of another, different action; resources identified in response to the performance of another, different action having a high quality score; etc.), then exception data is generated for the parsing rule. The exception data specifies the particular instance of the sentence parsed by the parsing rule, and precludes invocation of the action associated with the rule.Type: GrantFiled: July 22, 2015Date of Patent: March 1, 2016Assignee: Google Inc.Inventors: Jakob D. Uszkoreit, Percy Liang, Daniel M. Bikel
-
Patent number: 9251202Abstract: 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.Type: GrantFiled: June 25, 2013Date of Patent: February 2, 2016Assignee: Google Inc.Inventors: Jakob D. Uszkoreit, Percy Liang, Daniel M. Bikel, Pravir K. Gupta, Omer Bar-or
-
Patent number: 9183196Abstract: 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.Type: GrantFiled: June 25, 2013Date of Patent: November 10, 2015Assignee: Google Inc.Inventors: Jakob D. Uszkoreit, Percy Liang, Daniel M. Bikel
-
Patent number: 9177553Abstract: 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.Type: GrantFiled: June 25, 2013Date of Patent: November 3, 2015Assignee: Google Inc.Inventors: Jakob D. Uszkoreit, Percy Liang, Daniel M. Bikel
-
Patent number: 9117452Abstract: A language processing system identifies, from log data, command inputs that parsed to a parsing rule associated with an action. If the command input has a signal indicative of user satisfaction, where the signal is derived from data that is not generated from performance of the action (e.g., user interactions with data provided in response to the performance of another, different action; resources identified in response to the performance of another, different action having a high quality score; etc.), then exception data is generated for the parsing rule. The exception data specifies the particular instance of the sentence parsed by the parsing rule, and precludes invocation of the action associated with the rule.Type: GrantFiled: June 25, 2013Date of Patent: August 25, 2015Assignee: Google Inc.Inventors: Jakob D. Uszkoreit, Percy Liang, Daniel M. Bikel
-
Patent number: 9092505Abstract: A method includes accessing command sentences stored in a data store, wherein each command sentence is a collection of n-grams and each command sentence includes at least one n-gram that is a non-terminal n-gram that maps to a non-terminal type, and wherein the command sentences include non-terminal n-grams that collectively map to a plurality of different non-terminal types; for each of the non-terminal types: identifying n-gram spans; determining clusters of the n-gram spans, each cluster including n-gram spans meeting a measure of similarity of n-grams spans that belong to the cluster; and for each cluster of n-gram spans, determining, from the n-gram spans belonging to the cluster, a new non-terminal type to which the terminal n-grams of the n-gram spans map.Type: GrantFiled: June 25, 2013Date of Patent: July 28, 2015Assignee: Google Inc.Inventors: Jakob D. Uszkoreit, Ashish Venugopal, Daniel M. Bikel
-
Publication number: 20100023319Abstract: A system, a method and a computer readable media for providing model-driven feedback to human annotators. In one exemplary embodiment, the method includes manually annotating an initial small dataset. The method further includes training an initial model using said annotated dataset. The method further includes comparing the annotations produced by the model with the annotations produced by the annotator. The method further includes notifying the annotator of discrepancies between the annotations and the predictions of the model. The method further includes allowing the annotator to modify the annotations if appropriate. The method further includes updating the model with the data annotated by the annotator.Type: ApplicationFiled: July 28, 2008Publication date: January 28, 2010Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: DANIEL M. BIKEL, VITTORIO CASTELLI
-
Patent number: 6052682Abstract: A computer assisted method for recognizing and labeling instances of name classes in textual environments is described. The invention receives training text having instances of named-entity classes labeled, from which it generates a database of bigram and unigram occurrences. The invention uses the database of bigram and unigram occurrences to form a two level Hidden Markov Model with single output states at the lower level. The invention also receives a series of input text to be processed and labeled with respect to the name classes, and the invention uses the two level Hidden Markov Model to recognize and label instances of named-entity classes in the input text.Type: GrantFiled: May 2, 1997Date of Patent: April 18, 2000Assignee: BBN CorporationInventors: Scott Miller, Daniel M. Bikel, Richard M. Schwartz