MétaCan
Menu
Back to cohort
Record W2268028085 · doi:10.48550/arxiv.1308.2149

Frameworks for Reasoning about Syntax that Utilize Quotation and Evaluation

2013· preprint· en· W2268028085 on OpenAlexaff
William M. Farmer, Pouya Larjani

Bibliographic record

VenuearXiv (Cornell University) · 2013
Typepreprint
Languageen
FieldComputer Science
TopicNatural Language Processing Techniques
Canadian institutionsMcMaster University
Fundersnot available
KeywordsSyntaxComputer scienceAbstract syntaxAbstract syntax treeSyntax errorExpression (computer science)Semantics (computer science)Natural language processingValue (mathematics)Programming languageArtificial intelligenceLinguistics

Abstract

fetched live from OpenAlex

It is often useful, if not necessary, to reason about the syntactic structure of an expression in an interpreted language (i.e., a language with a semantics). This paper introduces a mathematical structure called a syntax framework that is intended to be an abstract model of a system for reasoning about the syntax of an interpreted language. Like many concrete systems for reasoning about syntax, a syntax framework contains a mapping of expressions in the interpreted language to syntactic values that represent the syntactic structures of the expressions; a language for reasoning about the syntactic values; a mechanism called quotation to refer to the syntactic value of an expression; and a mechanism called evaluation to refer to the value of the expression represented by a syntactic value. A syntax framework provides a basis for integrating reasoning about the syntax of the expressions with reasoning about what the expressions mean. The notion of a syntax framework is used to discuss how quotation and evaluation can be built into a language and to define what quasiquotation is. Several examples of syntax frameworks are presented.

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.034
metaresearch head score (Gemma)0.044
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: Methods · Consensus signal: Methods
Teacher disagreement score0.034
Threshold uncertainty score0.180

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0340.044
Meta-epidemiology (narrow)0.0030.003
Meta-epidemiology (broad)0.0030.008
Bibliometrics0.0090.007
Science and technology studies0.0060.016
Scholarly communication0.0140.045
Open science0.0070.013
Research integrity0.0050.007
Insufficient payload (model declined to judge)0.0100.003

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.073
GPT teacher head0.244
Teacher spread0.171 · 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
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

Citations5
Published2013
Admission routes1
Has abstractyes

Explore more

Same venuearXiv (Cornell University)Same topicNatural Language Processing TechniquesFrench-language works237,207