activity
20112023
most citedAnalyzing Catastrophic Backtracking Behavior in Practical Regular Expression Matching

24 citations · 60 across the 9 of their papers we have counts for

collaborators

9 papers

cs.FL2023

Generating Semantic Graph Corpora with Graph Expansion Grammar

Eric Andersson, Johanna Björklund, Frank Drewes +1

We introduce Lovelace, a tool for creating corpora of semantic graphs. The system uses graph expansion grammar as a representational language, thus allowing users to craft a gramma…

math.CO2022

Optimal Strategies for Static Black-Peg AB Game With Two and Three Pegs

Gerold Jäger, Frank Drewes

The AB~Game is a game similar to the popular game Mastermind. We study a version of this game called Static Black-Peg AB~Game. It is played by two players, the codemaker and the co…

cs.CL2022

An Algebraic Approach to Learning and Grounding

Johanna Björklund, Adam Dahlgren Lindström, Frank Drewes

We consider the problem of learning the semantics of composite algebraic expressions from examples. The outcome is a versatile framework for studying learning tasks that can be put…

cs.FL2021★ 1 cited

Polynomial Graph Parsing with Non-Structural Reentrancies

Johanna Björklund, Frank Drewes, Anna Jonsson

Graph-based semantic representations are valuable in natural language processing, where it is often simple and effective to represent linguistic concepts as nodes, and relations as…

cs.LG2021★ 6 cited

Probing Multimodal Embeddings for Linguistic Properties: the Visual-Semantic Case

Adam Dahlgren Lindström, Suna Bensch, Johanna Björklund +1

Semantic embeddings have advanced the state of the art for countless natural language processing tasks, and various extensions to multimodal domains, such as visual-semantic embedd…

cs.FL2019★ 18 cited

Formalization and Correctness of Predictive Shift-Reduce Parsers for Graph Grammars based on Hyperedge Replacement

Frank Drewes, Berthold Hoffmann, Mark Minas

Hyperedge replacement (HR) grammars can generate NP-complete graph languages, which makes parsing hard even for fixed HR languages. Therefore, we study predictive shift-reduce (PSR…