Polynomial Time Parsing of Combinatory Categorial Grammars

In this paper we present a polynomial time parsing algorithm for Combinatory Categorial Grammar. The recognition phase extends the CKY algorithm for CFG. The process of generating a representation of the parse trees has two phases. Initially, a shared forest is build that encodes the set of all derivation trees for the input string. This shared forest is then pruned to remove all spurious ambiguity.

• Type: Conference
• Year: 1990
• Where: ACL
• Authors: K. Vijay-Shanker, David J. Weir
• Keywords: ACL 1990, ACL 2007, CKY Algorithm, Combinatory Categorial Grammar, Time Parsing Algorithm