MétaCan
Menu
Back to cohort
Record W4380684859 · doi:10.1111/synt.12256

Agree and the subjects of specificational clauses

2023· article· en· W4380684859 on OpenAlexafffund
Susana Béjar, Arsalan Kahnemuyipour

Bibliographic record

VenueSyntax · 2023
Typearticle
Languageen
FieldArts and Humanities
TopicSyntax, Semantics, Linguistic Variation
Canadian institutionsUniversity of Toronto
FundersSocial Sciences and Humanities Research Council of CanadaUniversity of CambridgeWilfrid Laurier UniversityUniversity of Illinois at Urbana-ChampaignUniversity of TorontoUniversity of OxfordMcMaster University
KeywordsNoun phraseSubject (documents)LinguisticsFeature (linguistics)AgreementModalComputer sciencePhraseDependent clauseNon-finite clauseNounSet (abstract data type)Simple (philosophy)Natural language processingMathematicsPhilosophySentenceProgramming language

Abstract

fetched live from OpenAlex

Abstract This article investigates agreement in Persian sentences with a specificational copular clause embedded under the epistemic modal tavānestan ‘can’. We argue that this structure is a raising structure. It exhibits agreement on both the embedded and modal verbs. Crucially, while the subject fails to control agreement in the embedded clause, it successfully controls agreement on the modal. We argue that the subject's failure to form an Agree relation in the embedded specificational clause is due to its defective feature structure, resulting in agreement with the lower noun phrase instead, this being an accessible goal as well. In the matrix clause, the lower noun phrase is inaccessible, due to the presence of an intervening domain boundary. This triggers probe reduction, a process that impoverishes the feature structure of the probe, expanding the set of possible goals to include the subject. We extend this analysis to subject agreement in simple specificational clauses in languages like English.

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.004
metaresearch head score (Gemma)0.005
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: Empirical · Consensus signal: Empirical
Teacher disagreement score0.004
Threshold uncertainty score0.019

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.005
Meta-epidemiology (narrow)0.0000.001
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0020.006
Scholarly communication0.0040.005
Open science0.0010.002
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.042
GPT teacher head0.242
Teacher spread0.200 · 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
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
Published2023
Admission routes2
Has abstractyes

Explore more

Same venueSyntaxSame topicSyntax, Semantics, Linguistic VariationFrench-language works237,207