MétaCan
Menu
Back to cohort
Record W2377001998

Robust Character-Based Chinese Spoken Language Understanding with Domain Information

2010· article· en· W2377001998 on OpenAlexvenueno aff
Yonghong Yan

Bibliographic record

VenueMicrocomputer applications · 2010
Typearticle
Languageen
FieldComputer Science
TopicNatural Language Processing Techniques
Canadian institutionsnot available
Fundersnot available
KeywordsComputer scienceRobustness (evolution)ExploitNatural language processingArtificial intelligenceSpoken languageLanguage modelCharacter (mathematics)Test setSpeech recognitionWord (group theory)Domain (mathematical analysis)Set (abstract data type)Linguistics
DOInot available

Abstract

fetched live from OpenAlex

For spoken language understanding,robustness is one of the most challenging key issues. To achieve good robustness,two strategies were investigated. One is to adopt a shallow statistical understanding framework,in which the task of spoken language understanding is simplified into a (named) entity recognition. In this framework,character is chosen as the basic processing unit instead of word. The other is to efficiently exploit domain information through subword enriched features and enlarged training corpus under the statistical framework. Experimental results show that the proposed strategies improved the understanding performance in F1 from 75.27 to 90.24 for using speech recognition output as input and from 80.59 to 97.14 for using manual transcripts respectively on a human-computer dialogue test set.

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.001
metaresearch head score (Gemma)0.003
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: none
Teacher disagreement score0.003
Threshold uncertainty score0.007

Distilled classifier scores by category (both heads)

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

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.009
GPT teacher head0.230
Teacher spread0.221 · 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
Published2010
Admission routes1
Has abstractyes

Explore more

Same venueMicrocomputer applicationsSame topicNatural Language Processing TechniquesFrench-language works237,207