Contextual Hyperedge Replacement Grammars for Abstract Meaning Representations. - Frank Drewes; Anna Jonsson 001 (TAG, 2017)

Finding the N best vertices in an infinite weighted hypergraph. - Johanna Björklund; Frank Drewes; Anna Jonsson 001 (Theor. Comput. Sci., 2017)

A Comparison of Two N-Best Extraction Methods for Weighted Tree Automata. - Johanna Björklund; Frank Drewes; Anna Jonsson 001 (CIAA, 2018)

Polynomial Graph Parsing with Non-Structural Reentrancies. - Johanna Björklund; Frank Drewes; Anna Jonsson 001 (CoRR, 2021)

Best Trees Extraction and Contextual Grammars for Language Processing. - Anna Jonsson 001 (2021)

Improved N-Best Extraction with an Evaluation on Language Data. - Johanna Björklund; Frank Drewes; Anna Jonsson 001 (Comput. Linguistics, 2022)

ACROCPoLis: A Descriptive Framework for Making Sense of Fairness. - Andrea Aler Tubella; Dimitri Coelho Mollo; Adam Dahlgren Lindström; Hannah Devinney; Virginia Dignum; Petter Ericson; Anna Jonsson 001; Timotheus Kampik; Tom Lenaerts; Julian Alfredo Mendez; Juan Carlos Nieves (FAccT, 2023)

Generation and Polynomial Parsing of Graph Languages with Non-Structural Reentrancies. - Johanna Björklund; Frank Drewes; Anna Jonsson 001 (Comput. Linguistics, 2023)

Generating Semantic Graph Corpora with Graph Expansion Grammar. - Eric Andersson; Johanna Björklund; Frank Drewes; Anna Jonsson 001 (NCMA, 2023)