Jan Šnajder

Jan Šnajder

Auto-generated profile, based on publicly available information

Jan Šnajder

Faculty of Electrical Engineering and Computing TakeLab University of Zagreb

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

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

Representative Publications

View All Publications
1 November 2014 in Expert Systems with Applications
Verified
Journal Article
Closed access
GGGoran Glavaš
Goran Glavaš
JŠJan Šnajder
Jan Šnajder

1 December 2018 in Expert Systems with Applications
Verified
Journal Article
Closed access
DKDamir Korenčić
Damir Korenčić
SRStrahil Ristov
Strahil Ristov
JŠJan Šnajder
Jan Šnajder

22 April 2022 in IEEE Access
Verified
Journal Article
Open access
MTMartin Tutek
Martin Tutek
JSJan Snajder
Jan Snajder
Natural language processing (NLP) has been one of the subfields of artificial intelligence much affected by the recent neural revolution. Architectures such as recurrent neural networks (RNNs) and attention-based transformers helped propel the state of the art across various NLP tasks, such as sequence classification, machine translation, and natural language inference. However, if neural models are to be used in high-stakes decision making scenarios, the explainability of their decisions becomes a paramount issue. The attention mechanism has offered some transparency in the workings of otherwise black-box RNN models: attention weights (scalar values assigned input words) invite to be interpreted as the importance of that word, providing a simple method of interpretability. Recent work, however, has questioned the faithfulness of this practice. Subsequent experiments have shown that faithfulness of attention weights may still be achieved by incorporating word-level objectives in the training process of neural networks. In this article, we present a study that extends the techniques for improving faithfulness of attention based on regularization methods that promote retention of word-level information. We perform extensive experiments on a wide array of recurrent neural architectures and analyze to what extent the explanations provided by inspecting attention weights are correlated with the human notion of importance. We find that incorporating tying regularization consistently improves both the faithfulness (−0.14 F1, +0.07 Brier, on average) and plausibility ( $+53.6\%$ attention mass on salient tokens) of explanations obtained through inspecting attention weights across analyzed datasets and models.

1 January 2016
Verified
Conference Paper
Open access
MTMartin Tutek
Martin Tutek
ISIvan Sekulic
Ivan Sekulic
PGPaula Gombar
Paula Gombar
IPIvan Paljak
Ivan Paljak
FCFilip Culinovic
Filip Culinovic
JŠJan Šnajder
Jan Šnajder

1 January 2021 in IEEE Access
Verified
Journal Article
Open access
DKDamir Korencic
Damir Korencic
SRStrahil Ristov
Strahil Ristov
JRJelena Repar
Jelena Repar
JSJan Snajder
Jan Snajder
Topic models are widely used unsupervised models capable of learning topics – weighted lists of words and documents – from large collections of text documents. When topic models are used for discovery of topics in text collections, a question that arises naturally is how well the model-induced topics correspond to topics of interest to the analyst. In this paper we revisit and extend a so far neglected approach to topic model evaluation based on measuring topic coverage – computationally matching model topics with a set of reference topics that models are expected to uncover. The approach is well suited for analyzing models’ performance in topic discovery and for large-scale analysis of both topic models and measures of model quality. We propose new measures of coverage and evaluate, in a series of experiments, different types of topic models on two distinct text domains for which interest for topic discovery exists. The experiments include evaluation of model quality, analysis of coverage of distinct topic categories, and the analysis of the relationship between coverage and other methods of topic model evaluation. The paper contributes a new supervised measure of coverage, and the first unsupervised measure of coverage. The supervised measure achieves topic matching accuracy close to human agreement. The unsupervised measure correlates highly with the supervised one (Spearman’s $\rho \geq 0.95$ ). Other contributions include insights into both topic models and different methods of model evaluation, and the datasets and code for facilitating future research on topic coverage.

1 May 2014 in Natural Language Engineering
Verified
Journal Article
Closed access
PDF file
GGGoran Glavaš
Goran Glavaš
JŠJan Šnajder
Jan Šnajder
Events play an important role in natural language processing and information retrieval due to numerous event-oriented texts and information needs. Many natural language processing and information retrieval applications could benefit from a structured event-oriented document representation. In this paper, we proposeevent graphsas a novel way of structuring event-based information from text. Nodes in event graphs represent the individual mentions of events, whereas edges represent the temporal and coreference relations between mentions. Contrary to previous natural language processing research, which has mainly focused on individual event extraction tasks, we describe a complete end-to-end system for event graph extraction from text. Our system is a three-stage pipeline that performs anchor extraction, argument extraction, and relation extraction (temporal relation extraction and event coreference resolution), each at a performance level comparable with the state of the art. We presentEvExtra, a large newspaper corpus annotated with event mentions and event graphs, on which we train and evaluate our models. To measure the overall quality of the constructed event graphs, we propose two metrics based on the tensor product between automatically and manually constructed graphs. Finally, we evaluate the overall quality of event graphs with the proposed evaluation metrics and perform a headroom analysis of the system.