umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Formal Models of Graph Transformation in Natural Language Processing
Umeå University, Faculty of Science and Technology, Department of Computing Science. (Foundations of Language Processing)ORCID iD: 0000-0001-7349-7693
University of Southern California.
Linköpings universitet.
2015 (English)Report (Other academic)
Abstract [en]

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
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik , 2015. , 19 p.
Series
Dagstuhl Reports, ISSN 2192-5283 ; 5
National Category
Computer Science Language Technology (Computational Linguistics)
Research subject
datorlingvistik
Identifiers
URN: urn:nbn:se:umu:diva-109110DOI: 10.4230/DagRep.5.3.143OAI: oai:DiVA.org:umu-109110DiVA: diva2:854929
Available from: 2015-09-18 Created: 2015-09-18 Last updated: 2015-12-03Bibliographically approved

Open Access in DiVA

fulltext(1150 kB)64 downloads
File information
File name FULLTEXT01.pdfFile size 1150 kBChecksum SHA-512
373a3a18cdaf36eedc73266e0635a1ce512a3e1ed6db16a6392e22c722d9c5c5a764c099b3797de9c6dd426228c03797aa1ba14f92d8399726372dd1ac783658
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Authority records BETA

Drewes, Frank

Search in DiVA

By author/editor
Drewes, Frank
By organisation
Department of Computing Science
Computer ScienceLanguage Technology (Computational Linguistics)

Search outside of DiVA

GoogleGoogle Scholar
Total: 64 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 78 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf