Formal Models of Graph Transformation in Natural Language Processing (Dagstuhl Seminar 15122)
2015 (English)In: Dagstuhl Reports, ISSN 2192-5283, Vol. 5, no 3, 143-161 p.Article in journal, Meeting abstract (Other academic) Published
In natural language processing (NLP) there is an increasing interest in formal models for processing graphs rather than more restricted structures such as strings or trees. Such models of graph transformation have previously been studied and applied in various other areas of computer science, including formal language theory, term rewriting, theory and implementation of programming languages, concurrent processes, and software engineering. However, few researchers from NLP are familiar with this work, and at the same time, few researchers from the theory of graph transformation are aware of the specific desiderata, possibilities and challenges that one faces when applying the theory of graph transformation to NLP problems. The Dagstuhl Seminar 15122 “Formal Models of Graph Transformation in Natural Language Processing” brought researchers from the two areas together. It initiated an interdisciplinary exchange about existing work, open problems, and interesting applications.
Place, publisher, year, edition, pages
2015. Vol. 5, no 3, 143-161 p.
natural language processing, graph transformation
Language Technology (Computational Linguistics)
IdentifiersURN: urn:nbn:se:liu:diva-124720DOI: 10.4230/DagRep.5.3.143OAI: oai:DiVA.org:liu-124720DiVA: diva2:902495