This paper shows how to take parse trees in CCG and algorithmically find the polarities of all the constituents. Our work uses the well-known polarization principle corresponding to function application, and we have extended this with principles for type raising and composition. We provide an algorithm, extending the polarity marking algorithm of van Benthem. We discuss how our system works in practice, taking input from the C&C parser.
CITATION STYLE
Hu, H., & Moss, L. S. (2018). Polarity Computations in Flexible Categorial Grammar. In NAACL HLT 2018 - Lexical and Computational Semantics, SEM 2018, Proceedings of the 7th Conference (pp. 124–129). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/s18-2015
Mendeley helps you to discover research relevant for your work.