| Contextual hyperedge replacement grammars for abstract meaning representations F Drewes, A Jonsson Proceedings of the 13th International Workshop on Tree Adjoining Grammars …, 2017 | 13 | 2017 |
| Generation of abstract meaning representations by hyperedge replacement grammars–a case study A Jonsson | 6 | 2016 |
| Generation and polynomial parsing of graph languages with non-structural reentrancies J Björklund, F Drewes, A Jonsson Computational Linguistics 49 (4), 841-882, 2023 | 5 | 2023 |
| ACROCPoLis: A Descriptive Framework for Making Sense of Fairness A Aler Tubella, D Coelho Mollo, A Dahlgren Lindström, H Devinney, ... Proceedings of the 2023 ACM Conference on Fairness, Accountability, and …, 2023 | 4 | 2023 |
| Polynomial Graph Parsing with Non-Structural Reentrancies J Björklund, F Drewes, A Jonsson arXiv preprint arXiv:2105.02033, 2021 | 3 | 2021 |
| Best Trees Extraction and Contextual Grammars for Language Processing A Jonsson Umeå universitet, 2021 | 3 | 2021 |
| A Comparison of Two N-Best Extraction Methods for Weighted Tree Automata J Björklund, F Drewes, A Jonsson Implementation and Application of Automata: 23rd International Conference …, 2018 | 2 | 2018 |
| Context-free graph grammars for recognition of abstract meaning representations A Jonsson Proceedings of Umeå’s 20th student conference in computing science: USCCS, 69-81, 2016 | 2 | 2016 |
| On the generation of abstract meaning representations using polynomialtime parsable hyperedge replacement grammars A Jonsson The Sixth Swedish Language Technology Conference, 2016 | 2 | 2016 |
| Generating semantic graph corpora with graph expansion grammar E Andersson, J Björklund, F Drewes, A Jonsson 13th International Workshop on Non-Classical Models of Automata and …, 2023 | 1 | 2023 |
| Improved N-Best Extraction with an Evaluation on Language Data J Björklund, F Drewes, A Jonsson Computational Linguistics 48, 119-153, 2022 | 1 | 2022 |
| ACROCPoLis: A Descriptive Framework for Making Sense of Fairness AA Tubella, DC Mollo, AD Lindström, H Devinney, V Dignum, P Ericson, ... arXiv preprint arXiv:2304.11217, 2023 | | 2023 |
| Grammatical Inference: Strengths and Weaknesses P Ericson, A JONSSON | | 2022 |
| Faster Computation of N-Best Lists for Weighted Tree Automata J Björklund, F Drewes, A Jonsson | | 2021 |
| A Comparative Evaluation of the Efficiency of N-Best Algorithms on Language Data J Björklund, F Drewes, A Jonsson | | 2021 |
| Towards semantic language processing A Jonsson Department of Computing Science, Umeå University, 2018 | | 2018 |
| Finding the N best vertices in an infinite weighted hypergraph J Björklund, F Drewes, A Jonsson Theoretical Computer Science 682, 30-41, 2017 | | 2017 |
| Contextual Hyperedge Replacement Grammars for the Generation of Abstract Meaning Representations A Jonsson | | 2017 |
| On the N-Best Problem for Hypergraphs J Björklund, F Drewes, A Jonsson TTATT 2016, 5, 2016 | | 2016 |
| N-Best Extraction for Weighted Tree Automata⋆ A Jonsson | | |
Frank DrewesDepartment of Computing Science, Umeå University在 cs.umu.se 的电子邮件经过验证
