Graph transductions in the field of automatic translation of natural languages

  • Jan Messerschmidt
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 153)


Finite Automaton Translation System Context Free Grammar Derivation Tree Graph Grammar 
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. [Kay67]
    M. Kay: Experiments with a powerful parser. The Rand Corporation, 1967Google Scholar
  2. [Wood70]
    W.A. Wood: Transition Network Grammar for Natural Language Analysis. In: Comm. of the ACM 13, 1970Google Scholar
  3. [Col70]
    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, 1970Google Scholar
  4. [Sc77]
    C. Schwind: Ein Formalismus zur Beschreibung der Syntax und Bedeutung von Frage-Antwort-Systemen. Report No. 7710, Tech. Univ. Munich, 1977Google Scholar
  5. [Nagl80]
    GRAPL — A Programming Language for Handling Dynamic Problems on Graphs. In U. Pape (Ed.) Discrete Structures and Algorithms pp. 25–45, Hanser Verlag, Munich 1980Google Scholar
  6. [Com81]
    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 1981Google Scholar
  7. [Arz82]
    J. Arz: Implementierung erweiterter Netzwerke (ATN) in COMSKEE. In: H. Eggers (Ed.): Linguistische Arbeiten des SFB 100, Neue Folge, Heft 5, Saarbrücken 1982Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • Jan Messerschmidt
    • 1
  1. 1.Universität des SaarlandesSaarbrückenFed. Rep. of Germany

Personalised recommendations