Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bar Hillel, Y., Gaifman, C., Shamir, E.: On Categorial and Phrase Structure Grammars. Bulletin of the Research Council of Israel 9F (1960)
Oehrle, R.T., Bach, E., Wheeler, D.: Categorial Grammars and Natural Language Structures. D. Reidel Publishing Company, Dordrecht (1988)
Woods, W.A.: Transition network grammars for natural language analysis. Communication of the ACM 13(10), 591–606 (1970)
Tellier, I.: When Categorial Grammars meet Regular Grammatical Inference. In: Blache, P., Stabler, E.P., Busquets, J.V., Moot, R. (eds.) LACL 2005. LNCS (LNAI), vol. 3492, pp. 317–332. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tellier, I. (2006). Automata and AB-Categorial Grammars. In: Farré, J., Litovsky, I., Schmitz, S. (eds) Implementation and Application of Automata. CIAA 2005. Lecture Notes in Computer Science, vol 3845. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11605157_35
Download citation
DOI: https://doi.org/10.1007/11605157_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31023-5
Online ISBN: 978-3-540-33097-4
eBook Packages: Computer ScienceComputer Science (R0)