"False"
Umeå universitet
printicon
Huvudmenyn dold.

Anna Jonsson

Programansvarig för civilingenjörsprogrammet i teknisk datavetenskap.

Jag forskar om hur formella språk (såsom programmeringsspråk) kan användas för att modellera naturligt språk.

Kontakt

E-post
anna.jonsson01@umu.se
Telefon

Verksam vid

Anknytning
Universitetslektor vid Institutionen för datavetenskap
Plats
MIT-huset, Umeå universitet, MIT.C.433 Umeå universitet, 901 87 Umeå

Under min doktorandtid deltog jag i utvecklingen av regelbaserade formalismer med målet att representera semantik i naturligt språk, och även algoritmer som processerar närliggande typer av formalismer.

Läs min avhandling

Mina pronomen är hon/henne och hen/hen på svenska.

ACROCPoLis: a descriptive framework for making sense of fairness
FAccT '23: Proceedings of the 2023 ACM conference on fairness, accountability, and transparency, ACM Digital Library 2023 : 1014-1025
Aler Tubella, Andrea; Coelho Mollo, Dimitri; Dahlgren, Adam; et al.
Generating semantic graph corpora with graph expansion grammar
13th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2023), Open Publishing Association 2023 : 3-15
Andersson, Eric; Björklund, Johanna; Drewes, Frank; et al.
Generation and polynomial parsing of graph languages with non-structural reentrancies
Computational linguistics - Association for Computational Linguistics (Print), Association for Computational Linguistics 2023, Vol. 49, (4) : 841-882
Björklund, Johanna; Drewes, Frank; Jonsson, Anna
Improved N-Best Extraction with an Evaluation on Language Data
Computational linguistics - Association for Computational Linguistics (Print), MIT Press 2022, Vol. 48, (1) : 119-153
Björklund, Johanna; Drewes, Frank; Jonsson, Anna
Proceedings of Umeå's 25th Student Conference in Computing Science (USCCS 2022)
Report / UMINF, 22.01
Jiang, Lili; Jonsson, Anna; Vanhée, Loïs
Best Trees Extraction and Contextual Grammars for Language Processing
Report / UMINF, 21.04
Jonsson, Anna
A Comparison of Two N-Best Extraction Methods for Weighted Tree Automata
Implementation and Application of Automata: 23rd International Conference, CIAA 2018, Charlottetown, PE, Canada, July 30 – August 2, 2018, Proceedings, Springer 2018 : 197-108
Björklund, Johanna; Drewes, Frank; Jonsson, Anna
Towards semantic language processing
Report / UMINF, 18.12
Jonsson, Anna
Finding the N Best Vertices in an Infinite Weighted Hypergraph
Theoretical Computer Science, Elsevier 2017, Vol. 682 : 30-41
Björklund, Johanna; Drewes, Frank; Jonsson, Anna
Contextual Hyperedge Replacement Grammars for Abstract Meaning Representations
Proceedings of the 13th International Workshop on Tree Adjoining Grammars and Related Formalisms, Association for Computational Linguistics 2017 : 102-111
Drewes, Frank; Jonsson, Anna
On the N best problem for hypergraphs
Workshop on Trends in Tree Automata and Tree Transducers (TTATT 2016), Seoul, South Korea, July 18, 2016
Björklund, Johanna; Drewes, Frank; Jonsson, Anna
Faster Computation of N-Best Lists for Weighted Tree Automata
Björklund, Johanna; Drewes, Frank; Jonsson, Anna
A Comparative Evaluation of the Efficiency of N-Best Algorithms on Language Data
Björklund, Johanna; Drewes, Frank; Jonsson, Anna
Polynomial Graph Parsing with Non-Structural Reentrancies
Björklund, Johanna; Drewes, Frank; Jonsson, Anna
Visa publikationer i DiVA

Forskargrupper

Forskningsledare
Foundations of Language Processing