| 1. |
- Borin, Lars, 1957, et al.
(författare)
-
Swedish FrameNet++ – lexical samsara
- 2021
-
Ingår i: The Swedish FrameNet++: Harmonization, integration, method development and practical language technology applications / editor(s): Dana Dannélls, Lars Borin and Karin Friberg Heppin. - Amsterdam : John Benjamins. - 1567-8202. - 9789027209900 ; , s. 69-95
-
Bokkapitel (refereegranskat)
|
|
| 2. |
- Forsgren, Emma, 1982, et al.
(författare)
-
The use of text-mining software to facilitate screening of literature on centredness in health care.
- 2023
-
Ingår i: Systematic Reviews. - 2046-4053. ; 12:1
-
Tidskriftsartikel (refereegranskat)abstract
- Research evidence supporting the implementation of centredness in health care is not easily accessible due to the sheer amount of literature available and the diversity in terminology and conceptualisations used. The use of text-mining functions to semi-automate the process of screening and collating citations for a review is a way of tackling the vast amount of research citations available today. There are several programmes that use text-mining functions to facilitate screening and data extraction for systematic reviews. However, the suitability of these programmes for reviews on broad topics of research, as well as the general uptake by researchers, is unclear. This commentary has a dual aim, which consists in outlining the challenges of screening literature in fields characterised by vague and overlapping conceptualisations, and to exemplify this by exploratory use of text-mining in the context of a scoping review on centredness in health care.
|
|
| 3. |
- Ingvarsson, Jonas, 1966, et al.
(författare)
-
The New Order of Criticism. Explorations of Book Reviews Between the Interpretative and Algorithmic
- 2022
-
Ingår i: CEUR Workshop Proceedings. - Aachen : CEUR-WS. ; , s. 228-234
-
Konferensbidrag (refereegranskat)abstract
- The New Order of Criticism (2020-2024) is a mixed-methods project combining algorithmic and interpretative approaches to the study of literary criticism. The project expands on a prior study of Swedish book reviews from the years 1906, 1956 and 2006 ('The Order of Criticism', Samuelsson 2013), re-examining and re-evaluating the original results through the use of computational tools, language technology and big data. The aim of the present paper is to discuss early experiences and results from the interdisciplinary approach utilized by the current project, a collaborative process where interpreter and programmer are in dialogue, and where methodologies, and their instantiation in tools, are reflexively discussed from an epistemological point of view. In our analysis we ask: How can insights from working with digital methodologies and tools inform traditional scholarship on literary criticism? How can interpretative approaches and results inform digital methods?.
|
|
| 4. |
|
|
| 5. |
- Ljunglöf, Peter, 1971, et al.
(författare)
-
Assessing the quality of Språkbanken’s annotations
- 2019
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- Most of the corpora in Språkbanken Text consist of unannotated plain text, such as almost all newspaper texts, social media texts, novels and official documents. We also have some corpora that are manually annotated in different ways, such as Talbanken (annotated for part-of-speech and syntactic structure), and the Stockholm Umeå Corpus (annotated for part-of-speech). Språkbanken’s annotation pipeline Sparv aims to automatise the work of automatically annotating all our corpora, while still keeping the manual annotations intact. When all corpora are annotated, they can be made available, e.g., in the corpus searh tools Korp and Strix. Until now there has not been any comprehensive overview of the annotation tools and models that Sparv has been using for the last eight years. Some of them have not been updated since the start, such as the part-of-speech tagger Hunpos and the dependency parser MaltParser. There are also annotation tools that we still have not included, such as a constituency-based parser. Therefore Språkbanken initiated a project with the aim of conducting such an overview. This document is the outcome of that project, and it contains descriptions of the types of manual and automatic annotations that we currently have in Språkbanken, as well as an incomplete overview of the state-of-the-art with regards to annotation tools and models.
|
|
| 6. |
- Zechner, Niklas, 1984-
(författare)
-
A novel approach to text classification
- 2017
-
Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
- This thesis explores the foundations of text classification, using both empirical and deductive methods, with a focus on author identification and syntactic methods. We strive for a thorough theoretical understanding of what affects the effectiveness of classification in general. To begin with, we systematically investigate the effects of some parameters on the accuracy of author identification. How is the accuracy affected by the number of candidate authors, and the amount of data per candidate? Are there differences in how methods react to the changes in parameters? Using the same techniques, we see indications that methods previously thought to be topic-independent might not be so, but that syntactic methods may be the best option for avoiding topic dependence. This means that previous studies may have overestimated the power of lexical methods. We also briefly look for ways of spotting which particular features might be the most effective for classification. Apart from author identification, we apply similar methods to identifying properties of the author, including age and gender, and attempt to estimate the number of distinct authors in a text sample. In all cases, the techniques are proven viable if not overwhelmingly accurate, and we see that lexical and syntactic methods give very similar results. In the final parts, we see some results of automata theory that can be of use for syntactic analysis and classification. First, we generalise a known algorithm for finding a list of the best-ranked strings according to a weighted automaton, to doing the same with trees and a tree automaton. This result can be of use for speeding up parsing, which often runs in several steps, where each step needs several trees from the previous as input. Second, we use a compressed version of deterministic finite automata, known as failure automata, and prove that finding the optimal compression is NP-complete, but that there are efficient algorithms for finding good approximations. Third, we find and prove the derivatives of regular expressions with cuts. Derivatives are an operation on expressions to calculate the remaining expression after reading a given symbol, and cuts are an extension to regular expressions found in many programming languages. Together, these findings may be able to improve on the syntactic analysis which we have seen is a valuable tool for text classification.
|
|
| 7. |
- Zechner, Niklas, 1984
(författare)
-
Cross-Topic Author Identification – a Case Study on Swedish Literature
- 2021
-
Ingår i: The Eighth Swedish Language Technology Conference (SLTC-2020), Selected Contributions, 25–27 November 2020, Gothenburg, Sweden, Online. - Linköping : Linköping University Electronic Press. - 1650-3686 .- 1650-3740. - 9789179296148
-
Konferensbidrag (refereegranskat)abstract
- Using material from the Swedish Literature Bank, we investigate whether common methods of author identification using word frequencies and part of speech frequencies are sensitive to differences in topic. The results show that this is the case, thereby casting doubt on much previous work in author identification. This sets the stage for a broader future study, comparing other methods and generalising the results.
|
|
| 8. |
- Zechner, Niklas, 1984-
(författare)
-
Derivatives of regular expressions with cuts
- 2017
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- Derivatives of regular expressions are an operation which for a given expression produces an expression for what remains after a specific symbol has been read. This can be used as a step in transforming an expression into a finite string automaton. Cuts are an extension of the ordinary regular expressions; the cut operator is essentially a concatenation without backtracking, formalising a behaviour found in many programming languages. Just as for concatenation, we can also define an iterated cut operator. We show and derive expressions for the derivatives of regular expressions with cuts and iterated cuts.
|
|
| 9. |
- Zechner, Niklas, 1984
(författare)
-
Derivatives of regular expressions with cuts
- 2020
-
Ingår i: Journal of Automata, Languages and Combinatorics. - 1430-189X. ; 25:4, s. 349-355
-
Tidskriftsartikel (refereegranskat)abstract
- Derivatives of regular expressions are an operation which for a given expression pro-duces an expression for what remains after a specific symbol has been read. This can be used as a step in the process of transforming an expression into a finite string au-tomaton. Cuts are an extension of the ordinary regular expressions; the cut operator is essentially a concatenation without backtracking, formalising a behaviour found in many programming languages. Just as for concatenation, we can also define an iterated cut operator. We show and derive expressions for the derivatives of regular expressions with cuts and iterated cuts. © Institut für Informatik · Justus-Liebig-Universität Giessen.
|
|
| 10. |
- Zechner, Niklas, 1984
(författare)
-
The other SAT-Solver: Applying lexicons to SweSAT word questions
- 2022
-
Ingår i: Live and Learn – Festschrift in honor of Lars Borin / editors: Elena Volodina, Dana Dannélls, Aleksandrs Berdicevskis, Markus Forsberg, Shafqat Virk. - Göteborg : Institutionen för svenska, flerspråkighet och språkteknologi, Göteborgs universitet. - 1401-5919. - 9789187850837 ; , s. 167-169
-
Bokkapitel (övrigt vetenskapligt/konstnärligt)
|
|
