Bibliographic record
Abstract
The binding theory of transformational generative grammar refers to a selected class of phrase structure positions (argument and nonargument positions), a relation of relative prominence among them (c-command), a typology of the elements that enter into binding relations (anaphors, pronominals, referring expressions), and designated regions of phrase structure within which the binding relations hold for these elements. This chapter begins with a preliminary version of the binding theory which, although it is inadequate, illustrates certain essential concepts of a binding theory within the architecture of lexical-functional grammar (LFG). Notwithstanding the inadequacies of this theory, the exercise of reformulating it in the present framework is useful. For this binding theory it is assumed that there is an index attribute whose value determines coindexing relations. Despite its textbook status, the familiar binding theory is problematic. One reason for its inadequacy is typological.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.003 | 0.007 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.003 | 0.004 |
| Science and technology studies | 0.005 | 0.011 |
| Scholarly communication | 0.007 | 0.011 |
| Open science | 0.004 | 0.004 |
| Research integrity | 0.005 | 0.004 |
| Insufficient payload (model declined to judge) | 0.059 | 0.025 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".