"False"
Umeå universitet
printicon
Huvudmenyn dold.
Personalbild Frank Drewes

Frank Drewes

Forskar om automater, formella språk och bearbetning av naturligt språk. Prefekt vid Institutionen för datavetenskap.

Vetenskaplig meritering: Docent

Kontakt

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

Verksam som

Anknytning
Professor vid Institutionen för datavetenskap Roll: Prefekt
Plats
Besöksadress, se karta

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

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 som handlar om multimodal analys av mediainnehåll. Jag är prefekt vid Institutionen för datavetenskap och hör hemma i forskargruppen Foundations of Language Processing.

Jag handleder ett antal doktorander och har varit handledare för tre doktorander som tagit doktorsexamen:

Johanna Björklund (då Johanna Högberg)
Christina Igasto (då Christina Olsén)
Martin Berglund
Arezoo Hatefi
Adam Dahlgren Lindström

Tidigare har jag varit aktiv inom grammatisk bildgenerering. Information om en bok om detta ämne som jag har skrivit (i Springer EATCS-serien Texts in theoretical Comuter Science) finns här.

Du kanske också är intresserad av att titta på systemet TREEBAG.

På min fritid håller jag bl.a. på med att föda upp pilgiftsgrodor och jag försöker utveckla mina fotografiska färdigheter. Besök gärna mina webbplatser Franks pilgiftsgrodor och Franks fotografier.

