MétaCan
Menu
Back to cohort
Record W2250951601 · doi:10.63317/2uw4887z6mj3

Building a reference lexicon for countability in English

2014· article· en· W2250951601 on OpenAlexaff
Tibor Kiss, Francis Jeffry Pelletier, Tobias Stadtfeld

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicNatural Language Processing Techniques
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsLexiconNounComputer scienceWordNetNatural language processingArtificial intelligenceSet (abstract data type)Countable setLinguisticsClass (philosophy)Proper nounNoun phraseAgreementMathematicsCombinatorics

Abstract

fetched live from OpenAlex

The present paper describes the construction of a resource to determine the lexical preference class of a large number of English nouns (≈ 14,000) with respect to the distinction between mass and count interpretations.In constructing the lexicon, we have employed a questionnaire-based approach based on existing resources such as the Open ANC (http://www.anc.org) and WordNet (Miller, 1995).The questionnaire requires annotators to answer six questions about a noun-sense pair.Depending on the answers, a given noun-sense pair can be assigned to fine-grained noun classes, spanning the area between count and mass.The reference lexicon contains almost 14,000 noun-sense pairs.An initial data set of 1,000 has been annotated together by four native speakers, while the remaining 12,800 noun-sense pairs have been annotated in parallel by two annotators each.We can confirm the general feasibility of the approach by reporting satisfactory values between 0.694 and 0.755 in inter-annotator agreement using Krippendorff's α.

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.002
metaresearch head score (Gemma)0.017
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.024
Threshold uncertainty score0.082

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.017
Meta-epidemiology (narrow)0.0020.002
Meta-epidemiology (broad)0.0020.002
Bibliometrics0.0140.009
Science and technology studies0.0030.001
Scholarly communication0.0060.017
Open science0.0030.004
Research integrity0.0020.003
Insufficient payload (model declined to judge)0.0240.014

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.020
GPT teacher head0.303
Teacher spread0.282 · 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

Citations9
Published2014
Admission routes1
Has abstractno

Explore more

Same topicNatural Language Processing TechniquesFrench-language works237,207