Constraint-Based Grammar Formalisms: Parsing and Type Inference for Natural and Computer Languages Review

Average Reviews:

(More customer reviews)Are you looking to buy Constraint-Based Grammar Formalisms: Parsing and Type Inference for Natural and Computer Languages? Here is the right place to find the great deals. we can offer discounts of up to 90% on Constraint-Based Grammar Formalisms: Parsing and Type Inference for Natural and Computer Languages. Check out the link below:

>> Click Here to See Compare Prices and Get the Best Offers

Constraint-Based Grammar Formalisms: Parsing and Type Inference for Natural and Computer Languages ReviewI remember when I saw this book in the bookstore (back in the days when "bookstore" meant a physical place). I was torn -- I already owned a copy of the thesis; should I pay good money for a book that might turn out to be just a reprinting of the thesis with a nicer cover? I tried to determine how much was new, but in the end I thought "there's probably only a few hundred people in the world who are really interested in this topic; if I don't buy it, who will?" I'm glad I did buy it; ten years later I still remember the point about the boundary between syntax and semantics being a fluid one; one that computational linguists draw in a different place than programming language designers. The rest of the book is also worth reading, whether or not you've read the thesis.Constraint-Based Grammar Formalisms: Parsing and Type Inference for Natural and Computer Languages OverviewConstraint-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. It introduces new applications to both natural and computer languages and brings together Stuart Shieber's many contributions that have been at the core of developments ranging from the discovery of improved explanations of linguistic phenomena such as binding and coordination to the detailed mathematical analysis of constraint-solving and parsing in a variety of grammar formalisms.This thorough examination of the theoretical and computational foundations of constraint-based grammars and applications to natural-language analysis is unique in several respects. Shieber's theoretical framework may be applied to a whole class of formalisms with properties that make it possible to define a general parsing algorithm for all members of the class, with results that provide essential guidance to the implementer of constraint-based language processing systems. Shieber also brings out new connections between grammatical categories and data types, and between constraint-based natural-language analysis and type inference in computer languages. These connections should be of increasing interest both to computational and theoretical linguists and to computer scientists.

Want to learn more information about Constraint-Based Grammar Formalisms: Parsing and Type Inference for Natural and Computer Languages?

>> Click Here to See All Customer Reviews & Ratings Now