Post on 16-Aug-2020
Factorial Typology
Elementary Syllable Structure (Prince & Smolensky 1993, Ch. 6)
The Jakobson Typology
“There are languages lacking syllables with initial vowels and/or syllables with final consonants, but there are no languages devoid of syllables with initial consonants or syllables with final vowels.”
onsets
required not required
codas forbidden ΣCV Σ(C)V
allowed ΣCV(C) Σ(C)V(C)
Constraints assumed
Faithfulness w FILL
Empty syllabic positions are prohibited. (nuclei = ♡, margins = ♢)
w PARSE Unsyllabified segments are prohibited. (e.g., ⟨C⟩, ⟨V⟩)
Markedness w ONSET (“ONS” in PS93)
Vowel-initial (onsetless) syllables are prohibited: *[σV…
w NO-CODA (“–COD”) Consonant-final (codaful?) syllables are prohibited: *…C]σ
Simplifying assumption: maximal syllable = CVC
Permuted rankings
w There are 4!=24 permutations of these constraints. Not all will yield distinct results, because not every pair of constraints is in conflict. A little a priori analysis of the interactions simplifies the task of exploring the factorial typology:
l FILL conflicts with PARSE only if ONSET or NO-CODA dominates
one of them. Thus, there’s no detectable difference, with respect to just these constraints, between the following two rankings: w FILL ≫ PARSE ≫ {ONSET, NO-CODA}
PARSE ≫ FILL ≫ {ONSET, NO-CODA}
Permuted rankings
l ONSET doesn’t ever come into conflict with NO-CODA. Thus, there’s no detectable difference, with respect to just these constraints, between the following pairs of rankings: w ONSET ≫ NO-CODA ≫ FILL ≫ PARSE
NO-CODA ≫ ONSET ≫ FILL ≫ PARSE w ONSET ≫ NO-CODA ≫ PARSE ≫ FILL
NO-CODA ≫ ONSET ≫ PARSE ≫ FILL
w FILL ≫ ONSET ≫ NO-CODA ≫ PARSE
FILL ≫ NO-CODA ≫ ONSET ≫ PARSE
w PARSE ≫ ONSET ≫ NO-CODA ≫ FILL
PARSE ≫ NO-CODA ≫ ONSET ≫ FILL
w {FILL, PARSE} ≫ ONSET ≫ NO-CODA
{FILL, PARSE} ≫ NO-CODA ≫ ONSET
Some Issues to Consider
w Given these constraints … … can any language ever lack CV syllables entirely? … can any language ever require CVC syllables? … will any language ever syllabify /CVCV/ as [CVC.V]?
w These constraints entail the following: a. No language that satisfies ONSET by deletion will satisfy NO-CODA by epenthesis. b. No language that satisfies ONSET by epenthesis will satisfy NO-CODA by deletion. c. No language that satisfies NO-CODA by deletion will satisfy ONSET by epenthesis. d. No language that satisfies NO-CODA by epenthesis will satisfy ONSET by deletion.
w (Do you see why this is the case? Since these entailments are unlikely to be correct, how can the theory be amended to avoid them?)
I. A Jakobsonian CV Language (with epenthesis)
Some characteristic derivations:
/pati/ ⟶ [pa.ti] faithful syllabification
/pai/ ⟶ [pa.♢i] onset epenthesis
/pakti/ ⟶ [pa.k♡.ti] nucleus epenthesis
ONSET ≫ FILL
Input: /pai/ ONSET FILL
a. ☞ [pa.♢i] *
b. [pa.i] * !
NO-CODA ≫ FILL
Input: /pakti/ NO-CODA FILL
a. ☞ [pa.k♡.ti] *
b. [pak.ti] * !
PARSE ≫ FILL
Input: /pai/ PARSE FILL
a. ☞ [pa.♢i] *
b. [pa⟨i⟩] or [p⟨a⟩i]
* !
PARSE ≫ FILL
Input: /pakti/ PARSE FILL
a. ☞ [pa.k♡.ti] *
b. [pa⟨k⟩.ti] or [pa.k⟨t⟩i]
* !
ONSET, NO-CODA, PARSE ≫ FILL
Input: /pati/ ONSET NO-CODA PARSE FILL
a. ☞ [pa.ti]
b. [pa♢.ti] * ! *
c. [pa]⟨ti⟩ * ! *
ONSET, NO-CODA, PARSE ≫ FILL
Input: /pai/ ONSET NO-CODA PARSE FILL
a. ☞ [pa.♢i] *
b. [pa.i] * !
c. [pa♢.♢i] * ! **
d. [pa⟨i⟩] * !
e. [p⟨a⟩i] * !
ONSET, NO-CODA, PARSE ≫ FILL
Input: /pakti/ ONSET NO-CODA PARSE FILL
a. ☞ [pa.k♡.ti] *
b. [pak.ti] * !
c. [pa⟨k⟩.ti] * !
II. A Jakobsonian CV Language (with deletion)
Some characteristic derivations:
/pati/ ⟶ [pa.ti] faithful syllabification
/pai/ ⟶ [pa⟨i⟩] vowel deletion
/pakti/ ⟶ [pa⟨k⟩.ti] consonant deletion
ONSET ≫ PARSE
Input: /pai/ ONSET PARSE
a. ☞ [pa⟨i⟩] *
b. [pa.i] * !
NO-CODA ≫ PARSE
Input: /pakti/ NO-CODA PARSE
a. ☞ [pa⟨k⟩.ti] *
b. [pak.ti] * !
FILL ≫ PARSE
Input: /pai/ FILL PARSE
a. ☞ [pa⟨i⟩] *
b. [pa.♢i] * !
FILL ≫ PARSE
Input: /pakti/ FILL PARSE
a. ☞ [pa⟨k⟩.ti] *
b. [pa.k♡.ti] * !
ONSET, NO-CODA, FILL ≫ PARSE
Input: /pati/ ONSET NO-CODA FILL PARSE
a. ☞ [pa.ti]
b. [pa♢.ti] * ! * !
c. [pa]⟨ti⟩ * ! *
ONSET, NO-CODA, FILL ≫ PARSE
Input: /pai/ ONSET NO-CODA FILL PARSE
a. ☞ [pa⟨i⟩] *
b. [pa.i] * !
c. [pa♢.♢i] * ! * ! *
d. [pa.♢i] * !
e. [p⟨a⟩i] * ?
ONSET, NO-CODA, FILL ≫ PARSE
Input: /pakti/ ONSET NO-CODA FILL PARSE
a. ☞ [pa⟨k⟩.ti] *
b. [pak.ti] * !
c. [pa.k♡.ti] * !
III. A Jakobsonian CV(C) Language (with epenthesis)
Some characteristic derivations:
/pati/ ⟶ [pa.ti] faithful syllabification
/pai/ ⟶ [pa.♢i] onset epenthesis
/pakti/ ⟶ [pak.ti] faithful syllabification
ONSET ≫ FILL
Input: /pai/ ONSET FILL
a. ☞ [pa.♢i] *
b. [pa.i] * !
PARSE ≫ FILL
Input: /pai/ PARSE FILL
a. ☞ [pa.♢i] *
b. [pa⟨i⟩] or [p⟨a⟩i]
* !
FILL ≫ NO-CODA
Input: /pakti/ FILL NO-CODA
a. ☞ [pak.ti] *
b. [pa.k♡.ti] * !
PARSE ≫ NO-CODA
Input: /pakti/ PARSE NO-CODA
a. ☞ [pak.ti] *
b. [pa⟨k⟩.ti] or [pa.k⟨t⟩i]
* !
ONSET, PARSE ≫ FILL ≫ NO-CODA
Input: /pati/ ONSET PARSE FILL NO-CODA
a. ☞ [pa.ti]
b. [pa♢.ti] * ! *
c. [pa]⟨ti⟩ * ! *
ONSET, PARSE ≫ FILL ≫ NO-CODA
Input: /pai/ ONSET PARSE FILL NO-CODA
a. ☞ [pa.♢i] *
b. [pa.i] * !
c. [pa♢.♢i] * ! * *
d. [pa⟨i⟩] * !
e. [p⟨a⟩i] * !
ONSET, PARSE ≫ FILL ≫ NO-CODA
Input: /pakti/ ONSET PARSE FILL NO-CODA
a. ☞ [pak.ti] *
b. [pa.k♡.ti] * !
c. [pa⟨k⟩.ti] * !
IV. A Jakobsonian CV(C) Language (with deletion)
Some characteristic derivations:
/pati/ ⟶ [pa.ti] faithful syllabification
/pai/ ⟶ [pa⟨i⟩] vowel deletion
/pakti/ ⟶ [pak.ti] faithful syllabification
ONSET ≫ PARSE
Input: /pai/ ONSET PARSE
a. ☞ [pa⟨i⟩] *
b. [pa.i] * !
FILL ≫ PARSE
Input: /pai/ FILL PARSE
a. ☞ [pa⟨i⟩] *
b. [pa.♢i] * !
PARSE ≫ NO-CODA
Input: /pakti/ PARSE NO-CODA
a. ☞ [pak.ti] *
b. [pa⟨k⟩.ti] or [pa.k⟨t⟩i]
* !
FILL ≫ NO-CODA
Input: /pakti/ FILL NO-CODA
a. ☞ [pak.ti] *
b. [pa.k♡.ti] * !
ONSET, FILL ≫ PARSE ≫ NO-CODA
Input: /pati/ ONSET FILL PARSE NO-CODA
a. ☞ [pa.ti]
b. [pa♢.ti] * ! * !
c. [pa]⟨ti⟩ * !
ONSET, FILL ≫ PARSE ≫ NO-CODA
Input: /pai/ ONSET FILL PARSE NO-CODA
a. ☞ [pa⟨i⟩] *
b. [pa.i] * !
c. [pa♢.♢i] * ! * *
d. [pa.♢i] * !
e. [p⟨a⟩i] * ?
ONSET, FILL ≫ PARSE ≫ NO-CODA
Input: /pakti/ ONSET FILL PARSE NO-CODA
a. ☞ [pak.ti] *
b. [pa⟨k⟩.ti] * !
c. [pa.k♡.ti] * !
V. A Jakobsonian (C)V Language (with epenthesis)
Some characteristic derivations:
/pati/ ⟶ [pa.ti] faithful syllabification
/pai/ ⟶ [pa.i] faithful syllabification
/pakti/ ⟶ [pa.k♡.ti] nucleus epenthesis
VI. A Jakobsonian (C)V Language (with deletion)
Some characteristic derivations:
/pati/ ⟶ [pa.ti] faithful syllabification
/pai/ ⟶ [pa.i] faithful syllabification
/pakti/ ⟶ [pa⟨k⟩.ti] consonant deletion
VII. A Jakobsonian (C)V(C) Language (fully faithful)
Some characteristic derivations:
/pati/ ⟶ [pa.ti] faithful syllabification
/pai/ ⟶ [pa.i] faithful syllabification
/pakti/ ⟶ [pak.ti] faithful syllabification
Extended CV Syllable Structure Typology
Onsets
required not required
ONSET, FILLOns ≫
PARSE
ONSET, PARSE ≫ FILLOns
PARSE, FILLOns ≫
ONSET
Codas
forbidden
NO-CODA, FILLNuc ≫
PARSE ΣCV
del,del ΣCV
ep,del Σ(C)V
del
NO-CODA, PARSE ≫ FILLNuc
ΣCVdel,ep
ΣCVep,ep
Σ(C)Vep
allowed PARSE,
FILLNuc ≫ NO-CODA
ΣCV(C)del
ΣCV(C)ep
Σ(C)V(C)