MétaCan
Menu
Back to cohort
Record W3037066510 · doi:10.1002/meet.2009.14504603102

Universal abstracting

2009· article· en· W3037066510 on OpenAlexaff
Andreas Strotmann

Bibliographic record

VenueProceedings of the American Society for Information Science and Technology · 2009
Typearticle
Languageen
FieldComputer Science
TopicNatural Language Processing Techniques
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsComputer scienceLingua francaLinguisticsMachine translationNatural language processingNatural languageUniversal Networking LanguageSemantics (computer science)Representation (politics)GrammarUniversal grammarArtificial intelligenceProgramming languageComprehension approachGenerative grammar

Abstract

fetched live from OpenAlex

Abstract Abstracts are brief summaries of the content of a work, and they have long been used to improve international accessibility and/or dissemination, e.g., in the form of English abstracts for articles published in non‐English languages. Universal abstracts are similar in that they summarize the meaning of a work, but the indexer creates them in a special lingua franca that makes them available in any language, not just, say, English. Universal abstracting is performed by an indexer using a piece of software that guides him or her in creating a language‐independent summary of the abstracted work. The abstract is written in a stylized form of the indexer's own language; internally, a knowledge representation that combines multilingual controlled vocabularies with a universal grammar based on the Montague Semantics for natural language is created. This form enables high‐quality automatic translation – the internal representation is universal and localizes to any language or mode of communication.

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.005
metaresearch head score (Gemma)0.025
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.095
Threshold uncertainty score0.318

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0050.025
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0050.004
Science and technology studies0.0020.002
Scholarly communication0.0070.009
Open science0.0030.008
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0950.044

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.007
GPT teacher head0.258
Teacher spread0.251 · 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 designNot applicable
Domainnot available
GenreMethods

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
Published2009
Admission routes1
Has abstractyes

Explore more

Same venueProceedings of the American Society for Information Science and TechnologySame topicNatural Language Processing TechniquesFrench-language works237,207