Frank Drewes - RankMe

145 papers A 1B 16C 22Misc 1Journal 59Unranked 38

Year	Rank	Type	Title / Venue / Authors
2025	C	`conf`	Dynamically Weighted Tree Transducers. CIAA Frank Drewes, Marco Kuhlmann, Olle Torstensson
2025	B	`conf`	Graph Formulas and Their Translation to Alternating Graph Automata. ICGT Frank Drewes, Berthold Hoffmann, Mark Minas
2025	B	`conf`	Specifying and Checking Graph Properties with Alternating Graph Automata. ICGT Frank Drewes, Berthold Hoffmann, Mark Minas
2025	—	`conf`	Systems of Graph Formulas and their Equivalence to Alternating Graph Automata. GCM@STAF Frank Drewes, Berthold Hoffmann, Mark Minas
2025	J	`jnl`	The Efficiency of Pre-training with Objective Masking in Pseudo Labeling for Semi-Supervised Text Classification. CoRR Arezoo Hatefi, Xuan-Son Vu, Monowar Bhuyan, Frank Drewes
2024	J	`jnl`	On the power of local graph expansion grammars with and without additional restrictions. Theor. Comput. Sci. Frank Drewes, Yannick Stade
2024	J	`jnl`	Optimal strategies for the static black-peg AB game with two and three pegs. Discret. Math. Algorithms Appl. Gerold Jäger, Frank Drewes
2023	—	`conf`	ADCluster: Adaptive Deep Clustering for Unsupervised Learning from Unlabeled Documents. ICNLSP Arezoo Hatefi, Xuan-Son Vu, Monowar Bhuyan, Frank Drewes
2023	C	`ed.`	Developments in Language Theory - 27th International Conference, DLT 2023, Umeå, Sweden, June 12-16, 2023, Proceedings DLT Frank Drewes, Mikhail Volkov
2023	—	`conf`	Finite Automata for Efficient Graph Recognition. GCM Frank Drewes, Berthold Hoffmann, Mark Minas
2023	—	`conf`	Generating Semantic Graph Corpora with Graph Expansion Grammar. NCMA Eric Andersson, Johanna Björklund, Frank Drewes, Anna Jonsson
2023	J	`jnl`	Generation and Polynomial Parsing of Graph Languages with Non-Structural Reentrancies. Comput. Linguistics Johanna Björklund, Frank Drewes, Anna Jonsson
2023	J	`jnl`	Hybrid tree automata and the yield theorem for constituent tree automata. Theor. Comput. Sci. Frank Drewes, Richard Mörbitz, Heiko Vogler
2022	B	`conf`	Acyclic Contextual Hyperedge Replacement: Decidability of Acyclicity and Generative Power. ICGT Frank Drewes, Berthold Hoffmann, Mark Minas
2022	J	`jnl`	An Algebraic Approach to Learning and Grounding. CoRR Johanna Björklund, Adam Dahlgren Lindström, Frank Drewes
2022	—	`conf`	Dynamic Topic Modeling by Clustering Embeddings from Pretrained Language Models: A Research Proposal. AACL/IJCNLP 2022 (Student Research Workshop) Anton Eklund, Mona Forsman, Frank Drewes
2022	C	`conf`	Hybrid Tree Automata and the Yield Theorem for Constituent Tree Automata. CIAA Frank Drewes, Richard Mörbitz, Heiko Vogler
2022	J	`jnl`	Improved N-Best Extraction with an Evaluation on Language Data. Comput. Linguistics Johanna Björklund, Frank Drewes, Anna Jonsson
2021	J	`jnl`	Bottom-up unranked tree-to-graph transducers for translation into semantic graphs. Theor. Comput. Sci. Johanna Björklund, Shay B. Cohen, Frank Drewes, Giorgio Satta
2021	—	`conf`	Bridging Perception, Memory, and Inference through Semantic Relations. EMNLP (1) Johanna Björklund, Adam Dahlgren Lindström, Frank Drewes
2021	A	`conf`	Cformer: Semi-Supervised Text Clustering Based on Pseudo Labeling. CIKM Arezoo Hatefi, Xuan-Son Vu, Monowar Bhuyan, Frank Drewes
2021	J	`jnl`	Polynomial Graph Parsing with Non-Structural Reentrancies. CoRR Johanna Björklund, Frank Drewes, Anna Jonsson
2021	J	`jnl`	Probing Multimodal Embeddings for Linguistic Properties: the Visual-Semantic Case. CoRR Adam Dahlgren Lindström, Suna Bensch, Johanna Björklund, Frank Drewes
2021	—	`ed.`	Proceedings of the 17th Meeting on the Mathematics of Language, MOL 2021, Umeå, Sweden, December 13, 2021. MOL Henrik Björklund, Frank Drewes
2021	B	`conf`	Rule-Based Top-Down Parsing for Acyclic Contextual Hyperedge Replacement Grammars. ICGT Frank Drewes, Berthold Hoffmann, Mark Minas
2021	J	`jnl`	Uniform parsing for hyperedge replacement grammars. J. Comput. Syst. Sci. Henrik Björklund, Frank Drewes, Petter Ericson, Florian Starke
2020	B	`conf`	Graph Parsing as Graph Transformation - Correctness of Predictive Top-Down Parsers. ICGT Frank Drewes, Berthold Hoffmann, Mark Minas
2020	B	`conf`	Probing Multimodal Embeddings for Linguistic Properties: the Visual-Semantic Case. COLING Adam Dahlgren Lindström, Johanna Björklund, Suna Bensch, Frank Drewes
2020	J	`jnl`	The metric dimension of Zn×Zn×Zn is ⌊3 Theor. Comput. Sci. Gerold Jäger, Frank Drewes
2019	—	`conf`	A Survey of Recent Advances in Efficient Parsing for Graph Grammars. FSMNLP Frank Drewes
2019	—	`conf`	Bottom-Up Unranked Tree-to-Graph Transducers for Translation into Semantic Graphs. FSMNLP Johanna Björklund, Shay B. Cohen, Frank Drewes, Giorgio Satta
2019	J	`jnl`	Efficient enumeration of weighted tree languages over the tropical semiring. J. Comput. Syst. Sci. Johanna Björklund, Frank Drewes, Niklas Zechner
2019	B	`conf`	Extending Predictive Shift-Reduce Parsing to Contextual Hyperedge Replacement Grammars. ICGT Frank Drewes, Berthold Hoffmann, Mark Minas
2019	J	`jnl`	Finite-state methods in natural language processing and mathematics of language. Introduction to the special issue. J. Lang. Model. Frank Drewes, Makoto Kanazawa
2019	J	`jnl`	Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement. J. Log. Algebraic Methods Program. Frank Drewes, Berthold Hoffmann, Mark Minas
2019	J	`jnl`	Language theoretic properties of regular DAG languages. Inf. Comput. Johannes Blum, Frank Drewes
2019	C	`conf`	Z-Automata for Compact and Direct Representation of Unranked Tree Languages. CIAA Johanna Björklund, Frank Drewes, Giorgio Satta
2018	C	`conf`	A Comparison of Two N-Best Extraction Methods for Weighted Tree Automata. CIAA Johanna Björklund, Frank Drewes, Anna Jonsson
2018	B	`conf`	An Optimal Strategy for Static Black-Peg Mastermind with Three Pegs. SAGT Gerold Jäger, Frank Drewes
2018	J	`jnl`	Formalization and Correctness of Predictive Shift-Reduce Parsers for Graph Grammars based on Hyperedge Replacement. CoRR Frank Drewes, Berthold Hoffmann, Mark Minas
2018	—	`conf`	On regular expressions with backreferences and transducers. NCMA Martin Berglund, Frank Drewes, Brink van der Merwe
2018	J	`jnl`	The Output Size Problem for String-to-Tree Transducers. J. Autom. Lang. Comb. Martin Berglund, Frank Drewes, Brink van der Merwe
2018	J	`jnl`	Weighted DAG Automata for Semantic Graphs. Comput. Linguistics David Chiang, Frank Drewes, Daniel Gildea, Adam Lopez, Giorgio Satta
2017	—	`conf`	Contextual Hyperedge Replacement Grammars for Abstract Meaning Representations. TAG Frank Drewes, Anna Jonsson
2017	—	`conf`	DAG Automata for Meaning Representation. MOL Frank Drewes
2017	J	`jnl`	Finding the N best vertices in an infinite weighted hypergraph. Theor. Comput. Sci. Johanna Björklund, Frank Drewes, Anna Jonsson
2017	C	`ed.`	Language and Automata Theory and Applications - 11th International Conference, LATA 2017, Umeå, Sweden, March 6-9, 2017, Proceedings LATA Frank Drewes, Carlos Martín-Vide, Bianca Truthe
2017	J	`jnl`	On DAG Languages and DAG Transducers. Bull. EATCS Frank Drewes
2017	B	`conf`	Predictive Shift-Reduce Parsing for Hyperedge Replacement Grammars. ICGT Frank Drewes, Berthold Hoffmann, Mark Minas
2017	J	`jnl`	Preface. Theor. Comput. Sci. Frank Drewes
2017	—	`ed.`	Proceedings of the 13th International Conference on Finite State Methods and Natural Language Processing, FSMNLP 2017, Umeå, Sweden, September 2017 FSMNLP Frank Drewes
2017	—	`conf`	Single-Rooted DAGs in Regular DAG Languages: Parikh Image and Path Languages. TAG Martin Berglund, Henrik Björklund, Frank Drewes
2017	J	`jnl`	Tight Bounds for Cut-Operations on Deterministic Finite Automata. Fundam. Informaticae Frank Drewes, Markus Holzer, Sebastian Jakobi, Brink van der Merwe
2016	—	`conf`	Approximating Parikh Images for Generating Deterministic Graph Parsers. STAF Workshops Frank Drewes, Berthold Hoffmann, Mark Minas
2016	C	`conf`	Between a Rock and a Hard Place - Uniform Parsing for Hyperedge Replacement DAG Grammars. LATA Henrik Björklund, Frank Drewes, Petter Ericson
2016	C	`conf`	Properties of Regular DAG Languages. LATA Johannes Blum, Frank Drewes
2015	C	`conf`	An Efficient Best-Trees Algorithm for Weighted Tree Automata over the Tropical Semiring. LATA Johanna Björklund, Frank Drewes, Niklas Zechner
2015	J	`jnl`	Context-Free Tree Grammars are as Powerful as Context-Free Jungle Grammars. Acta Cybern. Frank Drewes, Joost Engelfriet
2015	J	`jnl`	Contextual hyperedge replacement. Acta Informatica Frank Drewes, Berthold Hoffmann
2015	J	`jnl`	Formal Models of Graph Transformation in Natural Language Processing (Dagstuhl Seminar 15122). Dagstuhl Reports Frank Drewes, Kevin Knight, Marco Kuhlmann
2015	—	`conf`	Grammatical inference of graph transformation rules. NCMA Suna Bensch, Frank Drewes, Thomas Hellström
2015	C	`ed.`	Implementation and Application of Automata - 20th International Conference, CIAA 2015, Umeå, Sweden, August 18-21, 2015, Proceedings CIAA Frank Drewes
2015	—	`conf`	MICO - Media in Context. ICME Workshops Patrick Aichroth, Christian Weigel, Thomas Kurz, Horst Stadler, Frank Drewes, Johanna Björklund, Kai Schlegel, Emanuel Berndl, Antonio Perez, Alex Bowyer, Andrea Volpini
2015	B	`conf`	Predictive Top-Down Parsing for Hyperedge Replacement Grammars. ICGT Frank Drewes, Berthold Hoffmann, Mark Minas
2015	J	`jnl`	Preface. Fundam. Informaticae Suna Bensch, Frank Drewes, Mika Hirvensalo, Friedrich Otto
2015	J	`jnl`	Structurally Cyclic Petri Nets. Log. Methods Comput. Sci. Frank Drewes, Jérôme Leroux
2015	J	`jnl`	The generative power of delegation networks. Inf. Comput. Frank Drewes, Joost Engelfriet
2015	C	`conf`	Tight Bounds for Cut-Operations on Deterministic Finite Automata. MCU Frank Drewes, Markus Holzer, Sebastian Jakobi, Brink van der Merwe
2014	—	`conf`	Analyzing Catastrophic Backtracking Behavior in Practical Regular Expression Matching. AFL Martin Berglund, Frank Drewes, Brink van der Merwe
2014	J	`jnl`	Graph transformation for incremental natural language analysis. Theor. Comput. Sci. Suna Bensch, Frank Drewes, Helmut Jürgensen, Brink van der Merwe
2013	C	`conf`	Cuts in Regular Expressions. Developments in Language Theory Martin Berglund, Henrik Björklund, Frank Drewes, Brink van der Merwe, Bruce W. Watson
2013	—	`ed.`	Fifth Workshop on Non-Classical Models for Automata and Applications - NCMA 2013, Umeå, Sweden, August 13 - August 14, 2013, Proceedings NCMA Suna Bensch, Frank Drewes, Rudolf Freund, Friedrich Otto
2013	—	`conf`	Millstream Systems and Graph Transformation for Complex Linguistic Models - (Extended Abstract). DCFS Frank Drewes
2013	—	`conf`	On the Parameterized Complexity of Linear Context-Free Rewriting Systems. MOL Martin Berglund, Henrik Björklund, Frank Drewes
2012	—	`ed.`	Proceedings of the Workshop on Applications of Tree Automata Techniques in Natural Language Processing, ATANLP 2012, Avignon, France, April 24, 2012 ATANLP@EACL Frank Drewes, Marco Kuhlmann
2011	—	`conf`	Contextual Hyperedge Replacement. AGTIVE Frank Drewes, Berthold Hoffmann, Mark Minas
2011	—	`conf`	Incremental Construction of Millstream Configurations Using Graph Transformation. FSMNLP Suna Bensch, Frank Drewes, Helmut Jürgensen, Brink van der Merwe
2011	J	`jnl`	MAT learners for tree series: an abstract data type and two realizations. Acta Informatica Frank Drewes, Johanna Högberg, Andreas Maletti
2011	—	`conf`	Selected Decision Problems for Square-Refinement Collage Grammars. Algebraic Foundations in Computer Science Frank Drewes
2011	—	`conf`	Term Graph Rewriting and Parallel Term Rewriting TERMGRAPH Andrea Corradini, Frank Drewes
2010	J	`jnl`	Adaptive star grammars and their languages. Theor. Comput. Sci. Frank Drewes, Berthold Hoffmann, Dirk Janssens, Mark Minas
2010	C	`conf`	Algorithmic Properties of Millstream Systems. Developments in Language Theory Suna Bensch, Henrik Björklund, Frank Drewes
2010	J	`jnl`	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. Frank Drewes, Annegret Habel, Berthold Hoffmann, Detlef Plump
2010	—	`conf`	Millstream Systems - a Formal Model for Linking Language Modules by Interfaces. ATANLP@ACL 2010 Suna Bensch, Frank Drewes
2010	Misc	`conf`	On the Complexity of Variants of the PSC Martin Berglund, Frank Drewes
2010	—	`ed.`	Proceedings of the Workshop on Applications of Tree Automata in Natural Language Processing, ATANLP@ACL 2010, Uppsala, Sweden, July 16, 2010 ATANLP@ACL 2010 Frank Drewes, Marco Kuhlmann
2010	J	`jnl`	Towards the Tree Automata Workbench Marbles. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. Frank Drewes
2009	J	`jnl`	MAT Learners for Recognizable Tree Languages and Tree Series. Acta Cybern. Frank Drewes
2008	B	`conf`	Adaptive Star Grammars for Graph Models. ICGT Frank Drewes, Berthold Hoffmann, Mark Minas
2008	J	`jnl`	Bag Context Tree Grammars. Fundam. Informaticae Frank Drewes, Christine du Toit, Sigrid Ewert, Brink van der Merwe, Andries P. J. van der Walt
2008	J	`jnl`	Path Languages of Random Permitting Context Tree Grammars are Regular. Fundam. Informaticae Frank Drewes, Brink van der Merwe
2007	—	`conf`	An Algebra for Tree-Based Music Generation. CAI Frank Drewes, Johanna Högberg
2007	—	`conf`	From Tree-Based Generators to Delegation Networks. CAI Frank Drewes
2007	J	`jnl`	Learning Deterministically Recognizable Tree Series. J. Autom. Lang. Comb. Frank Drewes, Heiko Vogler
2007	J	`jnl`	Links. Int. J. Found. Comput. Sci. Frank Drewes
2007	J	`jnl`	Query Learning of Regular Tree Languages: How to Avoid Dead States. Theory Comput. Syst. Frank Drewes, Johanna Högberg
2007	—	`conf`	Shaped Generic Graph Transformation. AGTIVE Frank Drewes, Berthold Hoffmann, Dirk Janssens, Mark Minas, Niels Van Eetvelde
2006	B	`conf`	Adaptive Star Grammars. ICGT Frank Drewes, Berthold Hoffmann, Dirk Janssens, Mark Minas, Niels Van Eetvelde
2006	C	`conf`	Bag Context Tree Grammars. Developments in Language Theory Frank Drewes, Christine du Toit, Sigrid Ewert, Brink van der Merwe, Andries P. J. van der Walt
2006	—	`book`	Grammatical Picture Generation - A Tree-Based Approach Frank Drewes
2005	J	`jnl`	Random context tree grammars and tree transducers. South Afr. Comput. J. Frank Drewes, Christine du Toit, Sigrid Ewert, Johanna Högberg, Brink van der Merwe, Andries P. J. van der Walt
2004	J	`jnl`	Branching synchronization grammars with nested tables. J. Comput. Syst. Sci. Frank Drewes, Joost Engelfriet
2004	—	`conf`	Rule-Based Programming with Diaplan. GraBaTs Frank Drewes, Berthold Hoffmann, Raimund Klein, Mark Minas
2003	C	`conf`	Branching Grammars: A Generalization of ET0L Systems. Developments in Language Theory Frank Drewes, Joost Engelfriet
2003	J	`jnl`	Computing Raster Images from Grid Picture Grammars. J. Autom. Lang. Comb. Frank Drewes, Sigrid Ewert, Renate Klempien-Hinrichs, Hans-Jörg Kreowski
2003	J	`jnl`	Criteria to disprove context freeness of collage languages. Theor. Comput. Sci. Frank Drewes, Hans-Jörg Kreowski, Denis Lapoire
2003	C	`conf`	Learning a Regular Tree Language from a Teacher. Developments in Language Theory Frank Drewes, Johanna Högberg
2003	J	`jnl`	Table-Driven and Context-Sensitive Collage Languages. J. Autom. Lang. Comb. Frank Drewes, Renate Klempien-Hinrichs, Hans-Jörg Kreowski
2002	J	`jnl`	Hierarchical Graph Transformation. J. Comput. Syst. Sci. Frank Drewes, Berthold Hoffmann, Detlef Plump
2001	—	`conf`	Reading words in graphs generated by hyperedge replacement. Where Mathematics, Computer Science, Linguistics and Biology Meet Frank Drewes, Hans-Jörg Kreowski
2001	J	`jnl`	The Complexity of the Exponential Output Size Problem for Top-Down and Bottom-Up Tree Transducers. Inf. Comput. Frank Drewes
2001	J	`jnl`	Tree-based generation of languages of fractals. Theor. Comput. Sci. Frank Drewes
2000	C	`conf`	Computing Raster Images from Grid Picture Grammars. CIAA Frank Drewes, Sigrid Ewert, Renate Klempien-Hinrichs, Hans-Jörg Kreowski
2000	B	`conf`	Hierarchical Graph Transformation. FoSSaCS Frank Drewes, Berthold Hoffmann, Detlef Plump
2000	C	`conf`	Picking Knots from Trees - The Syntactic Structure of Celtic Knotwork. Diagrams Frank Drewes, Renate Klempien-Hinrichs
2000	C	`conf`	TREEBAG. CIAA Frank Drewes, Renate Klempien-Hinrichs
2000	J	`jnl`	Tree-based picture generation. Theor. Comput. Sci. Frank Drewes
1999	J	`jnl`	A Characterization of the Sets of Hypertrees Generated by Hyperedge-Replacement Graph Grammars. Theory Comput. Syst. Frank Drewes
1999	B	`conf`	Exponential Output Size of Top-Down Tree Transducers. FCT Frank Drewes
1999	—	`conf`	Graph Transformation Modules and Their Composition. AGTIVE Frank Drewes, Peter Knirsch, Hans-Jörg Kreowski, Sabine Kuske
1999	—	`conf`	TREEBAG - a Short Presentation. AGTIVE Frank Drewes, Peter Knirsch
1999	C	`conf`	Table-driven and context-sensitive collage languages. Developments in Language Theory Frank Drewes, Renate Klempien-Hinrichs, Hans-Jörg Kreowski
1998	J	`jnl`	Decidability of the Finiteness of Ranges of Tree Transductions. Inf. Comput. Frank Drewes, Joost Engelfriet
1998	—	`conf`	Some Remarks on the Generative Power of Collage Grammars and Chain-Code Grammars. TAGT Frank Drewes
1998	—	`conf`	TREEBAG - Baum-basierte Generierung und Transformation von Objekten. GI Jahrestagung Frank Drewes
1997	B	`conf`	Criteria to Disprove Context-Freeness of Collage Languages. FCT Frank Drewes, Hans-Jörg Kreowski, Denis Lapoire
1997	—	`ch.`	Hyperedge Replacement, Graph Grammars. Handbook of Graph Grammars Frank Drewes, Hans-Jörg Kreowski, Annegret Habel
1997	B	`conf`	On the Generation of Trees by Hyperedge Replacement. MFCS Frank Drewes
1996	J	`jnl`	(Un-)Decidability of Geometric Properties of Pictures Generated by Collage Grammars. Fundam. Informaticae Frank Drewes, Hans-Jörg Kreowski
1996	J	`jnl`	A Lower Bound on the Growth of Functions Computed by Tree Transducers. Fundam. Informaticae Frank Drewes
1996	—	`—`	Computation by tree transductions. Frank Drewes
1996	J	`jnl`	Language Theoretic and Algorithmic Properties of d-dimensional Collages and Patterns in a Grid. J. Comput. Syst. Sci. Frank Drewes
1995	J	`jnl`	Generating Self-Affine Fractals by Collage Grammars. Theor. Comput. Sci. Frank Drewes, Annegret Habel, Hans-Jörg Kreowski, Stefan Taubenberger
1995	C	`conf`	On the Connectedness of Pictures Defined by Iterated Function Systems. Developments in Language Theory Frank Drewes
1995	—	`conf`	Semirings and tree-to-graph-to-tree transductions. SEGRAGRA Frank Drewes
1994	—	`conf`	A Lower Bound on the Growth of Functions Computed by Tree Transductions. CAAP Frank Drewes
1994	—	`conf`	The Use of Tree Transducers to Compute Translations Between Graph Algebras. TAGT Frank Drewes
1993	J	`jnl`	A scetch of Collage Grammars. Bull. EATCS Frank Drewes, Annegret Habel, Hans-Jörg Kreowski, Stefan Taubenberger
1993	C	`conf`	Generating Self-Affine Fractals by Collage Grammars. Developments in Language Theory Frank Drewes, Annegret Habel, Hans-Jörg Kreowski, Stefan Taubenberger
1993	—	`conf`	Hyperedge Replacement with Rendevous. TAPSOFT N. Gnanamalar David, Frank Drewes, Hans-Jörg Kreowski
1993	J	`jnl`	NP-Completeness of k-Connected Hyperedge-Replacement Languages of Order k. Inf. Process. Lett. Frank Drewes
1993	J	`jnl`	Recognising k-Connected Hypergraphs in Cubic Time. Theor. Comput. Sci. Frank Drewes
1991	—	`conf`	Incremental Termination Proofs and the Length of Derivations. RTA Frank Drewes, Clemens Lautemann
1991	J	`jnl`	Some modifications of auxiliary pushdown automata. RAIRO Theor. Informatics Appl. Gerhard Buntrock, Frank Drewes, Clemens Lautemann, Till Mossakowski
1990	—	`conf`	A Note on Hyperedge Replacement. Graph-Grammars and Their Application to Computer Science Frank Drewes, Hans-Jörg Kreowski