Incremental Combinatory Categorial Grammar and Its Derivations

  • Ahmed Hefny
  • Hany Hassan
  • Mohamed Bahgat
Conference paper

DOI: 10.1007/978-3-642-19400-9_8

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6608)
Cite this paper as:
Hefny A., Hassan H., Bahgat M. (2011) Incremental Combinatory Categorial Grammar and Its Derivations. In: Gelbukh A.F. (eds) Computational Linguistics and Intelligent Text Processing. CICLing 2011. Lecture Notes in Computer Science, vol 6608. Springer, Berlin, Heidelberg


Incremental parsing is appealing for applications such as speech recognition and machine translation due to its inherent efficiency as well as being a natural match for the language models commonly used in such systems. In this paper we introduce an Incremental Combinatory Categorical Grammar (ICCG) that extends the standard CCG grammar to enable fully incremental left-to-right parsing. Furthermore, we introduce a novel dynamic programming algorithm to convert CCGbank normal form derivations to incremental left-to-right derivations and show that our incremental CCG derivations can recover the unlabeled predicate-argument dependency structures with more than 96% F-measure. The introduced CCG incremental derivations can be used to train an incremental CCG parser.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Ahmed Hefny
    • 1
  • Hany Hassan
    • 2
  • Mohamed Bahgat
    • 3
  1. 1.Computer Engineering Department, Faculty of EngineeringCairo UniversityGizaEgypt
  2. 2.Microsoft ResearchRedmondUSA
  3. 3.IBM Cairo Technology Development CenterGizaEgypt

Personalised recommendations