Files in this item
Computation of distances for regular and context-free probabilistic languages
Item metadata
dc.contributor.author | Nederhof, Mark Jan | |
dc.contributor.author | Satta, Giorgio | |
dc.date.accessioned | 2011-01-06T14:24:03Z | |
dc.date.available | 2011-01-06T14:24:03Z | |
dc.date.issued | 2008-05-01 | |
dc.identifier.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 | en |
dc.identifier.issn | 0304-3975 | |
dc.identifier.other | PURE: 608696 | |
dc.identifier.other | PURE UUID: b974c875-947d-4a23-a26f-e71ab60a58bb | |
dc.identifier.other | WOS: 000257466600008 | |
dc.identifier.other | Scopus: 45849119469 | |
dc.identifier.other | ORCID: /0000-0002-1845-6829/work/46002719 | |
dc.identifier.uri | https://hdl.handle.net/10023/1658 | |
dc.description.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. | |
dc.format.extent | 20 | |
dc.language.iso | eng | |
dc.relation.ispartof | Theoretical Computer Science | en |
dc.rights | This is an author version of an article published in Theoretical Computer Science 395 (2008), available at http://www.sciencedirect.com | en |
dc.subject | Probabilistic context-free languages | en |
dc.subject | Probabilistic finite automata | en |
dc.subject | Probabilistic language distances | en |
dc.subject | Language entropy | en |
dc.subject | Kullback-Leibler divergence | en |
dc.subject | Relative entropy | en |
dc.subject | Models | en |
dc.subject | QA75 Electronic computers. Computer science | en |
dc.subject.lcc | QA75 | en |
dc.title | Computation of distances for regular and context-free probabilistic languages | en |
dc.type | Journal article | en |
dc.description.version | Postprint | en |
dc.contributor.institution | University of St Andrews. School of Computer Science | en |
dc.identifier.doi | https://doi.org/10.1016/j.tcs.2008.01.010 | |
dc.description.status | Peer reviewed | en |
dc.identifier.url | http://www.scopus.com/inward/record.url?scp=45849119469&partnerID=8YFLogxK | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.