Combinatory Categorial Grammar - Revision history

Dmhowcroft: /* Software */ alphabetized software section and added EasyCCG

2016-01-26T15:24:06Z

Software: alphabetized software section and added EasyCCG

← Older revision		Revision as of 15:24, 26 January 2016
Line 14:		Line 14:

	== Software ==		== Software ==


			=== Boxer ===

			[http://svn.ask.it.usyd.edu.au/trac/candc/wiki/boxer Boxer] is developed by [http://homepages.inf.ed.ac.uk/jbos/ Johan Bos] and generates formal semantic representations for CCG grammars. Boxer takes as input CCG (Combinatory Categorial Grammar) derivations and produces DRSs (Discourse Representation Structures, from Hans Kamp's Discourse Representation Theory) as output. It is distributed with the C&C tools. Boxer produces standard DRS syntax, uses a neo-Davidsonian analysis for events (with thematic roles from VerbNet), incorporates Van der Sandt's algorithm for presupposition, is 100% compatible with first-order logic (FOL), and normalises cardinal and date expressions. DRSs can be generated in various output formats: resolved or underspecified, in Prolog or XML, flattened or recursive structures, with discourse referents represented by Prolog atoms or variables, and with pretty printed DRSs or not. It is also possible to output FOL formulas translated from the DRSs.


	=== OpenCCG: The OpenNLP CCG library ===		=== OpenCCG: The OpenNLP CCG library ===
Line 33:		Line 39:
	part of the language processing tools developed by James Curran and Stephen Clark.		part of the language processing tools developed by James Curran and Stephen Clark.
	The tools are written in C++ and have been designed to be efficient enough for large-scale NLP tasks.		The tools are written in C++ and have been designed to be efficient enough for large-scale NLP tasks.

			=== EasyCCG ===

			[http://homepages.inf.ed.ac.uk/s1049478/easyccg.html EasyCCG] is the A-search-based, state of the art parser reported in Lewis and Steedman (2014) "A CCG Parsing with a Supertag-factored Model".

	=== StatCCG ===		=== StatCCG ===

	StatCCG is a statistical CCG parser (trained on CCGbank) written by Julia Hockenmaier. Executables are available [http://www.cis.upenn.edu/~juliahr/Parser/index.html here]		StatCCG is a statistical CCG parser (trained on CCGbank) written by Julia Hockenmaier. Executables are available [http://www.cis.upenn.edu/~juliahr/Parser/index.html here]

	~~=== Boxer ===~~

	[http://svn.ask.it.usyd.edu.au/trac/candc/wiki/boxer Boxer] is developed by [http://homepages.inf.ed.ac.uk/jbos/ Johan Bos] and generates formal semantic representations for CCG grammars. Boxer takes as input CCG (Combinatory Categorial Grammar) derivations and produces DRSs (Discourse Representation Structures, from Hans Kamp's Discourse Representation Theory) as output. It is distributed with the C&C tools. Boxer produces standard DRS syntax, uses a neo-Davidsonian analysis for events (with thematic roles from VerbNet), incorporates Van der Sandt's algorithm for presupposition, is 100% compatible with first-order logic (FOL), and normalises cardinal and date expressions. DRSs can be generated in various output formats: resolved or underspecified, in Prolog or XML, flattened or recursive structures, with discourse referents represented by Prolog atoms or variables, and with pretty printed DRSs or not. It is also possible to output FOL formulas translated from the DRSs.

	== Treebanks for CCG ==		== Treebanks for CCG ==

Ioan: /* CCGbank */

2012-01-19T12:36:44Z

CCGbank

← Older revision		Revision as of 12:36, 19 January 2012
Line 42:		Line 42:
	[http://svn.ask.it.usyd.edu.au/trac/candc/wiki/boxer Boxer] is developed by [http://homepages.inf.ed.ac.uk/jbos/ Johan Bos] and generates formal semantic representations for CCG grammars. Boxer takes as input CCG (Combinatory Categorial Grammar) derivations and produces DRSs (Discourse Representation Structures, from Hans Kamp's Discourse Representation Theory) as output. It is distributed with the C&C tools. Boxer produces standard DRS syntax, uses a neo-Davidsonian analysis for events (with thematic roles from VerbNet), incorporates Van der Sandt's algorithm for presupposition, is 100% compatible with first-order logic (FOL), and normalises cardinal and date expressions. DRSs can be generated in various output formats: resolved or underspecified, in Prolog or XML, flattened or recursive structures, with discourse referents represented by Prolog atoms or variables, and with pretty printed DRSs or not. It is also possible to output FOL formulas translated from the DRSs.		[http://svn.ask.it.usyd.edu.au/trac/candc/wiki/boxer Boxer] is developed by [http://homepages.inf.ed.ac.uk/jbos/ Johan Bos] and generates formal semantic representations for CCG grammars. Boxer takes as input CCG (Combinatory Categorial Grammar) derivations and produces DRSs (Discourse Representation Structures, from Hans Kamp's Discourse Representation Theory) as output. It is distributed with the C&C tools. Boxer produces standard DRS syntax, uses a neo-Davidsonian analysis for events (with thematic roles from VerbNet), incorporates Van der Sandt's algorithm for presupposition, is 100% compatible with first-order logic (FOL), and normalises cardinal and date expressions. DRSs can be generated in various output formats: resolved or underspecified, in Prolog or XML, flattened or recursive structures, with discourse referents represented by Prolog atoms or variables, and with pretty printed DRSs or not. It is also possible to output FOL formulas translated from the DRSs.

	== CCGbank ==		== Treebanks for CCG ==

			=== CCGbank ===

	CCGbank is a translation of the [http://www.cis.upenn.edu/~treebank/home.html Penn Treebank]		CCGbank is a translation of the [http://www.cis.upenn.edu/~treebank/home.html Penn Treebank]
Line 59:		Line 61:

	In all versions, the file structure corresponds exactly to that of the original Treebank.		In all versions, the file structure corresponds exactly to that of the original Treebank.

			=== The Groningen Meaning Bank ===

			The [http://gmb.let.rug.nl Groningen Meaning Bank] is an annotated corpus of public domain texts. Version 1.0 comprises 1,000 texts with CCG analyses for each sentence and semantic representations for each text.

	== Publications ==		== Publications ==

Smerity: According to all pages and sources, it's Stephen and not Stephan - http://www.cl.cam.ac.uk/~sc609/

2009-08-10T11:03:57Z

According to all pages and sources, it's Stephen and not Stephan - http://www.cl.cam.ac.uk/~sc609/

← Older revision		Revision as of 11:03, 10 August 2009
Line 31:		Line 31:

	The [http://svn.ask.it.usyd.edu.au/trac/candc/wiki C&C CCG parser and supertagger] form		The [http://svn.ask.it.usyd.edu.au/trac/candc/wiki C&C CCG parser and supertagger] form
	part of the language processing tools developed by James Curran and ~~Stephan~~ Clark.		part of the language processing tools developed by James Curran and Stephen Clark.
	The tools are written in C++ and have been designed to be efficient enough for large-scale NLP tasks.		The tools are written in C++ and have been designed to be efficient enough for large-scale NLP tasks.

Jasonbaldridge: /* Introduction */ removed "prominent"

2008-08-21T07:01:02Z

Introduction: removed "prominent"

← Older revision		Revision as of 07:01, 21 August 2008
Line 6:		Line 6:
	CCG relies on combinatory logic, which has the same expressive power as the lambda calculus, but builds its expressions differently.		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 Mark Steedman and Anna Szabolcsi. More recent ~~prominent~~ proponents of the approach are Jacobson and Baldridge.		The first linguistic and psycholinguistic arguments for basing the grammar on combinators were put forth by Mark Steedman and Anna Szabolcsi. More recent 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.		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.

Jasonbaldridge: /* OpenCCG: The OpenNLP CCG library */

2008-08-20T20:35:46Z

OpenCCG: The OpenNLP CCG library

← Older revision		Revision as of 20:35, 20 August 2008
Line 24:		Line 24:
	[http://comp.ling.utexas.edu/jbaldrid Jason Baldridge] as part of the [http://grok.sourceforge.net/ Grok] system		[http://comp.ling.utexas.edu/jbaldrid Jason Baldridge] as part of the [http://grok.sourceforge.net/ Grok] system
	(the precursor to OpenCCG). Current development efforts, led by [http://www.ling.ohio-state.edu/~mwhite/ Michael White], are focused on making the realizer practical to use in dialogue systems. For the latest news about OpenCCG, check out the		(the precursor to OpenCCG). Current development efforts, led by [http://www.ling.ohio-state.edu/~mwhite/ Michael White], are focused on making the realizer practical to use in dialogue systems. For the latest news about OpenCCG, check out the
	[http://openccg.sourceforge.net/ OpenCCG page] on SourceForge.		[http://openccg.sourceforge.net/ OpenCCG page] on SourceForge. You can also look at [http://comp.ling.utexas.edu/wiki/doku.php/openccg/projects_using_openccg some of the projects using OpenCCG].

			The VisCCG tool for working with grammars is available as part of the OpenCCG source code and distribution. There are [http://comp.ling.utexas.edu/wiki/doku.php/openccg several tutorials available for learning how to edit grammars with VisCCG and use OpenCCG].

	=== The C&C Parser and Supertagger ===		=== The C&C Parser and Supertagger ===

Jasonbaldridge: /* Publications */

2008-08-20T20:30:36Z

Publications

← Older revision		Revision as of 20:30, 20 August 2008
Line 60:		Line 60:
	== Publications ==		== Publications ==

	This is a very incomplete list of publications. Follow the links to homepages in the People section to see more.		This is a very incomplete list of publications. Follow the links to homepages in the People section to see more, and see the [http://groups.inf.ed.ac.uk/ccg/publications.html CCG site publications page].

	=== Books ===		=== Books ===

Jasonbaldridge: /* Publications */ added a bunch of dissertations and Baldridge publications -Jason

2008-08-20T20:29:23Z

Publications: added a bunch of dissertations and Baldridge publications -Jason

@@ Line 60: / Line 60: @@
 == Publications ==
-* Baldridge, Jason (2002), "Lexically Specified Derivational Control in Combinatory Categorial Grammar." PhD Dissertation. Univ. of Edinburgh.
+This is a very incomplete list of publications. Follow the links to homepages in the People section to see more.
 * Curry, Haskell B. and Richard Feys (1958), Combinatory Logic, Vol. 1. North-Holland.
 * Jacobson, Pauline (1999), “Towards a variable-free semantics.” Linguistics and Philosophy 22, 1999. 117-184
@@ Line 68: / Line 76: @@
 * Steedman, Mark  (1987), “Combinatory grammars and parasitic gaps”. Natural Language and Linguistic Theory 5, 403-439.
-* Steedman, Mark (1996), Surface Structure and Interpretation. The MIT Press.
+=== Articles in books or collections ===
 * Szabolcsi, Anna (1989), "Bound variables in syntax (are there any?)." Semantics and Contextual Expression, ed. by Bartsch, van Benthem, and van Emde Boas. Foris, 294-318.
@@ Line 77: / Line 83: @@
 * Szabolcsi, Anna (2003), “Binding on the fly: Cross-sentential anaphora in variable-free semantics”. Resource Sensitivity in Binding and Anaphora, ed. by Kruijff and Oehrle.  Kluwer, 215-229.
 == People ==

Jasonbaldridge: /* OpenCCG: The OpenNLP CCG library */

2008-08-16T21:54:31Z

OpenCCG: The OpenNLP CCG library

← Older revision		Revision as of 21:54, 16 August 2008
Line 22:		Line 22:
	Combinatory Categorial Grammar (CCG) formalism.		Combinatory Categorial Grammar (CCG) formalism.
	The library makes use of multi-modal extensions to CCG developed by		The library makes use of multi-modal extensions to CCG developed by
	[http://~~www~~.~~iccs~~.~~informatics~~.~~ed.ac.uk/~jmb~~/ Jason Baldridge] as part of the [http://grok.sourceforge.net/ Grok] system		[http://comp.ling.utexas.edu/jbaldrid Jason Baldridge] as part of the [http://grok.sourceforge.net/ Grok] system
	(the precursor to OpenCCG). Current development efforts, led by [http://www.ling.ohio-state.edu/~mwhite/ Michael White], are focused on making the realizer practical to use in dialogue systems. For the latest news about OpenCCG, check out the		(the precursor to OpenCCG). Current development efforts, led by [http://www.ling.ohio-state.edu/~mwhite/ Michael White], are focused on making the realizer practical to use in dialogue systems. For the latest news about OpenCCG, check out the
	[http://openccg.sourceforge.net/ OpenCCG page] on SourceForge.		[http://openccg.sourceforge.net/ OpenCCG page] on SourceForge.

Jasonbaldridge: /* People */

2008-08-16T20:08:15Z

People

← Older revision		Revision as of 20:08, 16 August 2008
Line 82:		Line 82:
	* [http://comp.ling.utexas.edu/jbaldrid Jason Baldridge]		* [http://comp.ling.utexas.edu/jbaldrid Jason Baldridge]
	* [http://homepages.inf.ed.ac.uk/jbos/ Johan Bos]		* [http://homepages.inf.ed.ac.uk/jbos/ Johan Bos]
			* [http://www.ceng.metu.edu.tr/~bozsahin/ Cem Bozsahin]
	* [http://web.comlab.ox.ac.uk/oucl/work/stephen.clark/ Stephen Clark]		* [http://web.comlab.ox.ac.uk/oucl/work/stephen.clark/ Stephen Clark]
	* [http://www.it.usyd.edu.au/about/people/staff/james.shtml James Curran]		* [http://www.it.usyd.edu.au/about/people/staff/james.shtml James Curran]

Jasonbaldridge: /* People */

2008-08-16T19:55:40Z

People

← Older revision		Revision as of 19:55, 16 August 2008
Line 80:		Line 80:
	== People ==		== People ==

	* [http://~~www~~.~~iccs~~.~~informatics~~.~~ed.ac.uk/~jmb~~/ Jason Baldridge]		* [http://comp.ling.utexas.edu/jbaldrid Jason Baldridge]
	* [http://homepages.inf.ed.ac.uk/jbos/ Johan Bos]		* [http://homepages.inf.ed.ac.uk/jbos/ Johan Bos]
	* [http://web.comlab.ox.ac.uk/oucl/work/stephen.clark/ Stephen Clark]		* [http://web.comlab.ox.ac.uk/oucl/work/stephen.clark/ Stephen Clark]