MétaCan
Menu
Back to cohort
Record W2086747158 · doi:10.1111/1467-9612.00057

Anaphoric R–Expressions as Bound Variables

2003· article· en· W2086747158 on OpenAlexaff
Felicia Lee

Bibliographic record

VenueSyntax · 2003
Typearticle
Languageen
FieldComputer Science
TopicNatural Language Processing Techniques
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsUpper and lower boundsLinguisticsMathematicsCrossoverCombinatoricsComputer sciencePhilosophyArtificial intelligence

Abstract

fetched live from OpenAlex

San Lucas Quiaviní Zapotec (SLQZ), an Otomanguean language of Mexico, regularly allows apparent condition B and C violations: R–expressions and pronouns can appear to be locally and nonlocally bound by identical arguments. For this reason, the Zapotec languages have been claimed to be among those in which condition C is not operational. This paper shows, however, that bound names in SLQZ do not constitute condition C violations. Rather, they are anaphoric variables spelled out as copies of their antecedents. Evidence for this proposal comes from the fact that bound copies are interpreted as bound variables in VP–deletion contexts and from the fact that strong crossover effects hold robustly in the language, showing that condition C is operational. This paper also shows that identical facts hold in Thai, another language thought to lack condition C.

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.001
metaresearch head score (Gemma)0.003
Version: metacan-v3-hybrid-931329e0061cValidation 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: Empirical
Teacher disagreement score0.005
Threshold uncertainty score0.015

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0000.001
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.002
Science and technology studies0.0020.004
Scholarly communication0.0040.007
Open science0.0010.003
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0040.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.009
GPT teacher head0.262
Teacher spread0.253 · 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 designTheoretical or conceptual
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

Citations100
Published2003
Admission routes1
Has abstractyes

Explore more

Same venueSyntaxSame topicNatural Language Processing TechniquesFrench-language works237,207