String Generating Hypergraph Grammars with Word Order Restrictions

  • Martin Riedl
  • Sebastian Seifert
  • Ingrid Fischer
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4178)


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.


Noun Phrase Relative Clause Word Order Target Node Current Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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)CrossRefGoogle Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    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)CrossRefGoogle Scholar
  4. 4.
    Seifert, S: Ein Earley-Parser für Zeichenketten generierende Hypergraphgrammatiken. Studienarbeit, Lehrstuhl für Informatik 2, Universität Erlangen-Nürnberg (2004)Google Scholar
  5. 5.
    Earley, J.: An Efficient Context–Free Parsing Algorithm. Communications of the ACM 13(2), 94–102 (1970)zbMATHCrossRefGoogle Scholar
  6. 6.
    Habel, A.: Hyperedge Replacement: Grammars and Languages. LNCS, vol. 643. Springer, Heidelberg (1992)Google Scholar
  7. 7.
    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)CrossRefGoogle Scholar
  8. 8.
    Engelfriet, J., Heyker, L.: The string generating power of context-free hypergraph grammars. Journal of Computer and System Sciences 43, 328–360 (1991)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Engelfriet, J., Heyker, L.: Context–free hypergraph grammars have the same term-generating power as attribute grammars. Acta Informatica 29, 161–210 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Gazdar, G., Klein, E., Pullum, G., Sag, I.: Generalized Phrase Structure Grammar. Harvard University Press, Cambridge (1985)Google Scholar
  11. 11.
    Riedl, M.: Wortstellungsrestriktionen für Zeichenketten generierende Hypergraphgrammatiken. Studienarbeit, Lehrstuhl für Informatik 2, Universität Erlangen-Nürnberg (2005)Google Scholar
  12. 12.
    Shieber, S.M.: Direct Parsing of ID/LP Grammars. Linguistics and Philosophy 7(2), 135–154 (1984)zbMATHCrossRefGoogle Scholar
  13. 13.
    Barton, G.E.: On the Complexity of ID/LP Parsing. Computational Linguistics 11, 205–218 (1985)Google Scholar
  14. 14.
    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)Google Scholar
  15. 15.
    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), zbMATHGoogle Scholar
  16. 16.
    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)Google Scholar
  17. 17.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Martin Riedl
    • 1
  • Sebastian Seifert
    • 1
  • Ingrid Fischer
    • 2
  1. 1.Computer Science InstituteUniversity of Erlangen–NurembergGermany
  2. 2.ALTANA Chair for Bioinformatics and Information MiningUniversity of KonstanzGermany

Personalised recommendations