Communications of the ACM
IEEE Transactions on Pattern Analysis and Machine Intelligence
Grammatical interface for even linear languages based on control sets
Information Processing Letters
Crytographic limitations on learning Boolean formulae and finite automata
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Some Relations Among Stochastic Finite State Networks Used in Automatic Speech Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
On the computational complexity of approximating distributions by probabilistic automata
COLT '90 Proceedings of the third annual workshop on Computational learning theory
Learning context-free grammars from structural data in polynomial time
Theoretical Computer Science
Language learning from stochastic input
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
The minimum consistent DFA problem cannot be approximated within any polynomial
Journal of the ACM (JACM)
On the Computational Complexity of Approximating Distributions by Probabilistic Automata
Machine Learning - Computational learning theory
On the learnability of discrete distributions
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Statistical estimation of stochastic context-free grammars
Pattern Recognition Letters
Approximating grammar probabilities: solution of a conjecture
Journal of the ACM (JACM)
On the learnability and usage of acyclic probabilistic finite automata
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Machine Learning
IEEE Transactions on Pattern Analysis and Machine Intelligence
Learning deterministic even linear languages from positive examples
Theoretical Computer Science - Special issue on algorithmic learning theory
Predicting Protein Secondary Structure Using Stochastic Tree Grammars
Machine Learning - Special issue on learning with probabilistic representations
Statistical methods for speech recognition
Statistical methods for speech recognition
An Omnifont Open-Vocabulary OCR System for English and Arabic
IEEE Transactions on Pattern Analysis and Machine Intelligence
A design principles of a weighted finite-state transducer library
Theoretical Computer Science - Special issue on implementing automata
Inferring pure context-free languages from positive data
Acta Cybernetica
Stochastic Grammatical Inference of Text Database Structure
Machine Learning
Probabilistic Languages: A Review and Some Open Questions
ACM Computing Surveys (CSUR)
Automata, Languages, and Machines
Automata, Languages, and Machines
Defense of the ansatz for dynamical hierarchies
Artificial Life
Stochastic Inference of Regular Tree Languages
Machine Learning
Learning Subsequential Transducers for Pattern Recognition Interpretation Tasks
IEEE Transactions on Pattern Analysis and Machine Intelligence
Using Symbol Clustering to Improve Probabilistic Automaton Inference
ICGI '98 Proceedings of the 4th International Colloquium on Grammatical Inference
Improve the Learning of Subsequential Transducers by Using Alignments and Dictionaries
ICGI '00 Proceedings of the 5th International Colloquium on Grammatical Inference: Algorithms and Applications
Computation of Substring Probabilities in Stochastic Grammars
ICGI '00 Proceedings of the 5th International Colloquium on Grammatical Inference: Algorithms and Applications
Identification in the Limit with Probability One of Stochastic Deterministic Finite Automata
ICGI '00 Proceedings of the 5th International Colloquium on Grammatical Inference: Algorithms and Applications
Smoothing Probabilistic Automata: An Error-Correcting Approach
ICGI '00 Proceedings of the 5th International Colloquium on Grammatical Inference: Algorithms and Applications
Inference of Finite-State Transducers by Using Regular Grammars and Morphisms
ICGI '00 Proceedings of the 5th International Colloquium on Grammatical Inference: Algorithms and Applications
Stochastic Grammatical Inference with Multinomial Tests
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Shallow Parsing Using Probabilistic Grammatical Inference
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Probabilistic DFA Inference using Kullback-Leibler Divergence and Minimality
ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
Learning Stochastic Regular Grammars by Means of a State Merging Method
ICGI '94 Proceedings of the Second International Colloquium on Grammatical Inference and Applications
Inducing Probabilistic Grammars by Bayesian Model Merging
ICGI '94 Proceedings of the Second International Colloquium on Grammatical Inference and Applications
ICG! '96 Proceedings of the 3rd International Colloquium on Grammatical Inference: Learning Syntax from Sentences
Using knowledge to improve N-gram language modelling through the MGGI methodology
ICG! '96 Proceedings of the 3rd International Colloquium on Grammatical Inference: Learning Syntax from Sentences
Improving Probabilistic Grammatical Inference Core Algorithms with Post-processing Techniques
ICML '01 Proceedings of the Eighteenth International Conference on Machine Learning
SSPR '96 Proceedings of the 6th International Workshop on Advances in Structural and Syntactical Pattern Recognition
PAC Learning with Simple Examples
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
PAC Learning under Helpful Distributions
ALT '97 Proceedings of the 8th International Conference on Algorithmic Learning Theory
On the Convergence Rate of Good-Turing Estimators
COLT '00 Proceedings of the Thirteenth Annual Conference on Computational Learning Theory
Computational Complexity of Problems on Probabilistic Grammars and Transducers
ICGI '00 Proceedings of the 5th International Colloquium on Grammatical Inference: Algorithms and Applications
Equivalence and Reduction of Hidden Markov Models
Equivalence and Reduction of Hidden Markov Models
Shallow parsing using specialized hmms
The Journal of Machine Learning Research
Always Good Turing: Asymptotically Optimal Probability Estimation
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Practical experiments with regular approximation of context-free languages
Computational Linguistics - Special issue on finite-state methods in NLP
Learning dependency translation models as collections of finite-state head transducers
Computational Linguistics - Special issue on finite-state methods in NLP
Finite-state transducers in language and speech processing
Computational Linguistics
An empirical study of smoothing techniques for language modeling
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
PAC-learnability of Probabilistic Deterministic Finite State Automata
The Journal of Machine Learning Research
Probabilistic Finite-State Machines-Part I
IEEE Transactions on Pattern Analysis and Machine Intelligence
Parameter estimation for probabilistic finite-state transducers
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
A finite-state approach to machine translation
NAACL '01 Proceedings of the second meeting of the North American Chapter of the Association for Computational Linguistics on Language technologies
Machine Translation with Inferred Stochastic Finite-State Transducers
Computational Linguistics
Stochastic finite-state models for spoken language machine translation
NAACL-ANLP-EMTS '00 Proceedings of the 2000 NAACL-ANLP Workshop on Embedded machine translation systems - Volume 5
Architectures for speech-to-speech translation using finite-state models
S2S '02 Proceedings of the ACL-02 workshop on Speech-to-speech translation: algorithms and systems - Volume 7
Inference of finite-state transducers from regular languages
Pattern Recognition
Experiments on the application of IOHMMs to model financial returns series
IEEE Transactions on Neural Networks
Probabilistic Finite-State Machines-Part I
IEEE Transactions on Pattern Analysis and Machine Intelligence
Learning finite-state models for machine translation
Machine Learning
Probabilistic Context-Free Grammars Estimated from Infinite Distributions
IEEE Transactions on Pattern Analysis and Machine Intelligence
Inference of Stochastic Finite-State Transducers Using N-Gram Mixtures
IbPRIA '07 Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part II
ON THE STATISTICAL ESTIMATION OF STOCHASTIC FINITE-STATE TRANSDUCERS IN MACHINE TRANSLATION
Applied Artificial Intelligence
TWO GRAMMATICAL INFERENCE APPLICATIONS IN MUSIC PROCESSING
Applied Artificial Intelligence
Joining linguistic and statistical methods for Spanish-to-Basque speech translation
Speech Communication
Efficient Pruning of Probabilistic Automata
SSPR & SPR '08 Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Position Models and Language Modeling
SSPR & SPR '08 Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Statistical approaches to computer-assisted translation
Computational Linguistics
Multimodal interactive transcription of text images
Pattern Recognition
Estimating strictly piecewise distributions
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Maximum likelihood estimation of feature-based distributions
SIGMORPHON '10 Proceedings of the 11th Meeting of the ACL Special Interest Group on Computational Morphology and Phonology
pTest: an adaptive testing tool for concurrent software on embedded multicore processors
Proceedings of the Conference on Design, Automation and Test in Europe
Learning PDFA with asynchronous transitions
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
A lower bound for learning distributions generated by probabilistic automata
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
Formal and empirical grammatical inference
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Tutorial Abstracts of ACL 2011
GREAT: open source software for statistical machine translation
Machine Translation
Learnability of probabilistic automata via oracles
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
Hierarchical finite-state models for speech translation using categorization of phrases
CICLing'10 Proceedings of the 11th international conference on Computational Linguistics and Intelligent Text Processing
Stochastic K-TSS bi-languages for machine translation
FSMNLP '11 Proceedings of the 9th International Workshop on Finite State Methods and Natural Language Processing
Learning probabilistic automata: A study in state distinguishability
Theoretical Computer Science
An iterative multimodal framework for the transcription of handwritten historical documents
Pattern Recognition Letters
| Hi-index | 0.15 |
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{\hbox{-}}{\rm grams} and provide theorems, algorithms, and properties that represent a current state of the art of these objects.