MétaCan
Menu
← Back to cohort
Record W2583154464

Semantic Property Grammars for Knowledge Extraction from Biomedical Text

2009· article· en· W2583154464 on OpenAlexaff
Verónica Dahl, Baohua Gu

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldArts and Humanities
TopicHermeneutics and Narrative Identity
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsComputer scienceRule-based machine translationNatural language processingParsingProperty (philosophy)Artificial intelligenceL-attributed grammarConstraint (computer-aided design)Information extractionRelationship extractionContext-free grammarRelation (database)Semantics (computer science)Programming languageData miningMathematics
DOInot available

Abstract

fetched live from OpenAlex

Abstract. We present Semantic Property Grammars, designed to extract concepts and relations from biomedical texts. The implementation adapts a CHRG parser we designed for Property Grammars [1], which views linguistic constraints as properties between sets of categories and solves them by constraint satisfaction, can handle incomplete or erroneous text, and extract phrases of interest selectively. We endow it with concept and relation extraction abilities as well. 1 Semantic Property Grammars (SPGs)- an introduction Property Grammars (PGs) [2] linguistically characterize sentences not in terms of an explicit, complete parse tree but in terms of seven simple properties between pairs of constituents, for instance, linearity (e.g., a determiner must precede a noun) or unicity (e.g., a noun can only have one determiner). A directly executable specification of PGs was developed by Dahl and Blache [3], which uses CHRG [4] to combine pairs of constituents according to whether properties between them are satisfied. SPGs are based on an adaptation of

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.004
metaresearch head score (Gemma)0.010
Version: metacan-v3-hybrid-931329e0061cValidation 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: none
Teacher disagreement score0.006
Threshold uncertainty score0.020

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.010
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0020.002
Science and technology studies0.0010.003
Scholarly communication0.0020.003
Open science0.0020.002
Research integrity0.0010.002
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.050
GPT teacher head0.285
Teacher spread0.236 · 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 designSimulation or modeling
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
Published2009
Admission routes1
Has abstractyes

Explore more

Same topicHermeneutics and Narrative Identity→French-language works237,207→