16 search results - page 1 / 4 » The Complexity Of Parsing With Extended Categorial Grammars |
45
Voted
COLING
1990
14 years 11 months ago
1990
IPL
2008
14 years 10 months ago
2008
We study the complexity of the membership or parsing problem for pictures generated by a family of picture grammars: Siromoney's Context-Free Kolam Array grammars (coincident...
109
click to vote
ACL
1990
14 years 11 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...
COLING
2000
15 years 5 hour ago
2000
The Korean Combinatory Categorial Grammar (KCCG) tbrmalism can unitbrmly handle word order variation among arguments and adjuncts within a clause as well as in complex clauses and...
ACTA
2007
14 years 10 months ago
2007
The recursive descent parsing method for the context-free grammars is extended for their generalization, Boolean grammars, which include explicit set-theoretic operations in the f...