#### Filter Results:

- Full text PDF available (9)

#### Publication Year

1997

2005

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

of the Thesis Evaluation, Implementation, and Extension of Primitive Optimality Theory by Daniel Matthew Albro Master of Arts in Linguistics University of California, Los Angeles, 1997 Professor Edward P. Stabler, Chair Eisner's (1997a) Primitive Optimality Theory is a simple formal model of a subset of Optimality Theory (Prince and Smolensky 1993). The… (More)

One of the first tasks children face in the process of acquiring their first languages is to develop a characterization of which sound sequences are legal or illegal in their native languages. Knowledge of this characterization— phonotactics—develops at or before 10 months of age (Jusczyk et al. 1994). Knowledge they (seem to) have: ability to recognize… (More)

- Daniel Albro
- 1998

This paper proposes an expansion of set of primitive constraints available within the Primitive Optimality Theory framework (Eisner, 1997a). This expansion consists of the addition of a new family of constraints—existential implicational constraints, which allow the specification of faithfulness constraints that can be satisfied at a distance—and the… (More)

- Daniel Albro
- ArXiv
- 2000

Primitive Optimality Theory (OTP) (Eisner, 1997a; Albro, 1998), a computational model of Optimality Theory (Prince and Smolensky, 1993), employs a finite state machine to represent the set of active candidates at each stage of an Optimality Theoretic derivation, as well as weighted finite state machines to represent the constraints themselves. For some… (More)

- Daniel Albro
- 1999

There are two main sources by which a child could learn language-particular phonological rules or constraints: segment distribution data and allomorphy. That is, seeing which phones appear in which phonetic contexts can give some initial clues toward the phonotactics of a language, and then seeing how morphemes alternate in phonetic form based on… (More)

- Daniel Albro
- 2005

We de ne an m-multiple context-free grammar (m-mcfg) as in Seki et al. 1991. A multiple context-free grammar G is a ve-tuple 〈N,O,F,R, S〉, where N is a set of distinguished non-terminal symbols; O ⊆ ⋃ n∈N+(Σ ∗)n is a set of tuples of strings from the input alphabet Σ; F ⊆ ⋃ n∈N Fn, where Fn is the set of partial functions from On to O, is a set of… (More)

- Daniel Albro
- 1997

The underpinnings of this algorithm were originally written as part of a word-comparison algorithm that would ignore various types of phonological changes in order to split words up into morphemes (Albro 1997). Covington’s (1996) article led to the realization that the algorithm might be used as an improvement (or at least a different take) on his method of… (More)

The multiple context-free grammar (MCFG) formalism (Seki et al. 1991), an extension of the standard contextfree grammar (CFG) formalism, is one of a class of grammars known as “mildly context sensitive.” These grammars allow description of the type of phenomena typically analyzed as involving “movement.” MCFGs have generative power strictly between tree… (More)

- Daniel Albro
- 2000

1.2 The Input 1.2.1 Surface forms • Consists of surface phonetic forms to which the children may or may not have attached a meaning (so we can’t assume any sort of semantic bootstrapping, morphemic knowledge, etc). • We can’t assume knowledge of relationships among forms, and therefore we can’t assume knowledge of underlying forms. • This means positive… (More)

- ‹
- 1
- ›