The main data structure of IPOX is the metrical tree, or, more generally, a binary-branching, headed tree.
Tree :: Node --> Tree
| ( Tree / Tree )
| ( Tree \ Tree )
In this definition, the slash is used to indicate which of two sister nodes is the (prosodic) head.
- conventional metrical tree: only weak-strong or strong-weak is indicated; unary nodes are ignored
- headed constituent tree: constituent labels are shown, as well as headedness
two representations of the prosodic structure of the word photographical:
(F --> (S --> "pho" \ S --> "to")
/ F --> ((S --> "gra" \ S --> "phi") \ S --> "cal"))
A node in a metrical representation is a complex feature structure (Shieber 1986).
Node :: Category:Features
Features :: [FV*]
FV :: Node
| +Feature (Feature=true)
| -Feature (Feature=false)
complex feature structure for the unstressed vowel schwa
vow:[-stressed, voc:[+back, -rnd, height=mid]]
Our data structure is not limited to the representation of prosodic headedness.
Our data structure is too general because prosodic structure is "flat", that is, non-recursive
(Nespor and Vogel 1986).
- self-embedding is OK if across the board , as in (a) below
- self-embedding is compiled away in (b), obtaining (c)
- a prosodic category may not dominate a category of a higher type
stress patterns of two Dutch words: (a) universiteit 'university'; (b
=>c) makaroni 'macaroni'
Back to Table of Contents
Arthur Dirksen / firstname.lastname@example.org / January 13, 1995