Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
oaioai:www.research.unipd.it:11577/2270023

Computation of Distances for Regular and Context-Free Probabilistic Languages

Authors
Publication date
1 January 2008
Publisher
ELSEVIER SCIENCE BV, PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS
Doi

    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

    Similar works

    Full text

    thumbnail-image

    Archivio istituzionale della ricerca - UniversitĂ  di Padova

    redirect
    oaioai:www.research.unipd.it:1157...
    Last time updated on 12/11/2016

    This paper was published in Archivio istituzionale della ricerca - UniversitĂ  di Padova.

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.