Finding the Most Probable String and the Consensus String: an Algorithmic Study

Colin de la Higuera, Jose Oncina


Anthology ID:
W11-2904
Volume:
Proceedings of the 12th International Conference on Parsing Technologies
Month:
October
Year:
2011
Address:
Dublin, Ireland
Venues:
IWPT | WS
SIG:
SIGPARSE
Publisher:
Association for Computational Linguistics
Note:
Pages:
26–36
Language:
URL:
https://aclanthology.org/W11-2904
DOI:
Bibkey:
Cite (ACL):
Colin de la Higuera and Jose Oncina. 2011. Finding the Most Probable String and the Consensus String: an Algorithmic Study. In Proceedings of the 12th International Conference on Parsing Technologies, pages 26–36, Dublin, Ireland. Association for Computational Linguistics.
Cite (Informal):
Finding the Most Probable String and the Consensus String: an Algorithmic Study (de la Higuera & Oncina, 2011)
Copy Citation:
PDF:
https://aclanthology.org/W11-2904.pdf