Transition network grammars for natural language analysis
Communications of the ACM
When categorial grammars meet regular grammatical inference
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
| Hi-index | 0.00 |
AB-categorial grammars (CGs in the following) is a lexicalized formalism having the expressive power of ε-free context-free languages [1]. It has a long common history with natural language [2]. Here, we first relate unidirectional CGs to a special case of recursive transition networks [3]. We then illustrate how the structures produced by a CG can be generated by a pair of recursive automata.