Abstract
We introduce an automaton model for recognizing sets of hybrid trees, the hybrid tree automaton (HTA). Special cases of hybrid trees are constituent trees and dependency trees, as they occur in natural language processing. This includes the cases of discontinuous constituent trees and non-projective dependency trees. In general, a hybrid tree is a tree over a ranked alphabet in which symbols can additionally be equipped with an index, i.e., a natural number which indicates the position of that symbol in the yield of the hybrid tree. As a special case of HTA, we define constituent tree automata (CTA) which recognize sets of constituent trees. We show that the set of yields of a CTA-recognizable set of constituent trees is an LCFRS language, and vice versa.
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
Brainerd, W.S.: Tree generating regular systems. Inform. Control 14, 217–231 (1969)
Chomsky, N.: Context-free grammars and pushdown storage. Technical report, MIT Research Lab. in Electronics, Cambridge, MA (1962)
Doner, J.: Tree acceptors and some of their applications. J. Comput. Syst. Sci. 4, 406–451 (1970)
Engelfriet, J.: Tree automata and tree grammars. Technical report, DAIMI FN-10, Institute of Mathematics, University of Aarhus, Department of Computer Science, Denmark (1975). arXiv:1510.02036v1 [cs.FL], 7 October 2015
Gebhardt, K., Nederhof, M.J., Vogler, H.: Hybrid grammars for parsing of discontinuous phrase structures and non-projective dependency structures. Comput. Linguist. 43(3), 465–520 (2017)
Gécseg, F., Steinby, M.: Tree Automata. Akadémiai Kiadó, Budapest (1984). arXiv:1509.06233v1 [cs.FL], 21 September 2015
Kallmeyer, L.: Parsing Beyond Context-Free Grammars. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-14846-0
Kracht, M.: The Mathematics of Language, vol. 63. Walter de Gruyter (2003)
Kübler, S., McDonald, R., Nivre, J.: Dependency Parsing, Synthesis Lectures on Human Language Technologies, vol. 2(1). Morgan & Claypool Publishers LLC (2009)
Kuhlmann, M.: Mildly non-projective dependency grammar. Comput. Linguist. 39(2), 355–387 (2013)
McCawley, J.: Parentheticals and discontinuous constituent structure. Linguist. Inq. 13(1), 91–106 (1982)
Seki, H., Matsumura, T., Fujii, M., Kasami, T.: On multiple context-free grammars. Theoret. Comput. Sci. 88(2), 191–229 (1991)
Vijay-Shanker, K., Weir, D., Joshi, A.: Charaterizing structural descriptions produced by various grammatical formalisms. In: Proceedings 25th Annual Meeting of the ACL, pp. 104–111. Association for Computational Linguistics (1987)
Weir, D.: Characterizing mildly context-sensitive grammar formalisms. Ph.D. thesis, University of Pennsylvania (1988)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 Springer Nature Switzerland AG
About this paper
Cite this paper
Drewes, F., Mörbitz, R., Vogler, H. (2022). Hybrid Tree Automata and the Yield Theorem for Constituent Tree Automata. In: Caron, P., Mignot, L. (eds) Implementation and Application of Automata. CIAA 2022. Lecture Notes in Computer Science, vol 13266. Springer, Cham. https://doi.org/10.1007/978-3-031-07469-1_7
Download citation
DOI: https://doi.org/10.1007/978-3-031-07469-1_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-07468-4
Online ISBN: 978-3-031-07469-1
eBook Packages: Computer ScienceComputer Science (R0)