A Convexity-based Generalization of Viterbi for Non-Deterministic Weighted Automata

Marc Dymetman


Anthology ID:
W13-1804
Volume:
Proceedings of the 11th International Conference on Finite State Methods and Natural Language Processing
Month:
July
Year:
2013
Address:
St Andrews, Scotland
Venues:
FSMNLP | WS
SIG:
SIGFSM
Publisher:
Association for Computational Linguistics
Note:
Pages:
25–29
Language:
URL:
https://aclanthology.org/W13-1804
DOI:
Bibkey:
Cite (ACL):
Marc Dymetman. 2013. A Convexity-based Generalization of Viterbi for Non-Deterministic Weighted Automata. In Proceedings of the 11th International Conference on Finite State Methods and Natural Language Processing, pages 25–29, St Andrews, Scotland. Association for Computational Linguistics.
Cite (Informal):
A Convexity-based Generalization of Viterbi for Non-Deterministic Weighted Automata (Dymetman, 2013)
Copy Citation:
PDF:
https://aclanthology.org/W13-1804.pdf