Till umu.se

Frank Drewes

Kontaktinformation

vCard vcard

Befattning:

Professor

personbild

Verksam vid:

Datavetenskap

Roller:

Biträdande prefekt
Programansvarig
Studierektor

Adress:

Umeå universitet
SE-901 87 Umeå
Sverige

Besöksadress:

Plan 4, MIT-huset, E454

Tel:

+46 90 786 97 90

Fax:

+46 90 580 14

E-postadress:

frank.drewes@umu.seE-post 1

drewes@cs.umu.seE-post 2

Lync:

Ta kontakt via Lync

Webbsida:

http://www8.cs.umu.se/~drewes/ Webbsida
http://www.cs.umu.se/personal/frank-drewes Webbsida

Research Interests

I am primus inter pares of the research group Foundations of Language Processing. My research interests are formal language theory in a wide sense and its application to problems in computational linguistics and natural language processing. In particular, I am interested in structural representations of natural language that combine different aspects such as syntax, semantics, and context knowledge. Currently, I am mostly interested in the algorithmics of automata and grammars that process semantic representations of sentences such as Abstract Meaning Representations.

Previously, I have been active in the field of grammatical picture generation. Information about a book on this subject that I have written (in the Springer EATCS series Texts in Theoretical Computer Science) is available here.

You may also be interested to have a look at the system TREEBAG.

So far I have been the main supervisor of three PhD students:

  • Johanna Björklund (then Johanna Högberg)
  • Christina Igasto (then Christina Olsén)
  • Martin Berglund

On a more personal note, in my sparetime I keep and breed Dendrobates (also somewhat misleadingly called dart frogs) and I try to develop my photographic skills. Feel free to visit my pages on Dendrobates (in Swedish) and about my photographs.

Publikationer

Författare

Titel

År sorteringsordning

Fulltext

Blum, Johannes

Language Theoretic Properties of Regular DAG Languages
Information and Computation

2017

-

Drewes, Frank
Holzer, Markus
Jakobi, Sebastian; et al.

Tight Bounds for Cut-Operations on Deterministic Finite Automata
Fundamenta Informaticae, 155: 89-110

2017

-

Drewes, Frank

Preface
Theoretical Computer Science, 679: 1-1

2017

-

Björklund, Johanna
Drewes, Frank
Zechner, Niklas

Efficient enumeration of weighted tree languages over the rropical semiring
Journal of computer and system sciences (Print)

2017

-

Björklund, Johanna
Drewes, Frank
Jonsson, Anna

Finding the N Best Vertices in an Infinite Weighted Hypergraph
Theoretical Computer Science, 682: 30-41

2017

-

Berglund, Martin
Björklund, Henrik
Drewes, Frank

Single-Rooted DAGs in Regular DAG Languages: Parikh Image and Path Languages
13th International Workshop on Tree-Adjoining Grammar and Related Formalisms (TAG+13)

2017

-

Drewes, Frank
Jonsson, Anna

Contextual Hyperedge Replacement Grammars for Abstract Meaning Representations
13th International Workshop on Tree-Adjoining Grammar and Related Formalisms (TAG+13)

2017

-

Drewes, Frank
Hoffmann, Berthold
Minas, Mark

Predictive Shift-Reduce Parsing for Hyperedge Replacement Grammars
Graph Transformation (ICGT 2017)

2017

-

Drewes, Frank

DAG Automata for Meaning Representation
Mathematics of Language (MoL 2017): 88-99

2017

-

Drewes, Frank

On DAG Languages and DAG Transducers
Bulletin of the European Association for Theoretical Computer Science, 121: 142-163

2017

-