What is the Minimal Set of Fragments that Achieves Maximal Parse Accuracy?

Rens Bod


Anthology ID:
P01-1010
Volume:
Proceedings of the 39th Annual Meeting of the Association for Computational Linguistics
Month:
July
Year:
2001
Address:
Toulouse, France
Venue:
ACL
SIG:
Publisher:
Association for Computational Linguistics
Note:
Pages:
66–73
Language:
URL:
https://aclanthology.org/P01-1010
DOI:
10.3115/1073012.1073022
Bibkey:
Cite (ACL):
Rens Bod. 2001. What is the Minimal Set of Fragments that Achieves Maximal Parse Accuracy?. In Proceedings of the 39th Annual Meeting of the Association for Computational Linguistics, pages 66–73, Toulouse, France. Association for Computational Linguistics.
Cite (Informal):
What is the Minimal Set of Fragments that Achieves Maximal Parse Accuracy? (Bod, ACL 2001)
Copy Citation:
PDF:
https://preview.aclanthology.org/naacl-24-ws-corrections/P01-1010.pdf