Name
Title | ||
|---|---|---|
On the Expressive Power of Abstract Categorial Grammars: Representing Context-Free Formalisms |
Abstract | ||
|---|---|---|
We show how to encode context-free string grammars, linear context-free tree grammars, and linear context-free rewriting systems as Abstract Categorial Grammars. These three encodings share the same constructs, the only difference being the interpretation of the composition of the production rules. It is interpreted as a first-order operation in the case of context-free string grammars, as a second-order operation in the case of linear context-free tree grammars, and as a third-order operation in the case of linear context-free rewriting systems. This suggest the possibility of defining an Abstract Categorial Hierarchy. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/s10849-004-2114-x | Journal of Logic, Language and Information |
Keywords | Field | DocType |
lambda calculus,first order,second order,categorial grammar,expressive power,context free grammars | Tree-adjoining grammar,Context-sensitive grammar,Programming language,Context-free grammar,L-attributed grammar,Phrase structure grammar,Indexed grammar,Combinatory categorial grammar,Categorial grammar,Artificial intelligence,Natural language processing,Mathematics | Journal |
Volume | Issue | ISSN |
13 | 4 | 1572-9583 |
Citations | PageRank | References |
24 | 1.78 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Philippe Groote | 1 | 25 | 2.48 |
| Sylvain Pogodalla | 2 | 63 | 13.76 |