Montague Grammar Induction
Gene Kim, Aaron Steven White
October 2020 

We propose a computational modeling framework for inducing combinatory categorial grammars from arbitrary behavioral data. This framework provides the analyst fine-grained control over the assumptions that the induced grammar should conform to: (i) what the primitive types are; (ii) how complex types are constructed; (iii) what set of combinators can be used to combine types; and (iv) whether (and to what) the types of some lexical items should be fixed. In a proof-of-concept experiment, we deploy our framework for use in distributional analysis. We focus on the relationship between s(emantic)-selection and c(ategory)-selection, using as input a lexicon-scale acceptability judgment dataset focused on English verbs' syntactic distribution (the MegaAcceptability dataset) and enforcing standard assumptions from the semantics literature on the induced grammar.

Format:	[ pdf ]
Reference:	lingbuzz/005498 (please use that when you cite this article)
Published in:	Semantics and Linguistic Theory 30
keywords:	grammar induction, combinatory categorial grammar, semantic selection, experimental semantics, computational semantics, experimental syntax, computational syntax, semantics, syntax
previous versions:	v2 [October 2020] v1 [October 2020]
Downloaded:	1036 times

 

[ edit this article | back to article list ]