This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Literature
M. Kay: Experiments with a powerful parser. The Rand Corporation, 1967
W.A. Wood: Transition Network Grammar for Natural Language Analysis. In: Comm. of the ACM 13, 1970
A. Colmerauer: Les système-q où un formalisme pour analyser et synthétiser des phrase sur ordinateur. Internal publication No. 43, Univ. Montreal, Projet de Traduction automatique, 1970
C. Schwind: Ein Formalismus zur Beschreibung der Syntax und Bedeutung von Frage-Antwort-Systemen. Report No. 7710, Tech. Univ. Munich, 1977
GRAPL — A Programming Language for Handling Dynamic Problems on Graphs. In U. Pape (Ed.) Discrete Structures and Algorithms pp. 25–45, Hanser Verlag, Munich 1980
A. Mueller-v.Brochowski, J. Arz, P. Auler, J. Messerschmidt, M. Ries: The Programming Language COMSKEE, 2nd Revised Report. In: H. Eggers (Ed.): Linguistische Arbeiten des SFB 100 Neue Folge, Heft 4, Saarbrücken 1981
J. Arz: Implementierung erweiterter Netzwerke (ATN) in COMSKEE. In: H. Eggers (Ed.): Linguistische Arbeiten des SFB 100, Neue Folge, Heft 5, Saarbrücken 1982
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Messerschmidt, J. (1983). Graph transductions in the field of automatic translation of natural languages. In: Ehrig, H., Nagl, M., Rozenberg, G. (eds) Graph-Grammars and Their Application to Computer Science. Graph Grammars 1982. Lecture Notes in Computer Science, vol 153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0000112
Download citation
DOI: https://doi.org/10.1007/BFb0000112
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12310-1
Online ISBN: 978-3-540-39897-4
eBook Packages: Springer Book Archive