MétaCan
Menu
Back to cohort
Record W2027974960 · doi:10.3138/infor.48.1.001

An Application of Operational Research to Computational Linguistics: Word Ambiguity

2010· article· en· W2027974960 on OpenAlexafffundvenue
Kevin Durda, Richard J. Caron, Lori Buchanan

Bibliographic record

VenueINFOR Information Systems and Operational Research · 2010
Typearticle
Languageen
FieldComputer Science
TopicTopic Modeling
Canadian institutionsUniversity of Windsor
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsPolysemyAmbiguityComputer scienceNatural language processingWord (group theory)Cluster analysisArtificial intelligenceMeasure (data warehouse)Word AssociationWord lists by frequencyPrinciple of maximum entropyLinguisticsSentenceData mining

Abstract

fetched live from OpenAlex

This paper draws on graph theory and optimization techniques to develop a new measure of word ambiguity (e.g., homonymy and polysemy) for use in psycholinguistic research. This measure provides information regarding the uncertainty of the intended meaning of English words. Specifically, data about fifty thousand distinct words was collected from a corpus of close to six hundred million words. These data are used to generate information about word association which forms a basis for the creation of semantic graphs from which clusters are created and analyzed. The clusters identify groups of words related to the different meanings of a word and are used to calculate a set of relative probabilities for the meanings. These are in turn used to calculate the information entropy for the word, which acts as a surrogate measure of ambiguity. A genetic algorithm is used to optimally determine parameters for our formula for word association and for the graph clustering algorithm. The effectiveness of this application is demonstrated with examples from psycholinguistic research.

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.010
metaresearch head score (Gemma)0.070
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.010
Threshold uncertainty score0.051

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0100.070
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.002
Bibliometrics0.0070.008
Science and technology studies0.0020.012
Scholarly communication0.0040.010
Open science0.0020.005
Research integrity0.0020.004
Insufficient payload (model declined to judge)0.0030.001

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.087
GPT teacher head0.415
Teacher spread0.329 · 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

Citations3
Published2010
Admission routes3
Has abstractyes

Explore more

Same venueINFOR Information Systems and Operational ResearchSame topicTopic ModelingFrench-language works237,207