MétaCan
Menu
Back to cohort
Record W4293863311 · doi:10.1109/siu55565.2022.9864851

Automatic Keyword Extraction From Dialogue Text

2022· article· en· W4293863311 on OpenAlex
Yusuf Sali, Mustafa Erden

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

Venue2022 30th Signal Processing and Communications Applications Conference (SIU) · 2022
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Text Analysis Techniques
Canadian institutionsStantec (Canada)
Fundersnot available
KeywordsComputer scienceKeyword extractionDialog boxRecallWord (group theory)Natural language processingPrecision and recallInformation retrievalProcess (computing)Artificial intelligenceCustomer serviceService (business)World Wide WebLinguistics

Abstract

fetched live from OpenAlex

Keyword extraction is the automatic process of extracting keywords or keyphrases that are most relevant to a text using various algorithms. In this study, we have extracted keywords from customer service records of various companies. We reached %70 recall score by supporting tf-idf with textrank and positionrank algorithms. This corresponds to %10 relative improvement to tf-idf alone. This method is created to get accurate results especially from small-medium length and preferably dialogue texts. The system can be applied to different types of texts by optimizing its parameters. Our method also generates minimum three word phrases which is an easily understandable and a very short summary of the dialog, from the extracted keywords.

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 categoriesMeta-epidemiology (narrow), Science and technology studies
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.937
Threshold uncertainty score1.000

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.001
Science and technology studies0.0020.000
Scholarly communication0.0000.001
Open science0.0030.002
Research integrity0.0000.001
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.030
GPT teacher head0.303
Teacher spread0.273 · 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