Docs / Studies / Studies.BirdKlein1990

Phonological events

Bird, S. & Klein, E. (1990). Journal of Linguistics, 26(1), 33–56

Bird and Klein read an autosegmental diagram in time: the left-to-right order of a tier is precedence, and an association line is overlap. Their axioms (13) govern the two relations on events: overlap is reflexive and symmetric, precedence is asymmetric and disjoint from overlap, and an event preceding one member of an overlapping pair precedes every event following the other. Intervals of points satisfy the axioms under the definitions (11), and the No-Crossing Constraint is not stipulated but derived (Section 1.1): two crossing lines would make an event precede an event it overlaps. A representation is consistent when an event structure on its positions extends the order of its tiers and makes its lines overlaps (26).

Main definitions

Implementation notes

The paper's event structures are the structures of precedence and overlap of the logic of time; they are unrelated to the decompositions of ArgumentStructure.EventStructure. In modern terms, a precedence satisfying (13) with overlap its incomparability is an interval order. The endpoint definitions (12), which the paper considers and sets aside, state overlap strictly, so under them a one-point interval does not overlap itself; the point-set definitions (11) read off closed intervals are those of NonemptyInterval. The cycle of three tiers is a consequence of the axioms that the paper does not discuss: they agree with the classical pairwise No-Crossing Constraint when lines join only tiers adjacent in a forest, and are strictly stronger once lines join three tiers in a cycle.

References

The axioms for events

L61–73
L77–79

The axioms of an event structure entail the No-Crossing Constraint (Section 1.1).

theorem IsEventStructure.not_crossingL81–84
{E : Type u_1} {prec ov : E → E → Prop} (h : IsEventStructure prec ov) {w x y z : E} (hwx : prec w x) (hyz : prec y z) (hwz : ov w z) (hxy : ov x y) :
False

Built from

Intervals

Intervals form an event structure under the precedence and overlap of (11).

theorem isEventStructure_intervalsL114–133
{T : Type u_1} [LinearOrder T] :
IsEventStructure (fun (x y : NonemptyInterval T) => ∀ p ∈ x, ∀ q ∈ y, p < q) fun (x y : NonemptyInterval T) => ∃ p ∈ x, p ∈ y

Built from

Phonological event structures

L143–150

Examples

L211–214