Introduction to algorithms
Computation of Probabilities for an Island-Driven Parser
IEEE Transactions on Pattern Analysis and Machine Intelligence
Optimal Probabilistic Evaluation Functions for Search Controlled by Stochastic Context-Free Grammars
IEEE Transactions on Pattern Analysis and Machine Intelligence
An efficient probabilistic context-free parsing algorithm that computes prefix probabilities
Computational Linguistics
Statistical methods for speech recognition
Statistical methods for speech recognition
Computing the relative entropy between regular tree languages
Information Processing Letters
Foundations of statistical natural language processing
Foundations of statistical natural language processing
Statistical Language Learning
Elements of the Theory of Computation
Elements of the Theory of Computation
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The consensus string problem and the complexity of comparing hidden Markov models
Journal of Computer and System Sciences - Computational biology 2002
Weighted deductive parsing and Knuth's algorithm
Computational Linguistics
Pattern Classification (2nd Edition)
Pattern Classification (2nd Edition)
Computation of the probability of initial substring generation by stochastic context-free grammars
Computational Linguistics
Statistical properties of probabilistic context-free grammars
Computational Linguistics
Relating probabilistic grammars and automata
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Probabilistic Finite-State Machines-Part I
IEEE Transactions on Pattern Analysis and Machine Intelligence
Introduction to probabilistic automata (Computer science and applied mathematics)
Introduction to probabilistic automata (Computer science and applied mathematics)
A General Technique to Train Language Models on Language Models
Computational Linguistics
Speech and Language Processing (2nd Edition)
Speech and Language Processing (2nd Edition)
Applying Probability Measures to Abstract Languages
IEEE Transactions on Computers
PReMo: an analyzer for probabilistic recursive models
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
On the computation of some standard distances between probabilistic automata
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Recursive markov chains, stochastic grammars, and monotone systems of nonlinear equations
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Efficient computation of the relative entropy of probabilistic automata
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Parsing algorithms based on tree automata
IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
Why synchronous tree substitution grammars?
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
An alternative to synchronous tree substitution grammars*
Natural Language Engineering
Intersection for weighted formalisms
FSMNLP '11 Proceedings of the 9th International Workshop on Finite State Methods and Natural Language Processing
Detecting malicious tweets in trending topics using a statistical analysis of language
Expert Systems with Applications: An International Journal
| Hi-index | 5.23 |
Several mathematical distances between probabilistic languages have been investigated in the literature, motivated by applications in language modeling, computational biology, syntactic pattern matching and machine learning. In most cases, only pairs of probabilistic regular languages were considered. In this paper we extend the previous results to pairs of languages generated by a probabilistic context-free grammar and a probabilistic finite automaton.