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

Overview

Constraint-based theories of grammar and grammar formalisms are becoming an increasingly widespread area of research in computational linguistics. Constraint-Based GrammarFormalisms 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 StuartShieber's many contributions that have been at the core of developments ranging from the discovery of improved ...

See more details below
Paperback
$21.86
BN.com price
(Save 4%)$23.00 List Price
Other sellers (Paperback)
  • All (11) from $18.95   
  • New (6) from $19.00   
  • Used (5) from $18.95   
Sending request ...

Overview

Constraint-based theories of grammar and grammar formalisms are becoming an increasingly widespread area of research in computational linguistics. Constraint-Based GrammarFormalisms 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 StuartShieber'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.Stuart M. Shieber is Assistant Professor of Computer Science at HarvardUniversity.

Read More Show Less

Editorial Reviews

Booknews
In this revised version of his Ph.D. dissertation (Stanford U., 1989), Sheiber examines the theoretical and computational foundations of constraint-based grammars and applications to natural language analysis. Annotation c. Book News, Inc., Portland, OR (booknews.com)
Read More Show Less

Product Details

  • ISBN-13: 9780262513852
  • Publisher: MIT Press
  • Publication date: 8/13/2009
  • Series: Bradford Bks.
  • Pages: 195
  • Product dimensions: 9.10 (w) x 9.10 (h) x 0.80 (d)

Meet the Author

Stuart M. Shieber is Harvard College Professor and James O. Welch, Jr. and Virginia B. WelchProfessor of Computer Science, Division of Engineering and Applied Sciences, at HarvardUniversity.

Read More Show Less

Table of Contents

Preface
1 Introduction 1
2 Constraint Logics for Linguistic Information 5
2.1 The Structure of Grammatical Information 5
2.2 The PATR Formalism 8
2.3 Idealizations of the Constraint-Based View 15
2.4 Constraint-Based Computer Language Description 16
2.5 History of Constraint-Based Formalisms 18
2.6 The Structure of Constraint-Based Formalisms 23
2.7 Appropriate Logics for Constraint-Based Formalisms 25
2.8 Properties of Appropriate Constraint-Logic Models 31
2.9 Operations on Models 37
2.10 Existence of Appropriate Models for [actual symbol not reproducible] 48
3 Grammars and Parsing 51
3.1 Defining Constraint-Based Formalisms 51
3.2 Grammar Interpretation 53
3.3 The Abstract Parsing Algorithm 57
3.4 Auxiliary Notions for Item Semantics 62
3.5 A Correctness Proof for the Algorithm 66
3.6 Instances of the Abstract Algorithm 78
4 A Compendium of Model Classes 87
4.1 Finite-Tree Models 88
4.2 Infinite-Tree Models 92
4.3 Eqtree Models 96
4.4 Graph Models 104
5 Parsing as Type Inference 117
5.1 Natural and Computer Languages 118
5.2 A Difference in Semantics 122
5.3 Constraint-Based Computer-Language Formalisms 125
5.4 Extending [actual symbol not reproducible] with Subsumption Constraints 133
5.5 Models for [actual symbol not reproducible] 137
6 Conclusion 153
Appendix: Proofs of Properties of [actual symbol not reproducible] 157
Glossary 169
Bibliography 171
Index 177
Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)