Computing the Most Probable String with a Probabilistic Finite State Machine - LINA - Equipe Traitement Automatique du Langage Naturel Access content directly
Conference Papers Year : 2013

Computing the Most Probable String with a Probabilistic Finite State Machine

Domains

Artificial Intelligence [cs.AI]

Colin De La Higuera  : Connect in order to contact the contributor

https://hal.science/hal-00833421

Submitted on : Wednesday, June 12, 2013-4:34:17 PM

Last modification on : Friday, January 5, 2024-3:23:20 AM

No file

Dates and versions

hal-00833421 , version 1 (12-06-2013)

Identifiers

  • HAL Id : hal-00833421 , version 1

Cite

Colin de La Higuera, Jose Oncina. Computing the Most Probable String with a Probabilistic Finite State Machine. Proceedings of FSMNLP, 2013, United Kingdom. ⟨hal-00833421⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

UNIV-NANTES CNRS LINA LINA-TALN LS2N NANTES-UNIVERSITE
72 View
0 Download

Share

Gmail Facebook X LinkedIn More