Docs / Studies / Studies.BakovicBlumenfeld2024

A formal typology of process interactions

Baković, E. & Blumenfeld, L. (2024). Phonological Data and Analysis, 6(3), 1–43

This file formalizes the algebra of interactions between two maps on strings. The input set of a map holds the strings it changes, its output set their images, and the input-rank of a string the most pieces the map rewrites independently. The four atoms are feeding and bleeding of the other map's input-rank or output set; feeding, bleeding and seeding are configurations of atoms, and an order is opaque where the map applying first is input-provided or output-removed. Raising gives palatalization in kike a second locus the set-based definitions miss, counterfeeding leaves the fed map's input on the surface, seeding makes both orders opaque, and flipping a feeding map makes it bleed.

Implementation notes

  • The pieces of a nonvacuous break are nonempty, so the input-rank of a string is at most its length.
  • Output interactions are the paper's case (26), where one of the two strings has no nonvacuous input, so they compare membership in the output set.
  • The rules are the library's local rewrite rules, except epenthesis, which inserts and is a map. The Bedouin Arabic, Polish and hypothetical forms use chart segments, the Finnish and Turkish forms their fragments' phonemes.

TODO

  • Output-rank for strings with several nonvacuous inputs (25), misapplication in Palestinian Arabic and Yokuts, the typology of §5, and cropping.

References

Input and output sets, input-rank

L67–100
L109
L111–112
L121–129

In the counterfeeding order the fed map underapplies: where P makes a string Q applies to, applying Q first changes nothing, and P then gives a string in Q's input set.

theorem underapplicationL141–147
{σ : Type u_1} {P Q : List σ → List σ} {x : List σ} (h : Phonology.Feeds P (fun (x : List σ) => x ∈ inputSet Q) x) :
P (Q x) = P x ∧ P (Q x) ∈ inputSet Q

Built from

Molecules and opacity

L157–164
L166–173
L191
L194
L197–198

Flipping turns feeding into bleeding (§6): a map reversing the two arrows of a feeding map bleeds what it fed.

theorem Feeding.flipL200–206
{σ : Type u_1} [DecidableEq σ] {P Q P' : List σ → List σ} {a b c d : List σ} (h : Feeding P Q a b c d) (hb : P' b = a) (hc : P' c = d) :
Bleeding P' Q b a c d

Built from ,

Replacement rules

A rule that replaces its target and reads nothing to its left maps onto a string only from the string itself, unless an occurrence of the replacing segment stands before the rule's right context.

Segments of the Bedouin Arabic, Polish and hypothetical examples

Input-rank and the second locus (19)

Raising gives palatalization a second locus in kike: it input-provides palatalization (23), though kike is already in palatalization's input set, so raising does not feed it in the set-based sense of (18).

theorem feeds_kikeL313–318

Built from , , , , , ,

Feeding and counterfeeding: Bedouin Arabic (5)

Bleeding and counterbleeding: Polish (6)

Seeding: Turkish (14)

Epenthesis seeds deletion at bebekn, bebekin, bebein, so both orders are opaque: epenthesis overapplies in the attested order and deletion underapplies in the other.

theorem seeding_turkishL410–425

Built from , , , ,

Flipping: Finnish (47)

L445–457