Abstract
Discontinuous constituents and free word order pose constant problems in natural language parsing. String generating hypergraph grammars have been proven useful for handling discontinuous constituents. In this paper we describe a new notation for hypergraph productions that allows on-the-fly interconnection of graph parts with regard to user-defined constraints. These constraints handle the order of nodes within the string hypergraph. The HyperEarley parser for string generating hypergraph grammars [1] is adapted to the new formalism. A German example is used for the explanation of the new notation and algorithms.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Seifert, S., Fischer, I.: Parsing String Generating Hypergraph Grammars. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol. 3256, pp. 352–367. Springer, Heidelberg (2004)
Jurafsky, D., Martin, J.H.: Speech and Language Processing: An Introduction to Natural Language Processing. In: Computational Linguistics, and Speech Recognition. Prentice Hall, Englewood Cliffs (2000)
Fischer, I.: Modelling Discontinuous Constituents with Hypergraph Grammars. In: Pfaltz, J.L., Nagl, M., Böhlen, B. (eds.) AGTIVE 2003. LNCS, vol. 3062, pp. 163–169. Springer, Heidelberg (2004)
Seifert, S: Ein Earley-Parser für Zeichenketten generierende Hypergraphgrammatiken. Studienarbeit, Lehrstuhl für Informatik 2, Universität Erlangen-Nürnberg (2004)
Earley, J.: An Efficient Context–Free Parsing Algorithm. Communications of the ACM 13(2), 94–102 (1970)
Habel, A.: Hyperedge Replacement: Grammars and Languages. LNCS, vol. 643. Springer, Heidelberg (1992)
Drewes, F., Habel, A., Kreowski, H.J.: Hyperedge Replacement Graph Grammars. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, Foundations, vol. I, pp. 95–162. World Scientific, Singapore (1997)
Engelfriet, J., Heyker, L.: The string generating power of context-free hypergraph grammars. Journal of Computer and System Sciences 43, 328–360 (1991)
Engelfriet, J., Heyker, L.: Context–free hypergraph grammars have the same term-generating power as attribute grammars. Acta Informatica 29, 161–210 (1992)
Gazdar, G., Klein, E., Pullum, G., Sag, I.: Generalized Phrase Structure Grammar. Harvard University Press, Cambridge (1985)
Riedl, M.: Wortstellungsrestriktionen für Zeichenketten generierende Hypergraphgrammatiken. Studienarbeit, Lehrstuhl für Informatik 2, Universität Erlangen-Nürnberg (2005)
Shieber, S.M.: Direct Parsing of ID/LP Grammars. Linguistics and Philosophy 7(2), 135–154 (1984)
Barton, G.E.: On the Complexity of ID/LP Parsing. Computational Linguistics 11, 205–218 (1985)
Barton, G.E.: The Computational Difficulty of ID/LP Parsing. In: Proceedings of the 23rd conference on Association for Computational Linguistics, July 08-12, pp. 76–81 (1985)
Müller, S.: Continuous or discontinuous constituents? a comparison between syntactic analyses for constituent order and their processing systems. Research on Language and Computation, Special Issue on Linguistic Theory and Grammar Implementation 2(2), 209–257 (2004), http://www.cl.uni-bremen.de/~stefan/Pub/discont.html
Barta, C., Dormeyer, R., Spiegelhauer, T., Fischer, I.: Word Order and Discontinuities in a Dependency Grammar for Hungarian. In: Zoltan, A., Csendes, D. (eds.) Proceedings of the 2nd Conf. on Hungarian Computational Linguistics (MSZNY), Szeged Hungary, Juhasz Nyomda, pp. 19–27 (2004)
Mark-Jan Nederhof, G.S., Shieber, S.: Partially Ordered Multiset Context-Free Grammars And Free-Word-Order Parsing. In: 8th International Workshop of Parsing Technologies (IWPT), Nancy, France (2003)
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
Riedl, M., Seifert, S., Fischer, I. (2006). String Generating Hypergraph Grammars with Word Order Restrictions. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds) Graph Transformations. ICGT 2006. Lecture Notes in Computer Science, vol 4178. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11841883_11
Download citation
DOI: https://doi.org/10.1007/11841883_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38870-8
Online ISBN: 978-3-540-38872-2
eBook Packages: Computer ScienceComputer Science (R0)