Patents by Inventor Fernando Carlos Neves Pereira

Fernando Carlos Neves Pereira 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).

  • Systems and methods for determinizing and minimizing a finite state transducer for pattern recognition
    Patent number: 6456971
    Abstract: A pattern recognition system and method for optimal reduction of redundancy and size of a weighted and labeled graph presents receiving speech signals, converting the speech signals into word sequence, interpreting the word sequences in a graph where the graph is labeled with word sequences and weighted with probabilities and determinizing the graph by removing redundant word sequences. The size of the graph can also be minimized by collapsing some nodes of the graph in a reverse determinizing manner. The graph can further be tested for determinizability to determine if the graph can be determinized. The resulting word sequence in the graph may be shown in a display device so that recognition of speech signals can be demonstrated.
    Type: Grant
    Filed: October 27, 2000
    Date of Patent: September 24, 2002
    Assignee: AT&T Corp.
    Inventors: Mehryar Mohri, Fernando Carlos Neves Pereira, Michael Dennis Riley
  • Systems and methods for determinization and minimization a finite state transducer for speech recognition
    Patent number: 6243679
    Abstract: A pattern recognition system and method for optimal reduction of redundancy and size of a weighted and labeled graph presents receiving speech signals, converting the speech signals into word sequences, interpreting the word sequences in a graph where the graph is labeled with word sequences and weighted with probabilities and determinizing the graph by removing redundant word sequences. The size of the graph can also be minimized by collapsing some nodes of the graph in a reverse determinizing manner. The graph can further be tested for determinizability to determine if the graph can be determinized. The resulting word sequence in the graph may be shown in a display device so that recognition of speech signals can be demonstrated.
    Type: Grant
    Filed: October 2, 1998
    Date of Patent: June 5, 2001
    Assignee: AT&T Corporation
    Inventors: Mehryar Mohri, Fernando Carlos Neves Pereira, Michael Dennis Riley
  • Grapheme-to-phoneme conversion of digit strings using weighted finite state transducers to apply grammar to powers of a number basis
    Patent number: 5781884
    Abstract: The present invention provides a method of expanding a string of one or more digits to form a verbal equivalent using weighted finite state transducers. The method provides a grammatical description that expands the string into a numeric concept represented by a sum of powers of a base number system, compiles the grammatical description into a first weighted finite state transducer, provides a language specific grammatical description for verbally expressing the numeric concept, compiles the language specific grammatical description into a second weighted finite state transducer, composes the first and second finite state transducers to form a third weighted finite state transducer from which the verbal equivalent of the string can be synthesized, and synthesizes the verbal equivalent from the third weighted finite state transducer.
    Type: Grant
    Filed: November 22, 1996
    Date of Patent: July 14, 1998
    Assignee: Lucent Technologies, Inc.
    Inventors: Fernando Carlos Neves Pereira, Michael Dennis Riley, Richard William Sproat