Henrik Björklund

Jag arbetar med forskning om skadliga beteenden hos modeller för naturliga språk, som till exempel ChatGPT, samt med grundforskning om formella språk.

Vetenskaplig meritering: Docent

Kontakt

henrik.bjorklund@umu.se

090-786 97 89

Verksam vid

Universitetslektor vid Institutionen för datavetenskap

MIT-huset, Umeå universitet, MIT.C.440 Umeå universitet, 901 87 Umeå

Parsing unranked tree languages, folded once

Fundamentals of computation theory: 24th International Symposium, FCT 2023, Trier, Germany, September 18–21, 2023, Proceedings, Springer Nature 2023 : 60-73

Berglund, Martin; Björklund, Henrik; Björklund, Johanna

Transduction from trees to graphs through folding

Information and Computation, Elsevier 2023, Vol. 295

Berglund, Martin; Björklund, Henrik; Björklund, Johanna; et al.

Tree-based generation of restricted graph languages

International Journal of Foundations of Computer Science

Björklund, Henrik; Björklund, Johanna; Ericson, Petter

Computer, enhence: POS-tagging improvements for nonbinary pronoun use in Swedish

Proceedings of the third workshop on language technology for equality, diversity, inclusion, The Association for Computational Linguistics 2023 : 54-61

Björklund, Henrik; Devinney, Hannah

Improving Swedish part-of-speech tagging for hen

Swedish Language Technology Conference 2022, Stockholm, Sweden, November 23-25, 2022

Björklund, Henrik; Devinney, Hannah

Theories of Gender in Natural Language Processing

Proceedings of the fifth annual ACM Conference on Fairness, Accountability, and Transparency (ACM FAccT'22)

Devinney, Hannah; Björklund, Jenny; Björklund, Henrik

Uniform Parsing for Hyperedge Replacement Grammars

Journal of computer and system sciences (Print), Elsevier 2021, Vol. 118 : 1-27

Björklund, Henrik; Drewes, Frank; Ericson, Petter; et al.

Semi-Supervised Topic Modeling for Gender Bias Discovery in English and Swedish

Proceedings of the Second Workshop on Gender Bias in Natural Language Processing, Association for Computational Linguistics 2020 : 79-92

Devinney, Hannah; Björklund, Jenny; Björklund, Henrik

Crime and Relationship: Exploring Gender Bias in NLP Corpora

SLTC 2020 – The Eighth Swedish Language Technology Conference, 25–27 November 2020, Online

Devinney, Hannah; Björklund, Jenny; Björklund, Henrik

Parsing Weighted Order-Preserving Hyperedge Replacement Grammars

Proceedings of the 16th Meeting on the Mathematics of Language, Association for Computational Linguistics 2019 : 1-11

Björklund, Henrik; Drewes, Frank; Ericson, Petter

Minimisation and Characterisation of Order-Preserving DAG Grammars

Report / UMINF, 18.15

Björklund, Henrik; Björklund, Johanna; Ericson, Petter

Parsing Weighted Order-Preserving Hyperedge Replacement Grammars

Report / UMINF, 18.16

Björklund, Henrik; Drewes, Frank; Ericson, Petter

Uniform Parsing for Hyperedge Replacement Grammars

Report / UMINF, 18.13

Björklund, Henrik; Drewes, Frank; Ericson, Petter; et al.

Conjunctive query containment over trees using schema information

Acta Informatica, SPRINGER 2018, Vol. 55, (1) : 17-56

Björklund, Henrik; Martens, Wim; Schwentick, Thomas

Single-Rooted DAGs in Regular DAG Languages: Parikh Image and Path Languages

Proceedings of the 13th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+13), Association for Computational Linguistics 2017 : 94-101

Berglund, Martin; Björklund, Henrik; Drewes, Frank

On the Regularity and Learnability of Ordered DAG Languages

Implementation and Application of Automata: 22nd International Conference, CIAA 2017, Marne-la-Vallée, France, June 27-30, 2017, Proceedings, Cham: 2017 : 27-39

Björklund, Henrik; Björklund, Johanna; Ericson, Petter

Predicting User Competence from Linguistic Data

Proceedings of the 14th International Conference on Natural Language Processing (ICON-2017), Jadavpur University 2017 : 476-484

Woldemariam, Yonas Demeke; Bensch, Suna; Björklund, Henrik

