KOS–Grammar Integration #
@cite{ginzburg-2012} Ch. 5, @cite{ginzburg-sag-2000}
@cite{ginzburg-2012}'s central thesis: interaction is built into grammar.
The Sign type has dgb-params and q-params — dialogue features living
inside syntactic representations (Ch. 5, §5.2).
This module provides the integration point between HPSG signs and KOS
dialogue gameboards. Neither HPSG/Core/Basic.lean nor KOS/Basic.lean
knows about the other; this module imports both and defines:
- DialogueSign — an HPSG sign extended with DGB-params and Q-params
- Conversions to both
HPSG.SynsemandKOS.LocProp - Example entries for wh-words and proper names
Design #
This is opt-in integration: theories that don't need dialogue features continue to use plain HPSG signs. Theories that need the Ginzburg 2012 architecture import this module.
An HPSG sign extended with dialogue features.
@cite{ginzburg-2012} Ch. 5 §5.2 (Sign schema, p. 122 ex. 12) introduces dgb-params and quest-dom as dialogue-relevant features on Sign:
dgbParams: contextual parameters that must be resolved for groundingquestDom: the question domain — what question the sign introduces
The third field, q-params (parameters contributed by interrogative elements like wh-words), is added in Ch. 8 §8.5.1 (ex. 101 p. 325, ex. 103 p. 326, ex. 104 p. 326) — Ginzburg's footnote on p. 122 explicitly notes "the field q-params introduced in section 8.5 of Chapter 8". We include it here in the canonical form for substrate convenience.
These correspond to DGB-PARAMS, Q-PARAMS, and QUEST-DOM in the book.
The Cont parameter is the content type — String for surface form,
or richer typed values (BCheckableAustinian S, etc.) for TTR-typed
grammars.
- phon : String
Phonological form
- pos : UD.UPOS
Part of speech (UD-based, matching HPSG.Synsem.cat)
- head : HPSG.HeadFeatures
Head features from HPSG
- cont : Cont
Semantic content
- dgbParams : CParamSet
DGB-PARAMS: contextual parameters requiring grounding. Non-empty for referential NPs ("Bo"), demonstratives, etc.
- qParams : CParamSet
Q-PARAMS: parameters contributed by interrogative elements. Non-empty for wh-words ("who", "what").
- questDom : Option String
QUEST-DOM: the question this sign introduces (if interrogative).
Instances For
Project a DialogueSign to its HPSG Synsem (dropping dialogue features).
Instances For
Convert a DialogueSign to a LocProp for the KOS DGB.
DGB-PARAMS become cparams (block grounding until resolved);
Q-PARAMS become qcparams (travel with the sign, do not block grounding,
but remain available for fragment-reprise queries per
@cite{ginzburg-2012} §8.5.1, @cite{purver-ginzburg-2004}).
Equations
Instances For
Conversion preserves phonological form.
Conversion preserves content.
Conversion routes DGB-PARAMS to cparams (the resolution channel).
Conversion routes Q-PARAMS to qcparams (the existential-witness
channel) — the structural prerequisite for the Reprise Content Hypothesis.
"who" — a wh-word with Q-PARAMS. @cite{ginzburg-2012} Ch. 5: wh-words contribute Q-PARAMS that project to the QUEST-DOM of the clause.
Equations
- Dialogue.KOS.Grammar.who = { phon := "who", pos := UD.UPOS.PRON, cont := "who(x)", qParams := [{ index := "x", restriction := "individual" }], questDom := some "?x.P(x)" }
Instances For
"Jo" — a proper name with DGB-PARAMS. @cite{ginzburg-2012} Ch. 6: referential NPs introduce DGB-PARAMS that must be resolved (grounded) for the utterance to be integrated.
Equations
- Dialogue.KOS.Grammar.jo = { phon := "Jo", pos := UD.UPOS.PROPN, cont := "jo", dgbParams := [{ index := "jo_ref", restriction := "individual" }] }
Instances For
"left" — an intransitive verb (no dialogue params).
Equations
- Dialogue.KOS.Grammar.left = { phon := "left", pos := UD.UPOS.VERB, cont := "leave(x)" }
Instances For
"Jo" needs grounding: it has non-empty DGB-PARAMS.
"who" has Q-PARAMS (it's interrogative).
"who" doesn't need grounding (Q-PARAMS ≠ DGB-PARAMS).
Structural analogy: discharging a SLASH gap and resolving a C-PARAM both reduce the count of outstanding dependencies.
Both SLASH (filler-gap) and C-PARAMS (grounding) are sets of outstanding dependencies discharged by similar mechanisms. This theorem makes the isomorphism explicit.