Patents by Inventor Andre Kempe

Andre Kempe 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).

  • Method and apparatus for extracting short runs of ambiguity from finite state transducers
    Publication number: 20020152062
    Abstract: A method extracts all “short” ambiguity from an input FST (i.e., ambiguities of one arc in length). The method factors the input FST into a first factor and a second factor such that the second factor contains all ambiguity that is one arc long, and the first factor contains all other parts of the input FST. The method a priori prevents the creation of some redundant intermediate symbols.
    Type: Application
    Filed: December 18, 2000
    Publication date: October 17, 2002
    Applicant: Xerox Corporation
    Inventor: Andre Kempe
  • Method and apparatus for reducing the intermediate alphabet occurring between cascaded finite state transducers
    Publication number: 20020120437
    Abstract: A method reduces the number of diacritics and other intermediate symbols occurring between two factors that result from any factorization such as extraction of infinite ambiguity, factorization of finitely ambiguous finite-state transducer, or bimachine factorization. The method a posteriori removes all redundant intermediate symbols. The method can be used with any two finite-state transducers (FSTs) that operate in a cascade. With longer cascades, the method can be applied pair-wise to all FSTs, preferably starting from the last pair.
    Type: Application
    Filed: December 18, 2000
    Publication date: August 29, 2002
    Applicant: Xerox Corporation
    Inventor: Andre Kempe
  • Method and apparatus for aligning ambiguity in finite state transducers
    Publication number: 20020046017
    Abstract: A method prepares a functional finite-state transducer (FST) with an epsilon or empty string on the input side for factorization into a bimachine. The method creates a left-deterministic input finite-state automation (FSA) by extracting and left-determinizing the input side of the functional FST. Subsequently, the corresponding sub-paths in the FST are identified for each arc in the left-deterministic FST and aligned.
    Type: Application
    Filed: December 18, 2000
    Publication date: April 18, 2002
    Applicant: Xerox Corporation
    Inventor: Andre Kempe