Moraic reversal and realisation: analysis of a Japanese language game
Bibliographic record
Abstract
This paper provides a description and an Optimality Theory analysis of the Japanese language game sakasa kotoba. This analysis contributes to the phonological study of language games, as sakasa kotoba constitutes a novel language game type: total mora reversal. In addition, our analysis contributes to the study of Japanese phonology, by providing evidence (i) for the mora, (ii) on the internal structure of the syllable in Japanese and (iii) on the representation of moras occurring in complex syllables, namely coda nasals, geminates and long vowels. The patterning of these moras suggests that the game manipulates intermediate representations, rather than underlying or surface forms. We propose a formal analysis within the framework of Stratal OT. The analysis uses a game-specific constraint to motivate reversal, with other aspects of game form shape determined through the interaction of markedness and faithfulness constraints.
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.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.003 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 0.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.
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".