TY - GEN
T1 - Parsing with dynamic continuized CCG
AU - White, Michael
AU - Needle, Jordan
AU - Charlow, Simon
AU - Bumford, Dylan
N1 - Funding Information:
We thank Carl Pollard, Scott Martin, Mark Steedman, the OSU Clippers and Synners Groups, the Midwest Speech and Language Days 2016 audience and the anonymous reviewers for helpful comments and discussion. This work was supported in part by a Targeted Investment in Excellence Grant from OSU Arts & Sciences and by NSF grant IIS-1319318.
Funding Information:
We thank Carl Pollard, Scott Martin, Mark Steed-man, the OSU Clippers and Synners Groups, the Midwest Speech and Language Days 2016 audience and the anonymous reviewers for helpful comments and discussion. This work was supported in part by a Targeted Investment in Excellence Grant from OSU Arts & Sciences and by NSF grant IIS-1319318.
Publisher Copyright:
© 2017 Association for Computational Linguistics.
PY - 2017
Y1 - 2017
N2 - We present an implemented method of parsing with Combinatory Categorial Grammar (CCG) that for the first time derives the exceptional scope behavior of indefinites in a principled and plausibly practical way. The account implements Charlow’s (2014) monadic approach to dynamic semantics, in which indefinites’ exceptional scope taking follows from the way the side effect of introducing a discourse referent survives the process of delimiting the scope of true quantifiers in a continuized grammar. To efficiently parse with this system, we extend Barker and Shan’s (2014) method of parsing with continuized grammars to only invoke monadic lifting and lowering where necessary, and define novel normal form constraints on lifting and lowering to avoid spurious ambiguities. We also integrate Steedman’s (2000) CCG for deriving basic predicate-argument structure and enrich it with a method of lexicalizing scope island constraints. We argue that the resulting system improves upon Steedman’s CCG in terms of theoretical perspicuity and empirical coverage while retaining many of its attractive computational properties.
AB - We present an implemented method of parsing with Combinatory Categorial Grammar (CCG) that for the first time derives the exceptional scope behavior of indefinites in a principled and plausibly practical way. The account implements Charlow’s (2014) monadic approach to dynamic semantics, in which indefinites’ exceptional scope taking follows from the way the side effect of introducing a discourse referent survives the process of delimiting the scope of true quantifiers in a continuized grammar. To efficiently parse with this system, we extend Barker and Shan’s (2014) method of parsing with continuized grammars to only invoke monadic lifting and lowering where necessary, and define novel normal form constraints on lifting and lowering to avoid spurious ambiguities. We also integrate Steedman’s (2000) CCG for deriving basic predicate-argument structure and enrich it with a method of lexicalizing scope island constraints. We argue that the resulting system improves upon Steedman’s CCG in terms of theoretical perspicuity and empirical coverage while retaining many of its attractive computational properties.
UR - http://www.scopus.com/inward/record.url?scp=85119443738&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85119443738&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:85119443738
T3 - TAG+ 2017 - 13th International Workshop on Tree Adjoining Grammars and Related Formalisms, Proceedings
SP - 71
EP - 83
BT - TAG+ 2017 - 13th International Workshop on Tree Adjoining Grammars and Related Formalisms, Proceedings
PB - Association for Computational Linguistics (ACL)
T2 - 13th International Workshop on Tree Adjoining Grammars and Related Formalisms, TAG+ 2017
Y2 - 4 September 2017 through 6 September 2017
ER -