36 search results - page 1 / 8 » Polynomial Time Parsing of Combinatory Categorial Grammars |
102
click to vote
ACL
1990
14 years 10 months ago
1990
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...
ACL
1996
14 years 11 months ago
1996
Under categorial grammars that have powerful rules like composition, a simple n-word sentence can have exponentially many parses. Generating all parses is inefficient and obscures...
ACL
2010
14 years 7 months ago
2010
The definition of combinatory categorial grammar (CCG) in the literature varies quite a bit from author to author. However, the differences between the definitions are important i...
COLING
2000
14 years 11 months ago
2000
Coordination in natural language hamlmrs ef tieient parsing, especially due to the multiple and mostly unintended candidate conjuncts/disjmmts in a given sentence that shows struc...
COLING
2010
14 years 4 months ago
2010
We propose and implement a modification of the Eisner (1996) normal form to account for generalized composition of bounded degree, and an extension to deal with grammatical type-r...