A Probabilistic Search for the Best Solution Among Partially Completed Candidates

Filip Ginter, Aleksandr Mylläri, Tapio Salakoski


Anthology ID:
W06-3605
Volume:
Proceedings of the Workshop on Computationally Hard Problems and Joint Inference in Speech and Language Processing
Month:
June
Year:
2006
Address:
New York City, New York
Editors:
Ryan McDonald, Charles Sutton, Hal Daumé III, Andrew McCallum, Fernando Pereira, Jeff Bilmes
Venue:
WS
SIG:
Publisher:
Association for Computational Linguistics
Note:
Pages:
33–40
Language:
URL:
https://aclanthology.org/W06-3605
DOI:
Bibkey:
Cite (ACL):
Filip Ginter, Aleksandr Mylläri, and Tapio Salakoski. 2006. A Probabilistic Search for the Best Solution Among Partially Completed Candidates. In Proceedings of the Workshop on Computationally Hard Problems and Joint Inference in Speech and Language Processing, pages 33–40, New York City, New York. Association for Computational Linguistics.
Cite (Informal):
A Probabilistic Search for the Best Solution Among Partially Completed Candidates (Ginter et al., 2006)
Copy Citation:
PDF:
https://aclanthology.org/W06-3605.pdf