MétaCan
Menu
← Back to cohort
Record W4327928015 · doi:10.1109/icsc56153.2023.00025

Automatic Identification of Chinese Paired Discourse Connectives

2023· article· en· W4327928015 on OpenAlexafffund
Nelson Filipe Costa, Yushun Cheng, Thomas Chapados Muermans, Blaise Hanel, Leila Kosseim

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicNatural Language Processing Techniques
Canadian institutionsConcordia University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsTreebankNatural language processingComputer scienceArtificial intelligenceIdentification (biology)SIGNAL (programming language)Simple (philosophy)Relation (database)Speech recognitionAnnotationProgramming language

Abstract

fetched live from OpenAlex

This paper describes our approach to automatically identify paired Discourse Connectives (DCs) in Chinese texts. Discourse Connectives (DCs) are terms that connect two text spans and signal the discourse relations between them. Most DCs consist of a consecutive words (eg. as a result); however paired DCs are composed of non-consecutive words that together signal the discourse relation (eg. on one hand … on the other hand). Although paired DCs are not common in English, they are very frequent in Chinese. The contribution of this paper in two-fold: First, we propose a methodology for the automatic identification of Chinese paired DCs. Second, we present a new corpus based on the Chinese Discourse Treebank (CDTB) [1] annotated with paired DCs. To identify paired DCs, we experimented with two main approaches: hypothesis testing and supervised machine learning. Although the hypothesis testing approaches led to lower than expected results, the simple machine learning models achieved F-scores between 72.5%–75.6% with no fine-tuning.

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.005
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.007
Threshold uncertainty score0.019

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.005
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0060.002
Science and technology studies0.0010.001
Scholarly communication0.0010.002
Open science0.0010.002
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0060.002

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.012
GPT teacher head0.314
Teacher spread0.302 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designBench or experimental
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2023
Admission routes2
Has abstractyes

Explore more

Same topicNatural Language Processing Techniques→French-language works237,207→