MétaCan
Menu
Back to cohort
Record W2461453537 · doi:10.52034/lanstts.v3i.107

Building specialized dictionaries using lexical functions

2021· article· en· W2461453537 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

VenueLinguistica Antverpiensia New Series – Themes in Translation Studies · 2021
Typearticle
Languageen
FieldArts and Humanities
Topiclinguistics and terminology studies
Canadian institutionsUniversité de Montréal
Fundersnot available
KeywordsComputer scienceVariety (cybernetics)Lexical itemLinguisticsNatural language processingTerm (time)Artificial intelligencePhilosophy

Abstract

fetched live from OpenAlex

It is now widely acknowledged that terms enter into a variety of structures and that classic taxonomies and meronymies represent only a small part of the relationships terms share. This can be seen in recent specialized dictionaries that account for derivational relationships, co-occurrents, synonyms, antonyms, etc. It also has been underlined in several articles written by terminologists as well as linguists or computational scientists working with specialized corpora. This article will discuss the advanta ges and shortcomings of trying to account for semantic relations between terms using a specific framework, i.e. lexical functions (Mel’cuk et al. 1984-1999, 1995). It is based on a long-term project aimed at converting an existing paper dictionary (Dancette & Réthoré 2000) into a relational database. We will show that even if lexical functions have several advantages, a number of decisions must be made to accommodate the description of specialized terms.

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.002
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.871
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0010.001
Scholarly communication0.0000.000
Open science0.0000.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.162
GPT teacher head0.346
Teacher spread0.184 · 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