Information till medarbetare med anledning av covid-19 (Uppdaterad: 28 oktober 2020)

Vi använder kakor (cookies) för att förbättra funktionaliteten och besökarupplevelsen på webbplatsen. Du kan blockera kakor genom att göra inställningar i din webbläsare. Genom att surfa vidare godkänner du att vi använder kakor. Läs mer om kakor
English
Umeå universitet
printicon
Personalbild Frank Drewes

Frank Drewes

Ordförande för fakultetens Kommitté för utbildning på forskarnivå, studierektor och examinator för forskarutbildningen i datavetenskap och programansvarig för Masterprogrammet i datavetenskap.

Kontakt

E-post
frank.drewes@umu.se
Telefon
090-786 97 90

Verksam vid

Anknytning
Professor vid Institutionen för datavetenskap Roll: Studierektor
Plats
MIT-huset, Umeå universitet, E454 Umeå universitet, 901 87 Umeå

Min besöksadress är MIT-huset, 4:e våningen, rum E454.

Min forskning handlar om formella metoder med tillämpningar i datorlingvistik och hantering av naturligt språk. Bland annat leder jag och forskar i flera projekt inom AI vid Umeå universitet, som handlar om multimodal analys av mediainnehåll. För mer detaljerad information om min forskning besök gärna den engelska versionen av den här sidan.

