Finite state transducer

노트

위키데이터

• ID : Q2166395

말뭉치

1. We present a Weighted Finite State Transducer Translation Template Model for statistical machine translation.
2. The approach we describe allows us to implement each constituent distribution of the model as a weighted finite state transducer or acceptor.
3. A finite state transducer essentially is a finite state automaton that works on two (or more) tapes.
4. A finite-state transducer (FST) is a finite-state machine with two memory tapes, following the terminology for Turing machines: an input tape and an output tape.
5. * that can be implemented as finite-state transducers are called rational relations.
6. Finite-state transducers are often used for phonological and morphological analysis in natural language processing research and applications.
7. Finite State Transducers can be weighted, where each transition is labelled with a weight in addition to the input and output labels.
8. In this article, we apply a hierarchical pipeline concept that composes Weighted Finite-State Transducers (WFST) together.
9. Weighted Finite-State Transducers WFST is good at modeling HMM and solving state machine problems.
10. A finite-state transducer (FST) has arcs labeling the input and output labels.
11. We can represent a rewrite rule as a regular relation and thus we can build a corresponding finite-state transducer.
12. So far we’ve learned that each rewrite rule is a binary regular string relation and that these relations can be represented by finite-state transducers.
13. We’ve seen how the rewrite rules can be represented as regular string relations which on the other hand have an equivalent formalism namely the finite-state transducers.
14. We introduce a framework for automatic differentiation with weighted finite-state transducers (WFSTs) allowing them to be used dynamically at training time.
15. One of the key ideas in this technology is to separate processing into several stages, in ``cascaded finite-state transducers.
16. In a finite-state transducer, an output entity is constructed when final states are reached, e.g., a representation of the information in a phrase.
17. In a cascaded finite-state transducer, there are different finite-state transducers at different stages.

메타데이터

위키데이터

• ID : Q2166395