Patents by Inventor Robert L. Mercer
Robert L. Mercer 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).
-
SYSTEM AND METHOD FOR EXECUTING SYNCHRONIZED MESSAGES IN MULTIPLE GEOGRAPHICALLY DISTRIBUTED SERVERS
Publication number: 20220076337Abstract: A geographically distributed computer system that includes a primary server, and multiple secondary servers co-located with geographically dispersed tertiary servers. Each of the secondary servers having a high accuracy clock. The primary server divides a large message order into multiple smaller messages and combines each smaller message with a transaction execution time into multiple instructions. The primary server sends a respective instruction based on each combined smaller message and transaction execution time to each co-located server. When the high accuracy clock on each server reaches the transaction execution time, all the co-located servers submit their smaller messages to their respective co-located tertiary server substantially simultaneously.Type: ApplicationFiled: October 8, 2021Publication date: March 10, 2022Inventors: Robert L. Mercer, Peter F. Brown -
Patent number: 11157998Abstract: A financial trading system that includes a trading server, multiple financial exchanges, and multiple servers with each server associated with and co-located at an exchange and comprising a high accuracy clock. The trading server divides a large transaction order into multiple smaller transaction orders and combines each smaller transaction order with a transaction execution time. The trading server sends a financial trade instruction based on each combined smaller transaction order and transaction execution time to each co-located server. When the high accuracy clock on each server reaches the transaction execution time, all the servers submit their smaller transaction orders to the respective financial exchanges substantially simultaneously.Type: GrantFiled: August 4, 2014Date of Patent: October 26, 2021Assignee: RENAISSANCE TECHNOLOGIES LLCInventors: Robert L. Mercer, Peter F. Brown
-
Publication number: 20160035027Abstract: A financial trading system that includes a trading server, multiple financial exchanges, and multiple servers with each server associated with and co-located at an exchange and comprising a high accuracy clock. The trading server divides a large transaction order into multiple smaller transaction orders and combines each smaller transaction order with a transaction execution time. The trading server sends a financial trade instruction based on each combined smaller transaction order and transaction execution time to each co-located server. When the high accuracy clock on each server reaches the transaction execution time, all the servers submit their smaller transaction orders to the respective financial exchanges substantially simultaneously.Type: ApplicationFiled: August 4, 2014Publication date: February 4, 2016Inventors: Robert L. Mercer, Peter F. Brown
-
Patent number: 5510981Abstract: An apparatus for translating a series of source words in a first language to a series of target words in a second language. For an input series of source words, at least two target hypotheses, each including a series of target words, are generated. Each target word has a context comprising at least one other word in the target hypothesis. For each target hypothesis, a language model match score including an estimate of the probability of occurrence of the series of words in the target hypothesis. At least one alignment connecting each source word with at least one target word in the target hypothesis is identified. For each source word and each target hypothesis, a word match score including an estimate of the conditional probability of occurrence of the source word, given the target word in the target hypothesis which is connected to the source word and given the context in the target hypothesis of the target word which is connected to the source word.Type: GrantFiled: October 28, 1993Date of Patent: April 23, 1996Assignee: International Business Machines CorporationInventors: Adam L. Berger, Peter F. Brown, Stephen A. Della Pietra, Vincent J. Della Pietra, Andrew S. Kehler, Robert L. Mercer
-
Patent number: 5477451Abstract: The present invention is a system for translating text from a first source language into a second target language. The system assigns probabilities or scores to various target-language translations and then displays or makes otherwise available the highest scoring translations. The source text is first transduced into one or more intermediate structural representations. From these intermediate source structures a set of intermediate target-structure hypotheses is generated. These hypotheses are scored by two different models: a language model which assigns a probability or score to an intermediate target structure, and a translation model which assigns a probability or score to the event that an intermediate target structure is translated into an intermediate source structure. Scores from the translation model and language model are combined into a combined score for each intermediate target-structure hypothesis.Type: GrantFiled: July 25, 1991Date of Patent: December 19, 1995Assignee: International Business Machines Corp.Inventors: Peter F. Brown, John Cocke, Stephen A. Della Pietra, Vincent J. Della Pietra, Frederick Jelinek, Jennifer C. Lai, Robert L. Mercer
-
Patent number: 5293584Abstract: A speech recognition system displays a source text of one or more words in a source language. The system has an acoustic processor for generating a sequence of coded representations of an utterance to be recognized. The utterance comprises a series of one or more words in a target language different from the source language. A set of one or more speech hypotheses, each comprising one or more words from the target language, are produced. Each speech hypothesis is modeled with an acoustic model. An acoustic match score for each speech hypothesis comprises an estimate of the closeness of a match between the acoustic model of the speech hypothesis and the sequence of coded representations of the utterance. A translation match score for each speech hypothesis comprises an estimate of the probability of occurrence of the speech hypothesis given the occurrence of the source text. A hypothesis score for each hypothesis comprises a combination of the acoustic match score and the translation match score.Type: GrantFiled: May 21, 1992Date of Patent: March 8, 1994Assignee: International Business Machines CorporationInventors: Peter F. Brown, Stephen A. Della Pietra, Vincent J. Della Pietra, Frederick Jelinek, Robert L. Mercer
-
Patent number: 5267345Abstract: A language generator for a speech recognition apparatus scores a word-series hypothesis by combining individual scores for each word in the hypothesis. The hypothesis score for a single word comprises a combination of the estimated conditional probability of occurrence of a first class of words comprising the word being scored, given the occurrence of a context comprising the words in the word-series hypothesis other than the word being scored, and the estimated conditional probability of occurrence of the word being scored given the occurrence of the first class of words, and given the occurrence of the context. An apparatus and method are provided for classifying multiple series of words for the purpose of obtaining useful hypothesis scores in the language generator and speech recognition apparatus.Type: GrantFiled: February 10, 1992Date of Patent: November 30, 1993Assignee: International Business Machines CorporationInventors: Peter F. Brown, Stephen A. Della Pietra, Vincent J. Della Pietra, Robert L. Mercer, Philip S. Resnik, Stanley S. Chen
-
Patent number: 5258909Abstract: A method of detecting and correcting an error in a string of information signals. When each information signal represents a word, the method detects and corrects spelling errors. The method detects and corrects an error which is a properly spelled word, but which is the wrong (not intended) word. For example, the method is capable of detecting and correcting a misspelling of "HORSE" as "HOUSE". In the spelling error detection and correction method, a first word in an input string of words is changed to form a second word different from a first word to form a candidate string of words. The spellings of the first word and the second word are in the spelling dictionary. The probability of occurrence of the input string of words is compared to the product of the probability of occurrence of the candidate string of words multiplied by the probability of misrepresenting the candidate string of words as the input string of words. If the former is greater than or equal to the latter, no correction is made.Type: GrantFiled: August 31, 1989Date of Patent: November 2, 1993Assignee: International Business Machines CorporationInventors: Frederick J. Damerau, Eric K. Mays, Robert L. Mercer
-
Patent number: 5165007Abstract: In a speech recognition system, apparatus and method for modelling words with label-based Markov models is disclosed. The modelling includes: entering a first speech input, corresponding to words in a vocabulary, into an acoustic processor which converts each spoken word into a sequence of standard labels, where each standard label corresponds to a sound type assignable to an interval of time; representing each standard label as a probabilistic model which has a plurality of states, at least one transition from a state to a state, and at least one settable output probability at some transitions; entering selected acoustic inputs into an acoustic processor which converts the selected acoustic inputs into personalized labels, each personalized label corresponding to a sound type assigned to an interval of time; and setting each output probability as the probability of the standard label represented by a given model producing a particular personalized label at a given transition in the given model.Type: GrantFiled: June 12, 1989Date of Patent: November 17, 1992Assignee: International Business Machines CorporationInventors: Lalit R. Bahl, Peter V. DeSouza, Robert L. Mercer, Michael A. Picheny
-
Patent number: 5033087Abstract: A continuous speech recognition system includes an automatic phonological rules generator which determines variations in the pronunciation of phonemes based on the context in which they occur. This phonological rules generator associates sequences of labels derived from vocalizations of a training text with respective phonemes inferred from the training text. These sequences are then annotated with their pheneme context from the training text and clustered into groups representing similar pronunciations of each phoneme. A decision tree is generated using the context information of the sequences to predict the clusters to which the sequences belong. The training data is processed by the decision tree to divide the sequences into leaf-groups representing similar pronunciations of each phoneme. The sequences in each leaf-group are clustered into sub-groups representing respectively different pronunciations of their corresponding phoneme in a give context. A Markov model is generated for each sub-group.Type: GrantFiled: March 14, 1989Date of Patent: July 16, 1991Assignee: International Business Machines Corp.Inventors: Lalit R. Bahl, Peter F. Brown, Peter V. DeSouza, Robert L. Mercer
-
Patent number: 4980918Abstract: A continuous speech recognition system having a speech processor and a word recognition computer subsystem, characterized by an element for developing a graph for confluent links between confluent nodes; an element for developing a graph of boundary links between adjacent words; an element for storing an inventory of confluent links and boundary links as a coding inventory; an element for converting an unknown utterance into an encoded sequence of confluent links and boundary links corresponding to recognition sequences stored in the word recognition subsystem recognition vocabulary for speech recognition. The invention also includes a method for achieving continouous speech recognition by characterizing speech as a sequence of confluent links which are matched with candidate words. The invention also applies to isolated word speech recognition as with continuous speech recognition, except that in such case there are no boundary links.Type: GrantFiled: May 9, 1985Date of Patent: December 25, 1990Assignee: International Business Machines CorporationInventors: Lalit R. Bahl, Paul S. Cohen, Robert L. Mercer
-
Patent number: 4977599Abstract: Apparatus and method for constructing word baseforms which can be matched against a string of generated acoustic labels. A set of phonetic phone machines are formed, wherein each phone machine has (i) a plurality of states, (ii) a plurality of transitions each of which extends from a state to a state, (iii) a stored probability for each transition, and (iv) stored label output probabilities, each label output probability corresponding to the probability of each phone machine producing a corresponding label. The set of phonetic machines is formed to include a subset of onset phone machines. The stored probabilities of each onset phone macine correspond to at least one phonetic element being uttered at the beginning of a speech segment. The set of phonetic machines is formed to include a subset of trailing phone machines. The stored probabilities of each trailing phone machine correspond to at least one single phonetic element being uttered at the end of a speech segment.Type: GrantFiled: December 15, 1988Date of Patent: December 11, 1990Assignee: International Business Machines CorporationInventors: Lalit R. Bahl, Peter V. DeSouza, Robert L. Mercer, Michael A. Picheny
-
Patent number: 4882759Abstract: Apparatus and method for synthesizing word baseforms for words not spoken during a training session, wherein each synthesized baseform represents a series of models from a first set of models, which include: (a) uttering speech during a training session and representing the uttered speech as a sequence of models from a second set of models; (b) for each of at least some of the second set models spoken in a given phonetic model context during the training session, storing a respective string of first set models; and (c) constructing a word baseform of first set models for a word not spoken during the training session, including the step of representing each piece of a word that corresponds to a second set model in a given context by the stored respective string, if any, corresponding thereto.Type: GrantFiled: April 18, 1986Date of Patent: November 21, 1989Assignee: International Business Machines CorporationInventors: Lalit R. Bahl, Peter V. deSouza, Robert L. Mercer, Michael A. Picheny
-
Patent number: 4852173Abstract: In order to determine a next event based upon available data, a binary decision tree is constructed having true or false questions at each node and a probability distribution of the unknown next event based upon available data at each leaf. Starting at the root of the tree, the construction process proceeds from node-to-node towards a leaf by answering the question at each node encountered and following either the true or false path depending upon the answer. The questions are phrased in terms of the available data and are designed to provide as much information as possible about the next unknown event. The process is particularly useful in speech recognition when the next word to be spoken is determined on the basis of the previously spoken words.Type: GrantFiled: October 29, 1987Date of Patent: July 25, 1989Assignee: International Business Machines CorporationInventors: Lalit R. Bahl, Peter F. Brown, Peter V. deSouza, Robert L. Mercer
-
Patent number: 4833712Abstract: In a system that (i) defines each word in a vocabulary by a fenemic baseform of fenemic phones, (ii) defines an alphabet of composite phones each of which corresponds to at least one fenemic phone, and (iii) generates a string of fenemes in response to speech input, the method provides for converting a word baseform comprised of fenemic phones into a stunted word baseform of composite phones by (a) replacing each fenemic phone in the fenemic phone word baseform by the composite phone corresponding thereto; and (b) merging together at least one pair of adjacent composite phones by a single composite phone where the adverse effect of the merging is below a predefined threshold.Type: GrantFiled: May 29, 1985Date of Patent: May 23, 1989Assignee: International Business Machines CorporationInventors: Lalit R. Bahl, Peter V. DeSouza, Robert L. Mercer, Michael A. Picheny
-
Patent number: 4827521Abstract: In a word, or speech, recognition system for decoding a vocabulary word from outputs selected from an alphabet of outputs in response to a communicated word input wherein each word in the vocabulary is represented by a baseform of at least one probabilistic finite state model and wherein each probabilistic model has transition probability items and output probability items and wherein a value is stored for each of at least some probability items, the present invention relates to apparatus and method for determining probability values for probability items by biassing at least some of the stored values to enhance the likelihood that outputs generated in response to communication of a known word input are produced by the baseform for the known word relative to the respective likelihood of the generated outputs being produced by the baseform for at least one other word.Type: GrantFiled: March 27, 1986Date of Patent: May 2, 1989Assignee: International Business Machines CorporationInventors: Lalit R. Bahl, Peter F. Brown, Peter V. deSouza, Robert L. Mercer
-
Patent number: 4819271Abstract: The present invention relates to apparatus and method for segmenting multiple utterances of a vocabulary word in a consistent and coherent manner and determining a Markov model sequence for each segment. A fenemic Markov model corresponds to each label.Type: GrantFiled: December 16, 1987Date of Patent: April 4, 1989Assignee: International Business Machines CorporationInventors: Lalit R. Bahl, Peter V. DeSouza, Robert L. Mercer, Michael A. Picheny
-
Patent number: 4817156Abstract: Apparatus and method for training the statistics of a Markov Model speech recognizer to a subsequent speaker who utters part of a training text after the recognizer has been trained for the statistics of a reference speaker who utters a full training text. Where labels generated by an acoustic processor in response to uttered speech serve as outputs for Markov models, the present apparatus and method determine label output probabilities at transitions in the Markov models corresponding to the subsequent speaker where there is sparse training data. Specifically, label output probabilities for the subsequent speaker are re-parameterized based on confusion matrix entries having values indicative of the similarity between an lth label output of the subsequent speaker and a kth label output for the reference speaker.Type: GrantFiled: August 10, 1987Date of Patent: March 28, 1989Assignee: International Business Machines CorporationInventors: Lalit R. Bahl, Robert L. Mercer, David Nahamoo
-
Patent number: 4759068Abstract: Speech recognition is improved by splitting each feneme string at a consistent point into a left portion and a right portion. The present invention addresses the problem of constructing fenemic baseforms which take into account variations in pronunciation of words from one utterance thereof to another. Specifically, the invention relates to a method of constructing a fenemic baseform for a word in a vocabulary of word segments including the steps of: (a) transforming multiple utterances of the word into respective strings of fenemes; (b) defining a set of fenemic Markov model phone machines; (c) determining the best single phone machine P.sub.1 for producing the multiple feneme strings; (d) determining the best two phone baseform of the form P.sub.1 P.sub.2 or P.sub.2 P.sub.Type: GrantFiled: May 29, 1985Date of Patent: July 19, 1988Assignee: International Business Machines CorporationInventors: Lalit R. Bahl, Peter V. DeSouza, Robert L. Mercer, Michael A. Picheny
-
Patent number: 4741036Abstract: In a speech recognition system, discrimination between similar-sounding uttered words is improved by weighting the probability vector data stored for the Markov model representing the reference word sequence of phones. The weighting vector is derived for each reference word by comparing similar sounding utterances using Viterbi alignment and multivariate analysis which maximizes the differences between correct and incorrect recognition multivariate distributions.Type: GrantFiled: January 31, 1985Date of Patent: April 26, 1988Assignee: International Business Machines CorporationInventors: Lalit R. Bahl, Peter V. DeSouza, Robert L. Mercer