Abstract
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. © 2018 Association for Computational Linguistics.
| Original language | English |
|---|---|
| Title of host publication | NAACL HLT 2018 - Lexical and Computational Semantics (*SEM 2018) - Proceedings of the 7th Conference |
| Editors | Malvina Nissim, Jonathan Berant, Alessandro Lenci |
| Place of Publication | Stroudsburg, PA |
| Publisher | Association for Computational Linguistics |
| Pages | 124-129 |
| Number of pages | 6 |
| ISBN (Electronic) | 9781948087223 |
| DOIs | |
| Publication status | Published - Jun 2018 |
| Externally published | Yes |
| Event | 7th Joint Conference on Lexical and Computational Semantics (SEM 2018), co-located with NAACL 2018 - New Orleans, United States Duration: 5 Jun 2018 → 6 Jun 2018 https://sites.google.com/view/starsem2018 |
Publication series
| Name | NAACL HLT - Lexical and Computational Semantics, SEM, Proceedings of the Conference |
|---|
Conference
| Conference | 7th Joint Conference on Lexical and Computational Semantics (SEM 2018), co-located with NAACL 2018 |
|---|---|
| Abbreviated title | *SEM 2018 |
| Place | United States |
| City | New Orleans |
| Period | 5/06/18 → 6/06/18 |
| Internet address |
Publisher's Copyright Statement
- This full text is made available under CC-BY 4.0. https://creativecommons.org/licenses/by/4.0/