Questions: Basic Types and Shared Infrastructure

@cite{dayal-2016} @cite{groenendijk-stokhof-1984} @cite{anand-hardt-mccloskey-2021}

Theory-neutral types for question-answer phenomena.

inductive Phenomena.Questions.WhSemanticType : Type

Semantic type of a wh-phrase, classifying what domain the wh-word ranges over. The taxonomy is empirically motivated by distributional patterns in the Santa Cruz Sluicing Corpus, where these types show radically different frequencies.

• entity : WhSemanticType
• degree : WhSemanticType
• reason : WhSemanticType
• manner : WhSemanticType
• temporal : WhSemanticType
• locative : WhSemanticType
• classificatory : WhSemanticType

@[implicit_reducible]

instance Phenomena.Questions.instDecidableEqWhSemanticType : DecidableEq WhSemanticType

Equations

• Phenomena.Questions.instDecidableEqWhSemanticType x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯

def Phenomena.Questions.instReprWhSemanticType.repr : WhSemanticType → ℕ → Std.Format

Equations

• One or more equations did not get rendered due to their size.

@[implicit_reducible]

instance Phenomena.Questions.instReprWhSemanticType : Repr WhSemanticType

Equations

• Phenomena.Questions.instReprWhSemanticType = { reprPrec := Phenomena.Questions.instReprWhSemanticType.repr }

@[implicit_reducible]

instance Phenomena.Questions.instInhabitedWhSemanticType : Inhabited WhSemanticType

Equations

• Phenomena.Questions.instInhabitedWhSemanticType = { default := Phenomena.Questions.instInhabitedWhSemanticType.default }

def Phenomena.Questions.instInhabitedWhSemanticType.default : WhSemanticType

Equations

• Phenomena.Questions.instInhabitedWhSemanticType.default = Phenomena.Questions.WhSemanticType.entity

inductive Phenomena.Questions.QuestionType : Type

Classification of question types by answer form.

Note: this classifies the form of the question and expected answer, not the semantic type of the wh-phrase. For semantic type (entity, degree, reason, etc.), see WhSemanticType.

• polar : QuestionType
• whSingular : QuestionType
• whPlural : QuestionType
• alternative : QuestionType
• whReason : QuestionType
• whManner : QuestionType

@[implicit_reducible]

instance Phenomena.Questions.instDecidableEqQuestionType : DecidableEq QuestionType

Equations

• Phenomena.Questions.instDecidableEqQuestionType x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯

@[implicit_reducible]

instance Phenomena.Questions.instReprQuestionType : Repr QuestionType

Equations

• Phenomena.Questions.instReprQuestionType = { reprPrec := Phenomena.Questions.instReprQuestionType.repr }

def Phenomena.Questions.instReprQuestionType.repr : QuestionType → ℕ → Std.Format

Equations

• One or more equations did not get rendered due to their size.

def Phenomena.Questions.QuestionType.whSemanticType : QuestionType → Option WhSemanticType

The semantic type of the wh-phrase, when the question is a wh-question. Returns none for polar and alternative questions. For whSingular and whPlural, the semantic type depends on the specific wh-word used, so we default to entity — the caller should refine if needed.

Equations

• Phenomena.Questions.QuestionType.polar.whSemanticType = none
• Phenomena.Questions.QuestionType.alternative.whSemanticType = none
• Phenomena.Questions.QuestionType.whSingular.whSemanticType = some Phenomena.Questions.WhSemanticType.entity
• Phenomena.Questions.QuestionType.whPlural.whSemanticType = some Phenomena.Questions.WhSemanticType.entity
• Phenomena.Questions.QuestionType.whReason.whSemanticType = some Phenomena.Questions.WhSemanticType.reason
• Phenomena.Questions.QuestionType.whManner.whSemanticType = some Phenomena.Questions.WhSemanticType.manner

inductive Phenomena.Questions.AnswerCompleteness : Type

Answer completeness

• exhaustive : AnswerCompleteness
• mentionSome : AnswerCompleteness
• incomplete : AnswerCompleteness
• overinformative : AnswerCompleteness

@[implicit_reducible]

instance Phenomena.Questions.instDecidableEqAnswerCompleteness : DecidableEq AnswerCompleteness

Equations

• Phenomena.Questions.instDecidableEqAnswerCompleteness x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯

@[implicit_reducible]

instance Phenomena.Questions.instReprAnswerCompleteness : Repr AnswerCompleteness

Equations

• Phenomena.Questions.instReprAnswerCompleteness = { reprPrec := Phenomena.Questions.instReprAnswerCompleteness.repr }

def Phenomena.Questions.instReprAnswerCompleteness.repr : AnswerCompleteness → ℕ → Std.Format

Equations

• One or more equations did not get rendered due to their size.

inductive Phenomena.Questions.AnswerForm : Type

Answer form

• sentential : AnswerForm
• constituent : AnswerForm
• taciturn : AnswerForm

@[implicit_reducible]

instance Phenomena.Questions.instDecidableEqAnswerForm : DecidableEq AnswerForm

Equations

• Phenomena.Questions.instDecidableEqAnswerForm x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯

@[implicit_reducible]

instance Phenomena.Questions.instReprAnswerForm : Repr AnswerForm

Equations

• Phenomena.Questions.instReprAnswerForm = { reprPrec := Phenomena.Questions.instReprAnswerForm.repr }

def Phenomena.Questions.instReprAnswerForm.repr : AnswerForm → ℕ → Std.Format

Equations

• One or more equations did not get rendered due to their size.

structure Phenomena.Questions.QAPair : Type

A question-answer pair with metadata

• question : String

  The question

• answer : String

  The answer

• questionType : QuestionType

  Type of question

• completeness : AnswerCompleteness

  Completeness of answer

• form : AnswerForm

  Form of answer

• felicitous : Bool

  Is this Q-A pair felicitous?

• source : String

  Source/citation

@[implicit_reducible]

instance Phenomena.Questions.instReprQAPair : Repr QAPair

Equations

• Phenomena.Questions.instReprQAPair = { reprPrec := Phenomena.Questions.instReprQAPair.repr }

def Phenomena.Questions.instReprQAPair.repr : QAPair → ℕ → Std.Format

Equations

• One or more equations did not get rendered due to their size.

inductive Phenomena.Questions.TermType : Type

Term types determine exhaustive interpretation. Source: @cite{groenendijk-stokhof-1984}, Chapter IV.

• singular : TermType
• definiteNP : TermType
• indefinite : TermType
• universalNP : TermType

@[implicit_reducible]

instance Phenomena.Questions.instDecidableEqTermType : DecidableEq TermType

Equations

• Phenomena.Questions.instDecidableEqTermType x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯

def Phenomena.Questions.instReprTermType.repr : TermType → ℕ → Std.Format

Equations

• One or more equations did not get rendered due to their size.

@[implicit_reducible]

instance Phenomena.Questions.instReprTermType : Repr TermType

Equations

• Phenomena.Questions.instReprTermType = { reprPrec := Phenomena.Questions.instReprTermType.repr }

def Phenomena.Questions.TermType.exhaustive : TermType → Bool

Whether a term type gets an exhaustive interpretation

Equations

• Phenomena.Questions.TermType.singular.exhaustive = true
• Phenomena.Questions.TermType.definiteNP.exhaustive = true
• Phenomena.Questions.TermType.indefinite.exhaustive = false
• Phenomena.Questions.TermType.universalNP.exhaustive = true