MétaCan
Menu
Back to cohort
Record W2626206547 · doi:10.33011/lilt.v2i.1207

The Same Semantic Relations Link Structurally Different Realizations of Concepts

2009· article· en· W2626206547 on OpenAlex

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

VenueLinguistic Issues in Language Technology · 2009
Typearticle
Languageen
FieldComputer Science
TopicNatural Language Processing Techniques
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsLinguisticsComputer scienceExpression (computer science)Noun phraseUtteranceRealization (probability)Natural language processingRelation (database)PhraseNounArtificial intelligenceMathematics

Abstract

fetched live from OpenAlex

To make sense of an utterance, people identify in its linear linguistic expression the concepts and the connections between them. A concept normally has a lexical realization; connections between concepts often do not, but they are perceived even without the benefit of lexical cues. Making these connections – called semantic relations in the field of natural language processing – relies on the form and structure of linguistic expressions, and the concepts these expressions evoke. This implies two levels: the level of the text, the linguistic expression with its form and (grammatical) structure, and the level of the concepts which the speaker wants to convey. An overview of the literature shows that semantic relations are, for pragmatic reasons, a means to an end – extract information, explain the links between the head of a phrase and its arguments, and so on – and that is why they are analyzed from the perspective of what they link. At the text level, the process of semantic relation analysis is informed by syntactic elements – noun phrases, verbs and their arguments, clauses and so on – thus differentiating semantic relations based on the complexity of the syntactic constructions in which their arguments appear. At the conceptual level, the same semantic relation is assigned to pairs of concepts, regardless of their surface expression. The process can be said to disregard the implications of having syntactic constructions of various complexity correspond to the concepts linked. In this article, we propose to put semantic relations first: analyze them, determine what constraints they place on the concepts they connect, and how those concepts can be lexicalized. Lexicalization takes place via expressions of increasing syntactic complexity: phrases, clauses and multi-clause sentences. Next, we show how the linguistic phenomena involved in producing different lexicalizations explain – in a systematic manner – how semantic relations can have instances in syntactic constructions of various complexity. We focus on binary semantic relations between concepts/textual elements within sentences. This kind of analysis leads to a better understanding of the relations themselves and to a systematic account of phenomena related to their occurrence in texts. It reveals some of the assumptions and linguistic gaps people fill when they recognize relations in text. From the computational point of view of text processing, such a solid basis of the analysis of semantic relations adds consistency. Evidence for a particular relation can come from all its instances in a text, regardless of the syntactic form of the concepts it connects. Knowledge of the expected concepts and their syntactic realization may signal the presence of covert or implied information, which we can then work to retrieve. Assigning a semantic relation should be a conscious choice, with the understanding of what implications such a tag has both for the implicitly and explicitly expressed elements of a concept.

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.003
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.702
Threshold uncertainty score0.485

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.003
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
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.006
GPT teacher head0.309
Teacher spread0.303 · 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