Converting CCGs into Typed Feature Structure Grammars

Content Provider	Semantic Scholar
Author	Krieger, Hans-Ulrich Kiefer, Bernd
Copyright Year	2011
Abstract	Introduction In this paper, we report on a transformation scheme that turns a Categorial Grammar (CG), more specifically, a Combinatory Categorial Grammar (CCG; see (Baldridge 2002)) into a derivationand meaning-preserving typed feature structure (TFS) grammar. We describe the main idea which can be traced back at least to work by (Karttunen 1986), (Uszkoreit 1986), (Bouma 1988), and (Calder, Klein, & Zeevat 1988). We then show how a typed representation of complex categories can be extended by other constraints, such as modes, and indicate how the Lambda semantics of combinators is mapped into a TFS representation, using unification to perform α-conversion and β-reduction (Barendregt 1984). We also present first findings concerning runtime measurements, showing that the PET system, originally developed for the HPSG grammar framework, outperforms the OpenCCG parser by a factor of more than 10.
Starting Page	109
Ending Page	125
Page Count	17
File Format	PDF HTM / HTML
Alternate Webpage(s)	https://web.stanford.edu/group/cslipublications/cslipublications/HPSG/2011/krieger-kiefer.pdf
Alternate Webpage(s)	http://depts.washington.edu/hpsg2011/pp/Krieger-Kiefer.pdf
Alternate Webpage(s)	http://web.stanford.edu/group/cslipublications/cslipublications/HPSG/2011/krieger-kiefer.pdf
Language	English
Access Restriction	Open
Content Type	Text
Resource Type	Article