Computation of distances for regular and context-free probabilistic languages
Abstract
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.
Citation
Nederhof , M J & Satta , G 2008 , ' Computation of distances for regular and context-free probabilistic languages ' , Theoretical Computer Science , vol. 395 , no. 2-3 , pp. 235-254 . https://doi.org/10.1016/j.tcs.2008.01.010
Publication
Theoretical Computer Science
Status
Peer reviewed
ISSN
0304-3975Type
Journal article
Rights
This is an author version of an article published in Theoretical Computer Science 395 (2008), available at http://www.sciencedirect.com
Collections
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.