Combinatory Categorial Grammar
A Combinatory Categorial Grammar is a Categorial Grammar that ...
- AKA: CCG.
- See: CCG Parser, PARC 700 Dependency Bank, Phrase Structure Grammar, Dependency Grammar, Combinatory Logic, Lambda Calculus, Mark Steedman, Anna Szabolcsi, Combinator.
References
2015
- (Wikipedia, 2015) ⇒ http://en.wikipedia.org/wiki/Combinatory_categorial_grammar Retrieved:2015-1-26.
- Combinatory categorial grammar (CCG) is an efficiently parsable, yet linguistically expressive grammar formalism. It has a transparent interface between surface syntax and underlying semantic representation, including predicate-argument structure, quantification and information structure. The formalism generates constituency-based structures (as opposed to dependency-based ones) and is therefore a type of phrase structure grammar (as opposed to a dependency grammar).
CCG relies on combinatory logic, which has the same expressive power as the lambda calculus, but builds its expressions differently. The first linguistic and psycholinguistic arguments for basing the grammar on combinators were put forth by Steedman and Szabolcsi. More recent prominent proponents of the approach are Jacobson and Baldridge.
For example, the combinator B (the compositor) is useful in creating long-distance dependencies, as in "Who do you think Mary is talking about?" and the combinator W (the duplicator) is useful as the lexical interpretation of reflexive pronouns, as in "Mary talks about herself". Together with I (the identity mapping) and C (the permutator) these form a set of primitive, non-interdefinable combinators. Jacobson interprets personal pronouns as the combinator I, and their binding is aided by a complex combinator Z, as in "Mary lost her way". Z is definable using W and B.
- Combinatory categorial grammar (CCG) is an efficiently parsable, yet linguistically expressive grammar formalism. It has a transparent interface between surface syntax and underlying semantic representation, including predicate-argument structure, quantification and information structure. The formalism generates constituency-based structures (as opposed to dependency-based ones) and is therefore a type of phrase structure grammar (as opposed to a dependency grammar).
2009
- http://groups.inf.ed.ac.uk/ccg/
- [Combinatory Categorial Grammar (CCG)]] is an efficiently parseable, yet linguistically expressive grammar formalism. It has a completely transparent interface between surface syntax and underlying semantic representation, including predicate-argument structure, quantification and information structure.
2004
- (Bos et al., 2004) ⇒ Johan Bos, Stephen Clark, Mark Steedman, James R. Curran, and Julia Hockenmaier. (2004). “Wide-Coverage Semantic Representations from a CCG Parser.” In: Proceedings of the 20th International Conference on Computational Linguistics (COLING 2004). doi:10.3115/1220355.1220535