Uniform vs. Nonuniform Membership for Mildly Context-Sensitive Languages: A Brief Survey

Algorithms, MDPI 2016, Vol. 9, (2)

Björklund, Henrik; Berglund, Martin; Petter, Ericson

Implementing a speech-to-text pipeline on the MICO platform

Report / UMINF, 16.07

Björklund, Henrik; Björklund, Johanna; Dahlgren, Adam; et al.

Between a Rock and a Hard Place: Parsing for Hyperege Replacement DAG Grammars

Proc. 10th International Conference on Language and Automata Theory and Applications (LATA 2016), Springer Publishing Company 2016 : 521-532

Björklund, Henrik; Drewes, Frank; Ericson, Petter

Class-memory automata revisited

Claudio Moraga: a passion for multi-valued logic and soft computing, Springer 2016 : 201-215

Björklund, Henrik; Schwentick, Thomas

Efficient incremental evaluation of succinct regular expressions

Proceedings of the 24th ACM International on Conference on Information and Knowledge Management, Association for Computing Machinery (ACM) 2015 : 1541-1550

Björklund, Henrik; Martens, Wim; Timm, Thomas

Characterizing Non-Regularity

Report / UMINF, 14.12

Berglund, Martin

Compression of finite-state automata through failure transitions

Theoretical Computer Science, Elsevier 2014, Vol. 557 : 87-100

Björklund, Henrik; Björklund, Johanna; Zechner, Niklas

Shuffled languages: representation and recognition

Theoretical Computer Science, Elsevier 2013, Vol. 489-490 : 1-20

Berglund, Martin; Björklund, Henrik; Björklund, Johanna

On the Parameterized Complexity of Linear Context-Free Rewriting Systems

Proceedings of the 13th Meeting on the Mathematics of Language (MoL 13), Association for Computational Linguistics 2013 : 21-29

Berglund, Martin; Björklund, Henrik; Drewes, Frank

Cuts in Regular Expressions

Developments in Language Theory: 17th International Conference, DLT 2013, Marne-la-Vallée, France, June 18-21, 2013. Proceedings, Springer Berlin/Heidelberg 2013 : 70-81

Berglund, Martin; Björklund, Henrik; Drewes, Frank; et al.

A note on the complexity of deterministic tree-walking transducers

Non-Classical Models of Automata and Applications (NCMA 2013)

Björklund, Henrik; Ericson, Petter

Validity of Tree Pattern Queries with Respect to Schema Information

Mathematical Foundations of Computer Science 2013: 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings, Springer: Springer Berlin/Heidelberg 2013 : 171-182

Björklund, Henrik; Martens, Wim; Schwentick, Thomas

On optimum left-to-right strategies for active context-free games

ICDT '13 Proceedings of the 16th International Conference on Database Theory, ACM Press 2013 : 105-116

Björklund, Henrik; Schuster, Martin; Schwentick, Thomas; et al.

The tractability frontier for NFA minimization

Journal of computer and system sciences (Print), Elsevier 2012, Vol. 78, (1) : 198-210

Björklund, Henrik; Martens, Wim

Recognizing Shuffled Languages

Report / UMINF, 11.01

Berglund, Martin; Björklund, Henrik; Högberg, Johanna

Recognizing shuffled languages

Language and Automata Theory and Applications: 5th International Conference, LATA 2011, Tarragona, Spain, May 26-31, 2011. Proceedings, Springer Berlin/Heidelberg 2011 : 142-154

Berglund, Martin; Björklund, Henrik; Högberg, Johanna

Conjunctive query containment over trees

Journal of computer and system sciences (Print), Vol. 77, (3) : 450-472

Björklund, Henrik; Martens, Wim; Schwentick, Thomas

Algorithmic properties of Millstream systems

Developments in Language Theory: 14th International Conference, DLT 2010, Springer Berlin/Heidelberg 2010 : 54-65

Bensch, Suna; Björklund, Henrik; Drewes, Frank

Incremental XPath evaluation

ACM Transactions on Database Systems, Vol. 35, (4:29) : 42-

Björklund, Henrik; Gelade, Wouter; Martens, Wim

Logik und Automaten : Ein echtes Dreamteam: [Logic and automatons : A real dream team]

Informatik-Spektrum, Springer 2010, Vol. 33, (5) : 452-461