Probabilistic finite-state machines - part I
IEEE Transactions on Pattern Analysis and Machine Intelligence2005Vol. 27(7), pp. 1013–1025
Citations Over TimeTop 1% of 2005 papers
Abstract
Probabilistic finite-state machines are used today in a variety of areas in pattern recognition or in fields to which pattern recognition is linked. In Part I of this paper, we surveyed these objects and studied their properties. In this Part II, we study the relations between probabilistic finite-state automata and other well-known devices that generate strings like hidden Markov models and n-grams and provide theorems, algorithms, and properties that represent a current state of the art of these objects.
Related Papers
- Pre-Translation for Neural Machine Translation.(2016)
- → Evaluation of English–Slovak Neural and Statistical Machine Translation(2021)21 cited
- → Machine Translation Using Deep Learning: A Comparison(2020)4 cited
- → Finite-State Machines(2022)1 cited
- → Research on machine analogy translation technology based on machine learning(2023)