default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnna Jonsson 0001
Person information
- affiliation (PhD 2021): Umea University, Department of Computing Science, Sweden
Other persons with the same name
- Anna Jonsson — disambiguation page
- Anna Jonsson 0002 — Stockholm University, Stockholm, Sweden (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j3]Johanna Björklund, Frank Drewes, Anna Jonsson
:
Generation and Polynomial Parsing of Graph Languages with Non-Structural Reentrancies. Comput. Linguistics 49(4): 841-882 (2023)- [c4]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:
ACROCPoLis: A Descriptive Framework for Making Sense of Fairness. FAccT 2023: 1014-1025 - [c3]Eric Andersson, Johanna Björklund, Frank Drewes, Anna Jonsson:
Generating Semantic Graph Corpora with Graph Expansion Grammar. NCMA 2023: 3-15 - [i2]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:
ACROCPoLis: A Descriptive Framework for Making Sense of Fairness. CoRR abs/2304.11217 (2023) - 2022
- [j2]Johanna Björklund, Frank Drewes, Anna Jonsson:
Improved N-Best Extraction with an Evaluation on Language Data. Comput. Linguistics 48(1): 119-153 (2022) - 2021
- [b1]Anna Jonsson:
Best Trees Extraction and Contextual Grammars for Language Processing. Umea University, Sweden, 2021 - [i1]Johanna Björklund, Frank Drewes, Anna Jonsson:
Polynomial Graph Parsing with Non-Structural Reentrancies. CoRR abs/2105.02033 (2021)
2010 – 2019
- 2018
- [c2]Johanna Björklund, Frank Drewes, Anna Jonsson:
A Comparison of Two N-Best Extraction Methods for Weighted Tree Automata. CIAA 2018: 97-108 - 2017
- [j1]Johanna Björklund, Frank Drewes, Anna Jonsson:
Finding the N best vertices in an infinite weighted hypergraph. Theor. Comput. Sci. 682: 30-41 (2017) - [c1]Frank Drewes, Anna Jonsson:
Contextual Hyperedge Replacement Grammars for Abstract Meaning Representations. TAG 2017: 102-111
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-18 20:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
