Frank Drewes

ORCID

Publication Activity (10 Years)

Years Active: 1990-2024
Publications (10 Years): 47

Top Venues

University of Bremen, Germany (PHD)

Education History

University of Bremen, Germany

PHD

Publications

Frank Drewes, Yannick Stade
On the power of local graph expansion grammars with and without additional restrictions. Theor. Comput. Sci. 1015 (2024)
Frank Drewes, Berthold Hoffmann, Mark Minas
Finite Automata for Efficient Graph Recognition. CoRR (2024)
Gerold Jäger, Frank Drewes
Optimal strategies for the static black-peg AB game with two and three pegs. Discret. Math. Algorithms Appl. 16 (4) (2024)
Johanna Björklund, Frank Drewes, Anna Jonsson
Generation and Polynomial Parsing of Graph Languages with Non-Structural Reentrancies. Comput. Linguistics 49 (4) (2023)
Frank Drewes, Richard Mörbitz, Heiko Vogler
Hybrid tree automata and the yield theorem for constituent tree automata. Theor. Comput. Sci. 979 (2023)
Arezoo Hatefi, Xuan-Son Vu, Monowar H. Bhuyan, Frank Drewes
ADCluster: Adaptive Deep Clustering for Unsupervised Learning from Unlabeled Documents. ICNLSP (2023)
Eric Andersson, Johanna Björklund, Frank Drewes, Anna Jonsson
Generating Semantic Graph Corpora with Graph Expansion Grammar. NCMA (2023)
Johanna Björklund, Adam Dahlgren Lindström, Frank Drewes
An Algebraic Approach to Learning and Grounding. CoRR (2022)
Johanna Björklund, Frank Drewes, Anna Jonsson
Improved N-Best Extraction with an Evaluation on Language Data. Comput. Linguistics 48 (1) (2022)
Frank Drewes, Richard Mörbitz, Heiko Vogler
Hybrid Tree Automata and the Yield Theorem for Constituent Tree Automata. CIAA (2022)
Frank Drewes, Berthold Hoffmann, Mark Minas
Acyclic Contextual Hyperedge Replacement: Decidability of Acyclicity and Generative Power. ICGT (2022)
Anton Eklund, Mona Forsman, Frank Drewes
Dynamic Topic Modeling by Clustering Embeddings from Pretrained Language Models: A Research Proposal. AACL/IJCNLP 2022 (Student Research Workshop) (2022)
Henrik Björklund, Frank Drewes, Petter Ericson, Florian Starke
Uniform parsing for hyperedge replacement grammars. J. Comput. Syst. Sci. 118 (2021)
Johanna Björklund, Frank Drewes, Anna Jonsson
Polynomial Graph Parsing with Non-Structural Reentrancies. CoRR (2021)
Frank Drewes, Berthold Hoffmann, Mark Minas
Rule-Based Top-Down Parsing for Acyclic Contextual Hyperedge Replacement Grammars. ICGT (2021)
Johanna Björklund, Shay B. Cohen, Frank Drewes, Giorgio Satta
Bottom-up unranked tree-to-graph transducers for translation into semantic graphs. Theor. Comput. Sci. 870 (2021)
Adam Dahlgren Lindström, Suna Bensch, Johanna Björklund, Frank Drewes
Probing Multimodal Embeddings for Linguistic Properties: the Visual-Semantic Case. CoRR (2021)
Johanna Björklund, Adam Dahlgren Lindström, Frank Drewes
Bridging Perception, Memory, and Inference through Semantic Relations. EMNLP (1) (2021)
Arezoo Hatefi, Xuan-Son Vu, Monowar H. Bhuyan, Frank Drewes
Cformer: Semi-Supervised Text Clustering Based on Pseudo Labeling. CIKM (2021)
Gerold Jäger, Frank Drewes
/2⌋. Theor. Comput. Sci. 806 (2020)
Frank Drewes, Berthold Hoffmann, Mark Minas
Graph Parsing as Graph Transformation - Correctness of Predictive Top-Down Parsers. ICGT (2020)
Adam Dahlgren Lindström, Johanna Björklund, Suna Bensch, Frank Drewes
Probing Multimodal Embeddings for Linguistic Properties: the Visual-Semantic Case. COLING (2020)
Frank Drewes, Berthold Hoffmann, Mark Minas
Extending Predictive Shift-Reduce Parsing to Contextual Hyperedge Replacement Grammars. ICGT (2019)
Frank Drewes, Berthold Hoffmann, Mark Minas
Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement. J. Log. Algebraic Methods Program. 104 (2019)
Johannes Blum, Frank Drewes
Language theoretic properties of regular DAG languages. Inf. Comput. 265 (2019)
Johanna Björklund, Shay B. Cohen, Frank Drewes, Giorgio Satta
Bottom-Up Unranked Tree-to-Graph Transducers for Translation into Semantic Graphs. FSMNLP (2019)
Johanna Björklund, Frank Drewes, Giorgio Satta
Z-Automata for Compact and Direct Representation of Unranked Tree Languages. CIAA (2019)
Frank Drewes
A Survey of Recent Advances in Efficient Parsing for Graph Grammars. FSMNLP (2019)
Johanna Björklund, Frank Drewes, Niklas Zechner
Efficient enumeration of weighted tree languages over the tropical semiring. J. Comput. Syst. Sci. 104 (2019)
Frank Drewes, Makoto Kanazawa
Finite-state methods in natural language processing and mathematics of language. Introduction to the special issue. J. Lang. Model. 7 (2) (2019)
David Chiang, Frank Drewes, Daniel Gildea, Adam Lopez, Giorgio Satta
Weighted DAG Automata for Semantic Graphs. Comput. Linguistics 44 (1) (2018)
Martin Berglund, Frank Drewes, Brink van der Merwe
On regular expressions with backreferences and transducers. NCMA (2018)
Gerold Jäger, Frank Drewes
An Optimal Strategy for Static Black-Peg Mastermind with Three Pegs. SAGT (2018)
Martin Berglund, Frank Drewes, Brink van der Merwe
The Output Size Problem for String-to-Tree Transducers. J. Autom. Lang. Comb. 23 (1-3) (2018)
Frank Drewes, Berthold Hoffmann, Mark Minas
Formalization and Correctness of Predictive Shift-Reduce Parsers for Graph Grammars based on Hyperedge Replacement. CoRR (2018)
Johanna Björklund, Frank Drewes, Anna Jonsson
A Comparison of Two N-Best Extraction Methods for Weighted Tree Automata. CIAA (2018)
Johanna Björklund, Frank Drewes, Anna Jonsson
Finding the N best vertices in an infinite weighted hypergraph. Theor. Comput. Sci. 682 (2017)
Frank Drewes
Preface. Theor. Comput. Sci. 679 (2017)
Frank Drewes, Markus Holzer, Sebastian Jakobi, Brink van der Merwe
Tight Bounds for Cut-Operations on Deterministic Finite Automata. Fundam. Informaticae 155 (1-2) (2017)
Frank Drewes
On DAG Languages and DAG Transducers. Bull. EATCS 121 (2017)
Frank Drewes
DAG Automata for Meaning Representation. MOL (2017)
Frank Drewes, Berthold Hoffmann, Mark Minas
Predictive Shift-Reduce Parsing for Hyperedge Replacement Grammars. ICGT (2017)
Martin Berglund, Henrik Björklund, Frank Drewes
Single-Rooted DAGs in Regular DAG Languages: Parikh Image and Path Languages. TAG (2017)
Frank Drewes, Anna Jonsson
Contextual Hyperedge Replacement Grammars for Abstract Meaning Representations. TAG (2017)
Frank Drewes, Berthold Hoffmann, Mark Minas
Approximating Parikh Images for Generating Deterministic Graph Parsers. STAF Workshops (2016)
Henrik Björklund, Frank Drewes, Petter Ericson
Between a Rock and a Hard Place - Uniform Parsing for Hyperedge Replacement DAG Grammars. LATA (2016)
Johannes Blum, Frank Drewes
Properties of Regular DAG Languages. LATA (2016)
Frank Drewes, Joost Engelfriet
The generative power of delegation networks. Inf. Comput. 245 (2015)
Frank Drewes, Berthold Hoffmann
Contextual hyperedge replacement. Acta Informatica 52 (6) (2015)
Frank Drewes, Markus Holzer, Sebastian Jakobi, Brink van der Merwe
Tight Bounds for Cut-Operations on Deterministic Finite Automata. MCU (2015)
Johanna Björklund, Frank Drewes, Niklas Zechner
An Efficient Best-Trees Algorithm for Weighted Tree Automata over the Tropical Semiring. LATA (2015)
Frank Drewes, Joost Engelfriet
Context-Free Tree Grammars are as Powerful as Context-Free Jungle Grammars. Acta Cybern. 22 (2) (2015)
Patrick Aichroth, Christian Weigel, Thomas Kurz, Horst Stadler, Frank Drewes, Johanna Björklund, Kai Schlegel, Emanuel Berndl, Antonio Perez, Alex Bowyer, Andrea Volpini
MICO - Media in Context. ICME Workshops (2015)
Suna Bensch, Frank Drewes, Mika Hirvensalo, Friedrich Otto
Preface. Fundam. Informaticae 136 (1-2) (2015)
Frank Drewes, Jérôme Leroux
Structurally Cyclic Petri Nets. Log. Methods Comput. Sci. 11 (4) (2015)
Frank Drewes, Berthold Hoffmann, Mark Minas
Predictive Top-Down Parsing for Hyperedge Replacement Grammars. ICGT (2015)
Frank Drewes, Kevin Knight, Marco Kuhlmann
Formal Models of Graph Transformation in Natural Language Processing (Dagstuhl Seminar 15122). Dagstuhl Reports 5 (3) (2015)
Suna Bensch, Frank Drewes, Thomas Hellström
Grammatical inference of graph transformation rules. NCMA (2015)
Suna Bensch, Frank Drewes, Helmut Jürgensen, Brink van der Merwe
Graph transformation for incremental natural language analysis. Theor. Comput. Sci. 531 (2014)
Martin Berglund, Frank Drewes, Brink van der Merwe
Analyzing Catastrophic Backtracking Behavior in Practical Regular Expression Matching. AFL (2014)
Martin Berglund, Henrik Björklund, Frank Drewes
On the Parameterized Complexity of Linear Context-Free Rewriting Systems. MOL (2013)
Frank Drewes
Millstream Systems and Graph Transformation for Complex Linguistic Models - (Extended Abstract). DCFS (2013)
Martin Berglund, Henrik Björklund, Frank Drewes, Brink van der Merwe, Bruce W. Watson
Cuts in Regular Expressions. Developments in Language Theory (2013)
Frank Drewes
Selected Decision Problems for Square-Refinement Collage Grammars. Algebraic Foundations in Computer Science (2011)
Frank Drewes, Johanna Högberg, Andreas Maletti
MAT learners for tree series: an abstract data type and two realizations. Acta Informatica 48 (3) (2011)
Andrea Corradini, Frank Drewes
Term Graph Rewriting and Parallel Term Rewriting TERMGRAPH (2011)
Suna Bensch, Frank Drewes, Helmut Jürgensen, Brink van der Merwe
Incremental Construction of Millstream Configurations Using Graph Transformation. FSMNLP (2011)
Frank Drewes, Berthold Hoffmann, Mark Minas
Contextual Hyperedge Replacement. AGTIVE (2011)
Suna Bensch, Frank Drewes
Millstream Systems - a Formal Model for Linking Language Modules by Interfaces. ATANLP@ACL 2010 (2010)
Frank Drewes
Towards the Tree Automata Workbench Marbles. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 26 (2010)
Suna Bensch, Henrik Björklund, Frank Drewes
Algorithmic Properties of Millstream Systems. Developments in Language Theory (2010)
Martin Berglund, Frank Drewes
Best Strings Problem. Stringology (2010)
Frank Drewes, Berthold Hoffmann, Dirk Janssens, Mark Minas
Adaptive star grammars and their languages. Theor. Comput. Sci. 411 (34-36) (2010)
Frank Drewes, Annegret Habel, Berthold Hoffmann, Detlef Plump
Manipulation of Graphs, Algebras and Pictures. Essays Dedicated to Hans-Jörg Kreowski on the Occasion of His 60th Birthday. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 26 (2010)
Frank Drewes
MAT Learners for Recognizable Tree Languages and Tree Series. Acta Cybern. 19 (2) (2009)
Frank Drewes, Christine du Toit, Sigrid Ewert, Brink van der Merwe, Andries P. J. van der Walt
Bag Context Tree Grammars. Fundam. Informaticae 86 (4) (2008)
Frank Drewes, Berthold Hoffmann, Mark Minas
Adaptive Star Grammars for Graph Models. ICGT (2008)
Frank Drewes, Brink van der Merwe
Path Languages of Random Permitting Context Tree Grammars are Regular. Fundam. Informaticae 82 (1-2) (2008)
Frank Drewes, Johanna Högberg
An Algebra for Tree-Based Music Generation. CAI (2007)
Frank Drewes
Links. Int. J. Found. Comput. Sci. 18 (6) (2007)
Frank Drewes
From Tree-Based Generators to Delegation Networks. CAI (2007)
Frank Drewes, Heiko Vogler
Learning Deterministically Recognizable Tree Series. J. Autom. Lang. Comb. 12 (3) (2007)
Frank Drewes, Johanna Högberg
Query Learning of Regular Tree Languages: How to Avoid Dead States. Theory Comput. Syst. 40 (2) (2007)
Frank Drewes, Berthold Hoffmann, Dirk Janssens, Mark Minas, Niels Van Eetvelde
Shaped Generic Graph Transformation. AGTIVE (2007)
Frank Drewes, Christine du Toit, Sigrid Ewert, Brink van der Merwe, Andries P. J. van der Walt
Bag Context Tree Grammars. Developments in Language Theory (2006)
Frank Drewes, Berthold Hoffmann, Dirk Janssens, Mark Minas, Niels Van Eetvelde
Adaptive Star Grammars. ICGT (2006)
Frank Drewes, Christine du Toit, Sigrid Ewert, Johanna Högberg, Brink van der Merwe, Andries P. J. van der Walt
Random context tree grammars and tree transducers. South Afr. Comput. J. 34 (2005)
Frank Drewes, Berthold Hoffmann, Raimund Klein, Mark Minas
Rule-Based Programming with Diaplan. Electron. Notes Theor. Comput. Sci. 127 (1) (2005)
Frank Drewes, Joost Engelfriet
Branching synchronization grammars with nested tables. J. Comput. Syst. Sci. 68 (3) (2004)
Frank Drewes, Joost Engelfriet
Branching Grammars: A Generalization of ET0L Systems. Developments in Language Theory (2003)
Frank Drewes, Hans-Jörg Kreowski, Denis Lapoire
Criteria to disprove context freeness of collage languages. Theor. Comput. Sci. 290 (3) (2003)
Frank Drewes, Sigrid Ewert, Renate Klempien-Hinrichs, Hans-Jörg Kreowski
Computing Raster Images from Grid Picture Grammars. J. Autom. Lang. Comb. 8 (3) (2003)
Frank Drewes, Johanna Högberg
Learning a Regular Tree Language from a Teacher. Developments in Language Theory (2003)
Frank Drewes, Renate Klempien-Hinrichs, Hans-Jörg Kreowski
Table-Driven and Context-Sensitive Collage Languages. J. Autom. Lang. Comb. 8 (1) (2003)
Frank Drewes, Berthold Hoffmann, Detlef Plump
Hierarchical Graph Transformation. J. Comput. Syst. Sci. 64 (2) (2002)
Frank Drewes, Hans-Jörg Kreowski
Reading words in graphs generated by hyperedge replacement. Where Mathematics, Computer Science, Linguistics and Biology Meet (2001)
Frank Drewes
Tree-based generation of languages of fractals. Theor. Comput. Sci. 262 (1) (2001)
Frank Drewes
The Complexity of the Exponential Output Size Problem for Top-Down and Bottom-Up Tree Transducers. Inf. Comput. 169 (2) (2001)
Frank Drewes, Renate Klempien-Hinrichs
Picking Knots from Trees - The Syntactic Structure of Celtic Knotwork. Diagrams (2000)
Frank Drewes, Renate Klempien-Hinrichs
TREEBAG. CIAA (2000)

Frank Drewes.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Frank Drewes