Polarity Computations in Flexible Categorial Grammar
Hai Hu, Larry Moss · 2018
This paper shows how to take parse trees in CCG and algorithmically find the polarities of all the constituents.Our work uses the wellknown 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.