MétaCan
Menu
Back to cohort
Record W3015694352 · doi:10.3989/loquens.2019.062

Rule Interaction Conversion Operations

2019· article· en· W3015694352 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueLoquens · 2019
Typearticle
Languageen
FieldComputer Science
TopicNatural Language Processing Techniques
Canadian institutionsCarleton University
Fundersnot available
KeywordsPairwise comparisonSet (abstract data type)Computer scienceTheoretical computer scienceMathematicsArtificial intelligenceProgramming language

Abstract

fetched live from OpenAlex

Different types of interactions between pairs of phonological rules can be converted into one another using three formal operations that we discuss in this article. One of these conversion operations, rule re-ordering (here called swapping), is well-known; another, flipping, is a more recent finding (Hein et al., 2014). We introduce a third conversion operation that we call cropping. Formal relationships among the members of the set of rule interactions, expanded by cropping beyond the classical four (feeding, bleeding, counterfeeding, and counterbleeding) to include four more (mutual bleeding, seeding, counterseeding, and merger), are identified and clarified. We show that these conversion operations exhaustively delimit the set of possible pairwise rule interactions predicted by conjunctive rule ordering (Chomsky & Halle, 1968), and that each interaction is related to each of the others by the application of at most two conversion operations.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.567
Threshold uncertainty score0.699

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.009
GPT teacher head0.267
Teacher spread0.258 · 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