Transformation of modular finite state transducers
AssigneeMicrosoft Corporation
InventorsSteven E. Lucco, David E. Langworthy, Giovanni M. Della-Libera
Life of this patent
Estimating the term…
Abstract
A Q Framework, or QFX for short, is provided for performing efficient tree transformation in a generalized manner that achieves preservation of action semantics for FSTs that support action information in their representations across a diverse set of types of representations for FSTs. Among other features, the QFX also enables the preservation of ordered and unordered nest information while performing tree transformation, supports the transformation of non-deterministic data structures to a deterministic data structure and enables intersection operations on machines having action semantics.
Claims20
A method for transforming at least one-data structure specifying at least one tree structure in a computing system to at least one modular finite state transducer (MFST), comprising:
- receiving at least one data structure onto a memory unit configured to include either ordered, unordered, or unordered and ordered information specifying at least one tree structure representing at least one finite state transducer (FST) including semantics for defining ordered and unordered information;
- and
- for any type of finite state machine (FSM) model represented by the at least one data structure, transforming the at least one data structure to at least one MFST while preserving the ordered and unordered information of the at least one data structure in the at least one MFST, wherein said transforming includes performing any of an intersection, union and complement operation, or performing any transformation operation that is reducible to any of an intersection, union and complement operation, on the at least one data structure, wherein it is determinable whether the resulting MFST accepts a non-empty input.
A transformation framework for transducing directed graph data structures representing finite state transducers (FSTs) to a modular finite state transducer (MFST) in a computing system, comprising:
- means for storing, on a memory unit, a plurality of directed graph data structures of varying types configured to include either ordered, unordered, or unordered and ordered information for representing FSTs in a computing system including ordered and unordered semantics information of the plurality of directed graph data structures;
- and
- a transducer that analyzes the plurality of directed graph data structures based on a pre-defined tree grammar and transduces the plurality of directed graph data structures to at least one MFST while preserving the ordered and unordered semantics information of the plurality of directed graph data structures, wherein the transducer performs any of intersect, complement and union operations, or performs any transformations that are reducible to any of intersection, union and complement operations, on the plurality of directed graph data structures, wherein it is determinable whether the resulting MFST accepts a non-empty input.
A compiler for transforming directed graph data structures representing finite state transducers (FSTs) to a modular finite state transducer (MFST) in a computing system, comprising:
- a plurality of directed graph data structures stored on a memory unit and configured to include either ordered, unordered, or unordered and ordered information representing FSTs for processes in a computing system including ordered and unordered information defining ordered lists and unordered sets for the processes;
- and
- a transformation engine that analyzes the plurality of directed graph data structures based on a defined tree grammar and transduces the plurality of directed graph data structures to at least one MFST while preserving the ordered and unordered information of the plurality of directed graph data structures, wherein the transformation engine performs any of intersect, complement and union operations, or performs any transformations that are reducible to any of intersection, union and complement operations, on the plurality of directed graph data structures to generate said at least one MFST, wherein it is determinable whether the resulting MFST accepts a non-empty input.
Dependencies are inferred from the claim text.