Johanna Björklund

Dr. Johanna Björklund

orcid

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 April 2024 in Journal of Current Issues & Research in Advertising
Verified
Journal Article
Open access
EHE. Häglund
E. Häglund
JBJohanna Björklund
Johanna Björklund

23 November 2024 in Minds and Machines
Verified
Journal Article
Open access
PDF file
IRIgor Ryazanov
Igor Ryazanov
CÖCarl Öhman
Carl Öhman
JBJohanna Björklund
Johanna Björklund
We perform a mixed-method frame semantics-based analysis on a dataset of more than 49,000 sentences collected from 5846 news articles that mention AI. The dataset covers the twelve-month period centred around the launch of OpenAI’s chatbot ChatGPT and is collected from the most visited open-access English-language news publishers. Our findings indicate that during the six months succeeding the launch, media attention rose tenfold—from already historically high levels. During this period, discourse has become increasingly centred around experts and political leaders, and AI has become more closely associated with dangers and risks. A deeper review of the data also suggests a qualitative shift in the types of threat AI is thought to represent, as well as the anthropomorphic qualities ascribed to it.

6 January 2020 in Acta Informatica
Verified
Journal Article
Open access
PDF file
JBJohanna Björklund
Johanna Björklund
LCLoek Cleophas
Loek Cleophas
We present a minimization algorithm for non-deterministic finite state automata that finds and merges bisimulation-equivalent states. The bisimulation relation is computed through partition aggregation, in contrast to existing algorithms that use partition refinement. The algorithm simultaneously generalises and simplifies an earlier one by Watson and Daciuk for deterministic devices. We show the algorithm to be correct and run in time $$ O \left( n^2 r^2 \left| \varSigma \right| \right) $$ O n 2 r 2 Σ , where n is the number of states of the input automaton $$M$$ M , r is the maximal out-degree in the transition graph for any combination of state and input symbol, and $$\left| \varSigma \right| $$ Σ is the size of the input alphabet. The algorithm has a higher time complexity than derivatives of Hopcroft’s partition-refinement algorithm, but represents a promising new solution approach that preserves language equivalence throughout the computation process. Furthermore, since the algorithm essentially computes the maximal model of a logical formula derived from $$M$$ M , optimisation techniques from the field of model checking become applicable.

1 June 2013 in Theoretical Computer Science
Verified
Journal Article
Closed access
MBMartin Berglund
Martin Berglund
HBHenrik Björklund
Henrik Björklund
JBJohanna Björklund
Johanna Björklund

1 May 2017 in Natural Language Engineering
Verified
Journal Article
Closed access
PDF file
JBJohanna Björklund
Johanna Björklund
NZNiklas Zechner
Niklas Zechner
The efficacy of syntactic features for topic-independent authorship attribution is evaluated, taking a feature set of frequencies of words and punctuation marks as baseline. The features are ‘deep’ in the sense that they are derived by parsing the subject texts, in contrast to ‘shallow’ syntactic features for which a part-of-speech analysis is enough. The experiments are made on two corpora of online texts and one corpus of novels written around the year 1900. The classification tasks include classical closed-world authorship attribution, identification of separate texts among the works of one author, and cross-topic authorship attribution. In the first tasks, the feature sets were fairly evenly matched, but for the last task, the syntax-based feature set outperformed the baseline feature set. These results suggest that, compared to lexical features, syntactic features are more robust to changes in topic.

24 November 2023 in International Journal of Foundations of Computer Science
Verified
Journal Article
Closed access
HBHenrik Björklund
Henrik Björklund
JBJohanna Björklund
Johanna Björklund
PEPetter Ericson
Petter Ericson