Abstract
A string generating hypergraph grammar is a hyperedge replacement grammar where the resulting language consists of string graphs i.e. hypergraphs modeling strings. With the help of these grammars, string languages like a n b n c n can be modeled that can not be generated by context-free grammars for strings. They are well suited to model discontinuous constituents in natural languages, i.e. constituents that are interrupted by other constituents. For parsing context-free Chomsky grammars, the Earley parser is well known. In this paper, an Earley parser for string generating hypergraph grammars is presented, leading to a parser for natural languages that is able to handle discontinuities.
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
Trask, R.: A dictionary of Grammatical Terms in Linguistics. Roudledge, New York (1993)
Nolda, A.: Gespaltene Topikalisierung im Deutschen. In: Bericht des III. Ost- West-Kolloquiums für Sprachwissenschaft, Berlin, Germany (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)
Earley, J.: An efficient context-free parsing algorithm. Communications of the ACM 13, 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 termgenerating power as attribute grammars. Acta Informatica 29, 161–210 (1992)
Jurafsky, D., Martin, J.H.: Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics, and Speech Recognition. Prentice-Hall, Englewood Cliffs (2000)
Seifert, S.: Ein Earley–Parser für Zeichenketten generierende Hypergraphgrammatiken. Studienarbeit, Lehrstuhl für Informatik 2, Universität Erlangen– Nürnberg (2004)
Brants, T., Skut, W.: Automation of treebank annotation. In: Powers, D.M.W. (ed.) Proceedings of the Joint Conference on New Methods in Language Processing and Computational Natural Language Learning: NeMLaP3/CoNLL 1998, Somerset, New Jersey. Association for Computational Linguistics, pp. 49–57 (1998)
Marcus, M.P., Santorini, B., Marcinkiewicz, M.A.: Building a large annotated corpus of english: The penn treebank. Computational Linguistics 19, 313–330 (1994)
Chomsky, N.: Syntactic Structures. Mouton, The Hague (1957)
Kaplan, R.M., Maxwell, I.J.T.: An algorithm for functional uncertainty. In: COLING 1988, pp. 297–302 (1988)
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, 209–257 (2004)
Naumann, S., Langer, H.: Parsing — Eine Einführung in die maschinelle Analyse natürlicher Sprache. Leifäden und Monographen der Informatik. B.G. Teubner, Stuttgart (1994)
Bunt, H.: Formal tools for the description and processing of discontinuous constituents. In: Discontinuous Constituency. Mouton De Gruyter (1996)
Dahl, V., Popowich, F.: Parsing and generation with static discontinuity grammars. New Generation Computers 8, 245–274 (1990)
Minas, M.: Spezifikation und Generierung graphischer Diagrammeditoren. Shaker-Verlag, Aachen (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Seifert, S., Fischer, I. (2004). Parsing String Generating Hypergraph Grammars. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds) Graph Transformations. ICGT 2004. Lecture Notes in Computer Science, vol 3256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30203-2_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-30203-2_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23207-0
Online ISBN: 978-3-540-30203-2
eBook Packages: Springer Book Archive