Name
Abstract | ||
|---|---|---|
We study the weak generative capacity of a class of parenthesis free categorial grammars derived from those of Ades and Steedman by varying the set of reduction rules. With forward cancellation as the only rule, the grammars are weakly equivalent to context free grammars. When a backward combination rule is added, it is no longer possible to obtain all the context-free language. With suitable restriction of the forward partial rule, the languages are still context-free and a push-down automaton can be used for recognition. Using the unrestricted rule of forward partial combination, a context sensitive language is obtained. |
Year | DOI | Venue |
|---|---|---|
1986 | 10.3115/991365.991424 | COLING |
Keywords | Field | DocType |
weak generative capacity,partial combination,forward cancellation,parenthesis free categorial,context sensitive language,context free grammar,unrestricted rule,parenthesis-free categorial grammar,context-free language,partial rule,reduction rule,combination rule,context free language,categorial grammar | Context-sensitive grammar,Tree-adjoining grammar,L-attributed grammar,Context-free grammar,Computer science,Phrase structure grammar,Indexed grammar,Combinatory categorial grammar,Natural language processing,Categorial grammar,Artificial intelligence | Conference |
Volume | Citations | PageRank |
C86-1 | 3 | 4.03 |
References | Authors | |
1 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Joyce Friedman | 1 | 4 | 5.47 |
| Dawei Dai | 2 | 6 | 4.82 |
| Weiguo Wang | 3 | 3 | 4.03 |