MétaCan
Menu
Back to cohort
Record W2945699119 · doi:10.1109/infoteh.2019.8717655

Automatic Text Summarization of News Articles in Serbian Language

2019· article· en· W2945699119 on OpenAlex
Dijana Kosmajac, Vlado Kešelj

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicTopic Modeling
Canadian institutionsDalhousie University
Fundersnot available
KeywordsAutomatic summarizationComputer scienceText graphMulti-document summarizationInformation retrievalNatural language processingReading (process)GraphProcess (computing)SerbianArtificial intelligenceWorld Wide WebLinguistics

Abstract

fetched live from OpenAlex

Text Summarization is a technique of creating short, accurate, and fluent summaries of longer text documents or sets of documents. With growing amount of textual data circulating in the digital space, there is a need to develop machine learning algorithms that can automatically shorten longer texts and deliver accurate summaries. First, the generated summaries should fluently pass the intended messages. Second, the generated summaries should reduce reading time and speed up the process of researching for relevant information. By large majority, most of research in text summarization has been done for English texts. In this paper, we experiment with a variation on a graph-based method called TextRank for extractive text summarization. The dataset used in this study is collected from one of the online news sources in Bosnia and Herzegovina.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.971
Threshold uncertainty score0.129

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.010
GPT teacher head0.231
Teacher spread0.220 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations12
Published2019
Admission routes1
Has abstractyes

Explore more

Same topicTopic ModelingFrench-language works237,207