Empirical Lower Bounds on the Complexity of Translational Equivalence
- Anthology ID:
- P06-1123
- Volume:
- Proceedings of the 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics
- Month:
- July
- Year:
- 2006
- Address:
- Sydney, Australia
- Editors:
- Nicoletta Calzolari, Claire Cardie, Pierre Isabelle
- Venues:
- COLING | ACL
- SIG:
- Publisher:
- Association for Computational Linguistics
- Note:
- Pages:
- 977–984
- Language:
- URL:
- https://aclanthology.org/P06-1123
- DOI:
- 10.3115/1220175.1220298
- Cite (ACL):
- Benjamin Wellington, Sonjia Waxmonsky, and I. Dan Melamed. 2006. Empirical Lower Bounds on the Complexity of Translational Equivalence. In Proceedings of the 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics, pages 977–984, Sydney, Australia. Association for Computational Linguistics.
- Cite (Informal):
- Empirical Lower Bounds on the Complexity of Translational Equivalence (Wellington et al., COLING-ACL 2006)
- PDF:
- https://preview.aclanthology.org/teach-a-man-to-fish/P06-1123.pdf