Specifying and checking graph properties with alternating graph automata
Drewes, Frank; Hoffmann, Berthold; Minas, Mark
Graph formulas and their translation to alternating graph automata
Drewes, Frank; Hoffmann, Berthold; Minas, Mark
Finite automata for efficient graph recognition
EPTCS 417: proceedings of the fourteenth and fifteenth international workshop on graph computation models, Open Publishing Association 2025 : 134-156
Drewes, Frank; Hoffmann, Berthold; Minas, Mark
Comparing human-perceived cluster characteristics through the lens of CIPHE: measuring coherence beyond keywords
Journal of Data Mining and Digital Humanities, Centre pour la Communication Scientifique Directe (CCSD) 2025, Vol. NLP4DH
Eklund, Anton; Forsman, Mona; Drewes, Frank
On the power of local graph expansion grammars with and without additional restrictions
Theoretical Computer Science, Elsevier 2024, Vol. 1015
Drewes, Frank; Stade, Yannick
CIPHE: A Framework for Document Cluster Interpretation and Precision from Human Exploration
Proceedings of the 4th international conference on natural language processing for digital humanities, Association for Computational Linguistics 2024 : 536-548
Eklund, Anton; Forsman, Mona; Drewes, Frank
Optimal strategies for the static black-peg AB game with two and three pegs
Discrete Mathematics, Algorithms and Applications (DMAA), World Scientific 2024, Vol. 16, (4)
Jäger, Gerold; Drewes, Frank
Generating semantic graph corpora with graph expansion grammar
13th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2023), Open Publishing Association 2023 : 3-15
Andersson, Eric; Björklund, Johanna; Drewes, Frank; et al.
Generation and polynomial parsing of graph languages with non-structural reentrancies
Computational linguistics - Association for Computational Linguistics (Print), Association for Computational Linguistics 2023, Vol. 49, (4) : 841-882
Björklund, Johanna; Drewes, Frank; Jonsson, Anna
Hybrid tree automata and the yield theorem for constituent tree automata
Theoretical Computer Science, Elsevier 2023, Vol. 979
Drewes, Frank; Mörbitz, Richard; Vogler, Heiko
Preface
Developments in language theory: 27th International Conference, DLT 2023 Umeå, Sweden, June 12–16, 2023 Proceedings
Drewes, Frank; Volkov, Mikhail
An empirical configuration study of a common document clustering pipeline
Northern European Journal of Language Technology (NEJLT), Linköping University Electronic Press 2023, Vol. 9, (1)
Eklund, Anton; Forsman, Mona; Drewes, Frank
ADCluster: Adaptive Deep Clustering for unsupervised learning from unlabeled documents
Proceedings of the 6th International Conference on Natural Language and Speech Processing (ICNLSP 2023), Association for Computational Linguistics 2023 : 68-77
Hatefi, Arezoo; Vu, Xuan-Son; Bhuyan, Monowar H.; et al.
Improved N-Best Extraction with an Evaluation on Language Data
Computational linguistics - Association for Computational Linguistics (Print), MIT Press 2022, Vol. 48, (1) : 119-153
Björklund, Johanna; Drewes, Frank; Jonsson, Anna
Acyclic contextual hyperedge replacement: decidability of acyclicity and generative power
Graph Transformation: 15th International Conference, ICGT 2022, Held as Part of STAF 2022, Nantes, France, July 7–8, 2022, Proceedings, Cham: Springer 2022 : 3-19
Drewes, Frank; Hoffmann, Berthold; Minas, Mark
Hybrid Tree Automata and the Yield Theorem for Constituent Tree Automata
Implementation and Application of Automata (CIAA 2022): 26th International Conference, CIAA 2022, Rouen, France, June 28 – July 1, 2022, Proceedings, Springer Science+Business Media B.V. 2022 : 93-105
Drewes, Frank; Mörbitz, Richard; Vogler, Heiko
Dynamic topic modeling by clustering embeddings from pretrained language models: a research proposal
Proceedings of the 2nd conference of the Asia-Pacific chapter of the Association for computational linguistics and the 12th international joint conference on natural language processing: student research workshop, Association for Computational Linguistics (ACL) 2022 : 84-91
Eklund, Anton; Forsman, Mona; Drewes, Frank
Uniform Parsing for Hyperedge Replacement Grammars
Journal of computer and system sciences (Print), Elsevier 2021, Vol. 118 : 1-27
Björklund, Henrik; Drewes, Frank; Ericson, Petter; et al.
Bottom-up unranked tree-to-graph transducers for translation into semantic graphs
Theoretical Computer Science, Elsevier 2021, Vol. 870 : 3-28
Björklund, Johanna; Cohen, Shay B.; Drewes, Frank; et al.
Bridging Perception, Memory, and Inference through Semantic Relations
Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing, Association for Computational Linguistics (ACL) 2021 : 9136-9142
Björklund, Johanna; Dahlgren Lindström, Adam; Drewes, Frank
Rule-Based Top-Down Parsing for Acyclic Contextual Hyperedge Replacement Grammars
Graph Transformation: 14th International Conference, ICGT 2021, Held as Part of STAF 2021, Virtual Event, June 24–25, 2021, Proceedings
Drewes, Frank; Hoffmann, Berthold; Minas, Mark
AI för dokumentgenerering
Drewes, Frank; Prorok, Kalle
Cformer: Semi-Supervised Text Clustering Based on Pseudo Labeling
CIKM '21: Proceedings of the 30th ACM International Conference on Information & Knowledge Management, ACM Digital Library 2021 : 3078-3082
Hatefi, Arezoo; Vu, Xuan-Son; Bhuyan, Monowar H.; et al.
Towards Semantic Representations with a Temporal Dimension
SLTC 2020 – The Eighth Swedish Language Technology Conference, Online, November 25–27, 2020
Björklund, Johanna; Drewes, Frank; Mollevik, Iris
Probing Multimodal Embeddings for Linguistic Properties: the Visual-Semantic Case
Proceedings of the 28th International Conference on Computational Linguistics (COLING) : 730-744
Dahlgren Lindström, Adam; Björklund, Johanna; Bensch, Suna; et al.
Graph Parsing as Graph Transformation: Correctness of Predictive Top-Down Parsers
ICGT 2020. Lecture Notes in Computer Science
Drewes, Frank; Hoffmann, Berthold; Minas, Mark
Document Clustering Using Attentive Hierarchical Document Representation
SLTC 2020 – The Eighth Swedish Language Technology Conference, Online, November 25–27, 2020
Hatefi, Arezoo; Drewes, Frank
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
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
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.
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
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
Language Theoretic Properties of Regular DAG Languages
Information and Computation, Elsevier 2019, Vol. 265 : 57-76
Blum, Johannes; Drewes, Frank
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
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
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
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
Parsing Weighted Order-Preserving Hyperedge Replacement Grammars
Report / UMINF, 18.16
Björklund, Henrik; Drewes, Frank; Ericson, Petter
Uniform Parsing for Hyperedge Replacement Grammars
Report / UMINF, 18.13
Björklund, Henrik; Drewes, Frank; Ericson, Petter; et al.
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
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.
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
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
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
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
Preface
Theoretical Computer Science, Elsevier 2017, Vol. 679 : 1-1
Drewes, Frank
DAG automata for meaning representation
Proceedings of the 15th Meeting on the Mathematics of Language (MoL 2017) : 88-99
Drewes, Frank
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
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.
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
Visa publikationer i DiVA

Forskargrupper

Forskningsledare
Foundations of Language Processing

Forskningsprojekt

1 mars 2021 till 30 november 2021
AI för dokumentgenerering
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