DFKI-LT - Converting CCGs into Typed Feature Structure Grammars
Converting CCGs into Typed Feature Structure Grammars
2 Proceedings of the 18th International Conference on Head-Driven Phrase Structure Grammar, Seattle, WA, USA, CSLI Publications, University of Washington, 2011
In this paper, we report on a transformation scheme that turns a Categorial Grammar, more specifically, a Combinatory Categorial Grammar into a derivation- and meaning-preserving typed feature structure (TFS) grammar. We describe the main idea which can be traced back at least to work by Karttunen, Uszkoreit, Bouma, and Calder et al. 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 alpha-conversion and beta-reduction. 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.