16 search results - page 1 / 4 » The Complexity Of Parsing With Extended Categorial Grammars |
52
Voted
COLING
1990
15 years 1 months ago
1990
88
Voted
IPL
2008
15 years 13 days 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...
130
Voted
ACL
1990
15 years 1 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...
85
Voted
COLING
2000
15 years 1 months 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
15 years 17 days 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...