Anna Jonsson

According to our database, Anna Jonsson authored at least 9 papers between 2017 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

Generating Semantic Graph Corpora with Graph Expansion Grammar.

Eric Andersson, Johanna Björklund, Frank Drewes, Anna Jonsson

Proceedings of the 13th International Workshop on Non-Classical Models of Automata and Applications, 2023

Generation and Polynomial Parsing of Graph Languages with Non-Structural Reentrancies.

Johanna Björklund, Frank Drewes, Anna Jonsson

Comput. Linguistics, 2023

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, Timotheus Kampik, Tom Lenaerts, Julian Alfredo Mendez, Juan Carlos Nieves

Proceedings of the 2023 ACM Conference on Fairness, Accountability, and Transparency, 2023

2022

Improved N-Best Extraction with an Evaluation on Language Data.

Johanna Björklund, Frank Drewes, Anna Jonsson

Comput. Linguistics, 2022

2021

Best Trees Extraction and Contextual Grammars for Language Processing.

Anna Jonsson

PhD thesis, 2021

Polynomial Graph Parsing with Non-Structural Reentrancies.

Johanna Björklund, Frank Drewes, Anna Jonsson

CoRR, 2021

2018

A Comparison of Two N-Best Extraction Methods for Weighted Tree Automata.

Johanna Björklund, Frank Drewes, Anna Jonsson

Proceedings of the Implementation and Application of Automata, 2018

2017

Finding the N best vertices in an infinite weighted hypergraph.

Johanna Björklund, Frank Drewes, Anna Jonsson

Theor. Comput. Sci., 2017

Contextual Hyperedge Replacement Grammars for Abstract Meaning Representations.

Frank Drewes, Anna Jonsson

Proceedings of the 13th International Workshop on Tree Adjoining Grammars and Related Formalisms, 2017