Parsing String Generating Hypergraph Grammars

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3256, Issue , 2004, Pages 352-367

  Seifert, Sebastian ^a   Fischer, Ingrid ^a  

^a UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

C (PROGRAMMING LANGUAGE); CONTEXT FREE GRAMMARS; GRAPH THEORY; MODELING LANGUAGES;

CHOMSKY GRAMMARS; CONTEXT-FREE; HYPEREDGE REPLACEMENT; HYPERGRAPH; NATURAL LANGUAGES; STRING GRAPHS; STRING LANGUAGES;

CONTEXT FREE LANGUAGES;

EID: 33750269492     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30203-2_25     Document Type: Article

References (19)

1. Trask, R.: A dictionary of Grammatical Terms in Linguistics. Roudledge, New York, London (1993)
2. Nolda, A.: Gespaltene Topikalisierung im Deutschen. In: Bericht des III. OstWest-Kolloquiums für Sprachwissenschaft, Berlin, Germany (2000)
3. Fischer, L: Modelling discontinuous constituents with hypergraph grammars. In L. Pfaltz, M. Nagl, B.B., ed.: Applications of Graph Transformation with Industrial Relevance Proc. 2nd Intl. Workshop AGTIVE'03. Volume 3062 of Lecture Notes in Computer Science., Charlottesville, USA, Springer Verlag (to appear)
4. Earley, J.: An efficient context-free parsing algorithm. Communications of the ACM 13 (1970) 94-102
5. Habel, A.: Hyperedge Replacement: Grammars and Languages. Volume 643 of Lecture Notes in Computer Science. Springer-Verlag, Berlin (1992)
6. Drewes, F., Habel, A., Kreowski, H.J.: Hyperedge replacement graph grammars. In Rozenberg, G., ed.: Handbook of Graph Grammars and Computing by Graph Transformation. Vol. I: Foundations. World Scientific (1997) 95-162
7. Engelfriet, J., Heyker, L.: The string generating power of context-free hypergraph grammars. Journal of Computer and System Sciences 43 (1991) 328-360
8. Engelfriet, J., Heyker, L.: Context-free hypergraph grammars have the same termgenerating power as attribute grammars. Acta Informatica 29 (1992) 161-210
9. Jurafsky, D., Martin, J.H.: Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics, and Speech Recognition. Prentice Hall (2000)
10. Seifert, S.: Ein Earley-Parser für Zeichenketten generierende Hypergraphgrammatiken. Studienarbeit, Lehrstuhl für Informatik 2, Universität ErlangenNürnberg (2004)
11. 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/CoNLL98. Association for Computational Linguistics, Somerset, New Jersey (1998) 49-57
12. Marcus, M.P., Santorini, B., Marcinkiewicz, M.A.: Building a large annotated corpus of english: The penn treebank. Computational Linguistics 19 (1994) 313330
13. Chomsky, N.: Syntactic Structures. The Hague: Mouton (1957)
14. Kaplan, R.M., Maxwell, III, J.T.: An algorithm for functional uncertainty. COLING-88 (1988) 297-302
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 (2004) 209-257
16. 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)
17. Bunt, H.: Formal tools for the description and processing of discontinuous constituents. In: Discontinuous Constituency. Mouton De Gruyter (1996)
18. Dahl, V., Popowich, F.: Parsing and generation with static discontinuity grammars. New Generation Computers 8 (1990) 245-274
19. Minas, M.: Spezifikation und Generierung graphischer Diagrammeditoren. ShakerVerlag, Aachen (2001)