2020
Graph Parsing as Graph Transformation: Correctness of Predictive Top-Down Parsers
ICGT 2020. Lecture Notes in Computer Science
Drewes, Frank; Hoffmann, Berthold; Minas, Mark
2020
The Metric Dimension of Z(n) x Z(n) x Z(n) is [3n/2]
Theoretical Computer Science, Elsevier 2020, Vol. 806 : 344-362
Jäger, Gerold; Drewes, Frank
2019
Parsing Weighted Order-Preserving Hyperedge Replacement Grammars
Proceedings of the 16th Meeting on the Mathematics of Language, Association for Computational Linguistics 2019 : 1-11
Björklund, Henrik; Drewes, Frank; Ericson, Petter
2019
Bottom-Up Unranked Tree-to-Graph Transducers for Translation into Semantic Graphs
Proceedings of the 14th International Conference on Finite-State Methods and Natural Language Processing, Association for Computational Linguistics 2019 : 7-17
Björklund, Johanna; Cohen, Shay B.; Drewes, Frank; et al.
2019
Z-Automata for Compact and Direct Representation of Unranked Tree Languages
Implementation and Application of Automata: 24th International Conference, CIAA 2019 Košice, Slovakia, July 22–25, 2019, Proceedings, Springer 2019 : 83-94
Björklund, Johanna; Drewes, Frank; Satta, Giorgio
2019
Efficient enumeration of weighted tree languages over the tropical semiring
Journal of computer and system sciences (Print), Vol. 104 : 119-130
Björklund, Johanna; Drewes, Frank; Zechner, Niklas
2019
Language Theoretic Properties of Regular DAG Languages
Information and Computation, Elsevier 2019, Vol. 265 : 57-76
Blum, Johannes; Drewes, Frank
2019
Formalization and Correctness of Predictive Shift-Reduce Parsers for Graph Grammars Based on Hyperedge Replacement
The Journal of logical and algebraic methods in programming, Elsevier 2019, Vol. 104 : 303-341
Drewes, Frank; Hoffmann, Berthold; Minas, Mark
2019
Extending Predictive Shift-Reduce Parsing to Contextual Hyperedge Replacement Grammars
Graph Transformation: 12th International Conference, ICGT 2019, Held as Part of STAF 2019, Eindhoven, The Netherlands, July 15–16, 2019, Proceedings, Springer 2019 : 55-72
Drewes, Frank; Hoffmann, Berthold; Minas, Mark
2018
The output size problem for string-to-tree transducers
Journal of Automata, Languages and Combinatorics, Institut für Informatik, Justus-Liebig-Universität Giessen 2018, Vol. 23, (1-3) : 19-38
Berglund, Martin; Drewes, Frank; Merwe, Brink van der
2018
On Regular Expressions with Backreferences and Transducers
Tenth Workshop on Non-Classical Models of Automata and Applications (NCMA 2018), Österreichische Computer Gesellschaft 2018 : 49-64
Berglund, Martin; Drewes, Frank; Merwe, Brink van der
2018
Parsing Weighted Order-Preserving Hyperedge Replacement Grammars
Report / UMINF, 18.16
Björklund, Henrik; Drewes, Frank; Ericson, Petter
2018
Uniform Parsing for Hyperedge Replacement Grammars
Report / UMINF, 18.13
Björklund, Henrik; Drewes, Frank; Ericson, Petter; et al.
2018
A Comparison of Two N-Best Extraction Methods for Weighted Tree Automata
Implementation and Application of Automata: 23rd International Conference, CIAA 2018, Charlottetown, PE, Canada, July 30 – August 2, 2018, Proceedings, Springer 2018 : 197-108
Björklund, Johanna; Drewes, Frank; Jonsson, Anna
2018
Weighted DAG automata for semantic graphs
Computational linguistics - Association for Computational Linguistics (Print), Cambridge: MIT Press 2018, Vol. 44, (1) : 119-186
Chiang, David; Drewes, Frank; Gildea, Daniel; et al.
2018
An Optimal Strategy for Static Black-Peg Mastermind with Three Pegs
SAGT: International Symposium on Algorithmic Game Theory: 11th International Symposium, SAGT 2018, Beijing, China, September 11-14, 2018, Proceedings, Springer 2018 : 261-266
Jäger, Gerold; Drewes, Frank
2017
Single-Rooted DAGs in Regular DAG Languages: Parikh Image and Path Languages
Proceedings of the 13th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+13), Association for Computational Linguistics 2017 : 94-101
Berglund, Martin; Björklund, Henrik; Drewes, Frank
2017
Finding the N Best Vertices in an Infinite Weighted Hypergraph
Theoretical Computer Science, Elsevier 2017, Vol. 682 : 30-41
Björklund, Johanna; Drewes, Frank; Jonsson, Anna
2017
DAG automata for meaning representation
Proceedings of the 15th Meeting on the Mathematics of Language (MoL 2017) : 88-99
Drewes, Frank
2017
Preface
Theoretical Computer Science, Elsevier 2017, Vol. 679 : 1-1
Drewes, Frank
2017
On DAG Languages and DAG Transducers
Bulletin of the European Association for Theoretical Computer Science, European Association for Theoretical Computer Science 2017, Vol. 121 : 142-163
Drewes, Frank
2017
Predictive Shift-Reduce Parsing for Hyperedge Replacement Grammars
Graph Transformation: 10th International Conference, ICGT 2017, Held as Part of STAF 2017, Marburg, Germany, July 18-19, 2017, Proceedings, Cham: Springer 2017 : 106-122
Drewes, Frank; Hoffmann, Berthold; Minas, Mark
2017
Tight Bounds for Cut-Operations on Deterministic Finite Automata
Fundamenta Informaticae, IOS Press 2017, Vol. 155 : 89-110
Drewes, Frank; Holzer, Markus; Jakobi, Sebastian; et al.
2017
Contextual Hyperedge Replacement Grammars for Abstract Meaning Representations
Proceedings of the 13th International Workshop on Tree Adjoining Grammars and Related Formalisms, Association for Computational Linguistics 2017 : 102-111
Drewes, Frank; Jonsson, Anna
2016
Between a Rock and a Hard Place: Parsing for Hyperege Replacement DAG Grammars
Proc. 10th International Conference on Language and Automata Theory and Applications (LATA 2016), Springer Publishing Company 2016 : 521-532
Björklund, Henrik; Drewes, Frank; Ericson, Petter
2016
On the N best problem for hypergraphs
Workshop on Trends in Tree Automata and Tree Transducers (TTATT 2016), Seoul, South Korea, July 18, 2016
Björklund, Johanna; Drewes, Frank; Jonsson, Anna
2016
Properties of Regular DAG Languages
Proc. 10th International Conference on Language and Automata Theory and Applications (LATA 2016), Springer Publishing Company 2016 : 427-438
Blum, Johannes; Drewes, Frank
2016
EM-training for probabilistic aligned hypergraph bimorphisms
Proceedings of the SIGFSM Workshop on Statistical NLP and Weighted Automata, Association for Computational Linguistics 2016 : 60-69
Drewes, Frank; Gebhardt, Kilian; Vogler, Heiko
2016
Approximating Parikh images for generating deterministic graph parsers
Software Technologies: Applications and Foundations: STAF 2016 Collocated Workshops: DataMod, GCM, HOFM, MELO, SEMS, VeryComp, Vienna Austria, July 4-8, 2016, Revised Selected Papers, Springer 2016 : 112-128
Drewes, Frank; Hoffmann, Berthold; Minas, Mark
2016
The Output Size Problem for String-to-Tree Transducers
Workshop on Trends in Tree Automata and Tree Transducers (TTATT 2016), Seoul, South Korea, July 18, 2016
Drewes, Frank; Merwe, Brink van der; Weideman, Nicolaas
2015
MICO - MEDIA IN CONTEXT
2015 IEEE International Conference on Multimedia & Expo Workshops (ICMEW)
Aichroth, Patrick; Weigel, Christian; Kurz, Thomas; et al.
2015
Grammatical Inference of Graph Transformation Rules
Proceedings of the 7th Workshop on Non-Classical Modelsof Automata and Applications (NCMA 2015), Austrian Computer Society 2015 : 73-90
Bensch, Suna; Drewes, Frank; Hellström, Thomas
2015
Fundamenta Informaticae: special issue
Fundamenta Informaticae, 136:1-2
2015
An efficient best-trees algorithm for weighted tree automata over the tropical semiring
Proc. 9th International Conference on Language and Automata Theory and Applications, Springer 2015 : 97-108
Björklund, Johanna; Drewes, Frank; Zechner, Niklas
2015
Implementation and application of automata: 20th international conference, CIAA 2015, Umeå, Sweden, August 18-21, 2015, Proceedings
Lecture Notes in Computer Science, 9223
2015
Context-Free Tree Grammars are as Powerful as Context-Free Jungle Grammars
Acta Cybernetica, Vol. 22, (2) : 373-392
Drewes, Frank; Engelfriet, Joost
2015
The Generative Power of Delegation Networks
Information and Computation, Vol. 245 : 213-258
Drewes, Frank; Engelfriet, Joost
2015
Contextual Hyperedge Replacement
Acta Informatica, Springer 2015, Vol. 52, (6) : 497-524
Drewes, Frank; Hoffmann, Berthold
2015
Predictive Top-down Parsing for Hyperedge Replacement Grammars
Graph Transformation (ICGT 2015): 8th International Conference, ICGT 2015, Held as Part of STAF 2015, L'Aquila, Italy, July 21-23, 2015. Proceedings, Springer Publishing Company 2015 : 19-34
Drewes, Frank; Hoffmann, Berthold; Minas, Mark
2015
Tight Bounds for Cut-Operations on Deterministic Finite Automata
Machines, Computations, and Universality: 7th International Conference, MCU 2015, Famagusta, North Cyprus, September 9-11, 2015, Proceedings, Springer Publishing Company 2015 : 45-60
Drewes, Frank; Holzer, Markus; Jakobi, Sebastian; et al.
2015
Formal Models of Graph Transformation in Natural Language Processing
Dagstuhl Reports, 5
Drewes, Frank; Knight, Kevin; Kuhlmann, Marco
2015
Structurally Cyclic Petri Nets
Logical Methods in Computer Science, Vol. 11, (4)
Drewes, Frank; Leroux, Jérôme
2014
Graph transformation for incremental natural language analysis
Theoretical Computer Science, Elsevier 2014, Vol. 531 : 1-25
Bensch, Suna; Drewes, Frank; Jürgensen, Helmut; et al.
2014
Characterizing Non-Regularity
Report / UMINF, 14.12
Berglund, Martin
2014
Analyzing Catastrophic Backtracking Behavior in Practical Regular Expression Matching
14th International Conference Automata and Formal Languages
Berglund, Martin; Drewes, Frank; van der Merwe, Brink
2014
Contextual Hyperedge Replacement
Report / UMINF, 14.04
Drewes, Frank; Hoffmann, Berthold
2013
Proceedings of Umeå's 16th student conference in computing science: USCCS 2013
UMINF, 13.01
2013
Fifth Workshop on Non-Classical Models for Automata and Applications - NCMA 2013, Umeå, Sweden, August 13 - August 14, 2013, Proceedings
books@ocg.at, 294
2013
On the Parameterized Complexity of Linear Context-Free Rewriting Systems
Proceedings of the 13th Meeting on the Mathematics of Language (MoL 13), Association for Computational Linguistics 2013 : 21-29
Berglund, Martin; Björklund, Henrik; Drewes, Frank
2013
Cuts in Regular Expressions
Developments in Language Theory: 17th International Conference, DLT 2013, Marne-la-Vallée, France, June 18-21, 2013. Proceedings, Springer Berlin/Heidelberg 2013 : 70-81
Berglund, Martin; Björklund, Henrik; Drewes, Frank; et al.
Visa publikationer i DiVA

Forskargrupper

Forskningsledare
Foundations of Language Processing

Forskningsprojekt

1 mars 2019 till 31 december 2023
Multimodal semantisk analys: Göra språk meningsfullt i sin kontext
1 mars 2018 till 29 februari 2020
SAVANT – Self-optimising Video Platform for Affiliate Marketing
1 januari 2007 till 31 december 2009
Transformation av komplexa strukturer: Teori och implementering