NP coordination minimal pairs
Equations
- One or more equations did not get rendered due to their size.
Instances For
VP coordination minimal pairs
Equations
- One or more equations did not get rendered due to their size.
Instances For
S coordination minimal pairs
Equations
- One or more equations did not get rendered due to their size.
Instances For
Theory-Neutral Semantic Data for Non-Constituent Coordination
The core empirical observation is a semantic equivalence:
"John likes and Mary hates beans" ≡ "John likes beans and Mary hates beans"
This is theory-neutral: we don't presuppose any logical formalism, just that native speakers judge these sentences to have the same meaning (same truth conditions, same entailments, intersubstitutable in any context).
The non-constituent coordination sentence
The semantically equivalent spelled-out version
- bothGrammatical : Bool
Both are grammatical
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- instReprSemanticEquivalence = { reprPrec := instReprSemanticEquivalence.repr }
"John likes and Mary hates beans" ≡ "John likes beans and Mary hates beans"
Equations
Instances For
"Warren cooked and Betsy ate the potatoes" ≡ "Warren cooked the potatoes and Betsy ate the potatoes"
Equations
- One or more equations did not get rendered due to their size.
Instances For
A theory captures non-constituent coordination if it derives equivalent meanings for both sentences in a SemanticEquivalence pair.
- bothDerive : G → SemanticEquivalence → Bool
Both sentences derive
- meaningsEquivalent : G → SemanticEquivalence → Bool
The derived meanings are equivalent