Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.authorNederhof, Mark Jan
dc.contributor.authorSatta, Giorgio
dc.date.accessioned2011-01-06T14:24:03Z
dc.date.available2011-01-06T14:24:03Z
dc.date.issued2008-05-01
dc.identifier.citationNederhof , 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.010en
dc.identifier.issn0304-3975
dc.identifier.otherPURE: 608696
dc.identifier.otherPURE UUID: b974c875-947d-4a23-a26f-e71ab60a58bb
dc.identifier.otherWOS: 000257466600008
dc.identifier.otherScopus: 45849119469
dc.identifier.otherORCID: /0000-0002-1845-6829/work/46002719
dc.identifier.urihttp://hdl.handle.net/10023/1658
dc.description.abstractSeveral 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.extent20
dc.language.isoeng
dc.relation.ispartofTheoretical Computer Scienceen
dc.rightsThis is an author version of an article published in Theoretical Computer Science 395 (2008), available at http://www.sciencedirect.comen
dc.subjectProbabilistic context-free languagesen
dc.subjectProbabilistic finite automataen
dc.subjectProbabilistic language distancesen
dc.subjectLanguage entropyen
dc.subjectKullback-Leibler divergenceen
dc.subjectRelative entropyen
dc.subjectModelsen
dc.subjectQA75 Electronic computers. Computer scienceen
dc.subject.lccQA75en
dc.titleComputation of distances for regular and context-free probabilistic languagesen
dc.typeJournal articleen
dc.description.versionPostprinten
dc.contributor.institutionUniversity of St Andrews.School of Computer Scienceen
dc.identifier.doihttps://doi.org/10.1016/j.tcs.2008.01.010
dc.description.statusPeer revieweden
dc.identifier.urlhttp://www.scopus.com/inward/record.url?scp=45849119469&partnerID=8YFLogxKen


This item appears in the following Collection(s)

Show simple item record