Limit this search to....

Optimality-Theoretic Syntax: A Declarative Approach: A Declarative Approach
Contributor(s): Kuhn, Jonas (Author)
ISBN: 1575864266     ISBN-13: 9781575864266
Publisher: Center for the Study of Language and Informat
OUR PRICE:   $26.73  
Product Type: Paperback
Published: February 2003
Qty:
Temporarily out of stock - Will ship within 2 to 5 weeks
Annotation: With this book, Jonas Kuhn greatly advances Optimality Theory (OT) by clarifying the significant choices in the design of a formally precise OT approach to syntax. Building on OT work that uses the representation structures of Lexical Functional Grammar (OT-LFG), Kuhn defines the notion of an OT-syntactic grammar in a declarative, non-derivational way.Along with the standard OT architecture, which is based on a generation metaphor, Kuhn also formalizes parsing-based OT, and goes on to discuss possible combinations of these two architectures. This is followed by an examination of assumptions under which the computational tasks of generation and parsing are decidable for an OT-syntactic grammar.
Additional Information
BISAC Categories:
- Language Arts & Disciplines | Linguistics - General
- Language Arts & Disciplines | Grammar & Punctuation
Dewey: 415.01
LCCN: 2003010791
Series: Studies in Constraint-Based Lexicalism
Physical Information: 0.56" H x 6.04" W x 9.1" (0.77 lbs) 256 pages
 
Descriptions, Reviews, Etc.
Publisher Description:
With this book, Jonas Kuhn greatly advances Optimality Theory (OT) by clarifying the significant choices in the design of a formally precise OT approach to syntax. Building on OT work that uses the representation structures of Lexical Functional Grammar (OT-LFG), Kuhn defines the notion of an OT-syntactic grammar in a declarative, non-derivational way.

Along with the standard OT architecture, which is based on a generation metaphor, Kuhn also formalizes parsing-based OT, and goes on to discuss possible combinations of these two architectures. This is followed by an examination of assumptions under which the computational tasks of generation and parsing are decidable for an OT-syntactic grammar.