search for books and compare prices
Stuart M. Shieber has written 5 work(s)
Search for other authors with the same name
displaying 1 to 5 | at end
show results in order: alphabetically | oldest to newest | newest to oldest
Cover for 9780262692939 Cover for 9780226122151 Cover for 9780262193245 Cover for 9780262513852 Cover for 9780262193030 Cover for 9780937073179 Cover for 9780937073186
Product Description: This book surveys the important concept of unification as it relates to linguistic theory and, in particular, to Functional Unification Grammar, Definite-Clause Grammars, Lexical-Function Grammar, Generalized Phrase Struture Grammar, and Head-Driven Phrase Structure Grammar...read more

Hardcover:

9780226122151 | Stanford Univ Center for the Study, January 28, 2001, cover price $29.95 | About this edition: This book surveys the important concept of unification as it relates to linguistic theory and, in particular, to Functional Unification Grammar, Definite-Clause Grammars, Lexical-Function Grammar, Generalized Phrase Struture Grammar, and Head-Driven Phrase Structure Grammar.
9780521073011 | Stanford Univ Center for the Study, January 1, 1987, cover price $29.95

Paperback:

9780226122168 | Stanford Univ Center for the Study, January 28, 2001, cover price $12.95 | About this edition: This book surveys the important concept of unification as it relates to linguistic theory and, in particular, to Functional Unification Grammar, Definite-Clause Grammars, Lexical-Function Grammar, Generalized Phrase Struture Grammar, and Head-Driven Phrase Structure Grammar.

cover image for 9780262193245
Product Description: Constraint-based theories of grammar and grammar formalisms are becoming an increasingly widespread area of research in computational linguistics. Constraint-Based Grammar Formalisms provides the first rigorous mathematical and computational basis for this important area...read more

Hardcover:

9780262193245 | Bradford Books, October 27, 1992, cover price $45.00 | About this edition: Constraint-based theories of grammar and grammar formalisms are becoming an increasingly widespread area of research in computational linguistics.

Paperback:

9780262513852 | Bradford Books, October 27, 1992, cover price $23.00 | About this edition: Constraint-based theories of grammar and grammar formalisms are becoming an increasingly widespread area of research in computational linguistics.

cover image for 9780262193030
Product Description: William Rounds, Avarind Joshi, Janet Fodor, and Robert Berwick are leading scholars in the multidisciplinary field of natural language processing. In four separate essays they address the complex and difficult connections among grammatical theory, mathematical linguistics, and the operation of real natural-language-processing systems, both human and electronic...read more

Hardcover:

9780262193030 | Bradford Books, July 1, 1991, cover price $40.00 | About this edition: William Rounds, Avarind Joshi, Janet Fodor, and Robert Berwick are leading scholars in the multidisciplinary field of natural language processing.

cover image for 9780937073186
Product Description: Logic programming, an important new method of compute programming resulting from recent research in artifucial intelligence and computer science, has proved to be especially appropriate for solving problems in natrual-language processing...read more (view table of contents, read Amazon.com's description)

Hardcover:

9780937073179 | Stanford Univ Center for the Study, June 1, 1987, cover price $39.95 | About this edition: Logic programming, an important new method of compute programming resulting from recent research in artifucial intelligence and computer science, has proved to be especially appropriate for solving problems in natrual-language processing.

Paperback:

9780937073186 | Stanford Univ Center for the Study, July 1, 1987, cover price $20.00 | About this edition: Logic programming, an important new method of compute programming resulting from recent research in artifucial intelligence and computer science, has proved to be especially appropriate for solving problems in natrual-language processing.

displaying 1 to 5 | at end