Computational Approaches to Morphology and Syntax

Hardcover (Print)
Used and New from Other Sellers
Used and New from Other Sellers
from $52.50
Usually ships in 1-2 business days
(Save 69%)
Other sellers (Hardcover)
  • All (5) from $52.50   
  • New (3) from $58.65   
  • Used (2) from $52.50   
Sort by
Page 1 of 1
Showing All
Note: Marketplace items are not eligible for any coupons and promotions
Seller since 2010

Feedback rating:



New — never opened or used in original packaging.

Like New — packaging may have been opened. A "Like New" item is suitable to give as a gift.

Very Good — may have minor signs of wear on packaging but item works perfectly and has no damage.

Good — item is in good condition but packaging may have signs of shelf wear/aging or torn packaging. All specific defects should be noted in the Comments section associated with each item.

Acceptable — item is in working order but may show signs of wear such as scratches or torn packaging. All specific defects should be noted in the Comments section associated with each item.

Used — An item that has been opened and may show signs of wear. All specific defects should be noted in the Comments section associated with each item.

Refurbished — A used item that has been renewed or updated and verified to be in proper working condition. Not necessarily completed by the original manufacturer.

2007 Hardcover New *****PLEASE NOTE: This item is shipping from an authorized seller in Europe. In the event that a return is necessary, you will be able to return your item ... within the US. To learn more about our European sellers and policies see the BookQuest FAQ section***** Read more Show Less

Ships from: Consett, United Kingdom

Usually ships in 1-2 business days

  • Canadian
  • International
  • Standard, 48 States
  • Standard (AK, HI)
Seller since 2008

Feedback rating:


Condition: New

Ships from: Chicago, IL

Usually ships in 1-2 business days

  • Standard, 48 States
  • Standard (AK, HI)
Seller since 2008

Feedback rating:


Condition: New
New Book. Shipped from UK within 10 to 14 business days. Established seller since 2000.

Ships from: Horcott Rd, Fairford, United Kingdom

Usually ships in 1-2 business days

  • Standard, 48 States
  • Standard (AK, HI)
Page 1 of 1
Showing All
Sort by


The book will appeal to scholars and advanced students of morphology, syntax, computational linguistics and natural language processing (NLP). It provides a critical and practical guide to computational techniques for handling morphological and syntactic phenomena, showing how these techniques have been used and modified in practice.

The authors discuss the nature and uses of syntactic parsers and examine the problems and opportunities of parsing algorithms for finite-state, context-free and various context-sensitive grammars. They relate approaches for describing syntax and morphology to formal mechanisms and algorithms, and present well-motivated approaches for augmenting grammars with weights or probabilities.

Read More Show Less

Product Details

Meet the Author

Brian E. Roark is Assistant Professor in the Department of Computer Science & Electrical Engineering and the Center for Spoken Language Understanding at Oregon Health & Science University. He has published papers in Computer Speech and Language, Speech Communication, Natural Language Engineering and Computational Linguistics.
Richard Sproat is Professor of Linguistics and Electrical and Computer Engineering at the University of Illinois at Urbana-Champaign and also holds an appointment at the Beckman Institute for Advanced Science and Technology. His most recent book is A Computational Theory of Writing Systems (CUP, 2000).

Read More Show Less

Table of Contents

General preface ix

Preface x

List of Figures xii

List of Tables xv

Abbreviations xvii

1 Introduction and Preliminaries 1

1.1 Introduction 1

1.2 Finite-State Automata and Transducers 2

1.3 Weights and Probabilities 8

1.4 Weighted Finite-State Automata and Transducers 9

1.5 A Synopsis of Algorithmic Issues 13

1.6 Computational Approaches to Morphology and Syntax 16

Part I Computational Approaches to Morphology

2 The Formal Characterization of Morphological Operations 23

2.1 Introduction 24

2.2 Syntagmatic Variation 27

2.2.1 Simple Concatenation 27

2.2.2 Interlude: Prosodic Circumscription 29

2.2.3 Prosodically Governed Concatenation 31

2.2.4 Phonological Changes Induced by Affixation 35

2.2.5 Subsegmental Morphology 36

2.2.6 Subtractive Morphology 37

2.2.7 Extrametrical Infixation 39

2.2.8 Positively Circumscribed Infixation 40

2.2.9 Root-and-Pattern Morphology 41

2.2.10 Morphomic Components 46

2.3 Paradigmatic Variation 49

2.4 The Remaining Problem: Reduplication 53

2.5 Summary 61

3 The Relevance of Computational Issues for Morphological Theory 62

3.1 Introduction: Realizational versus Incremental Morphology 62

3.2 Stump's Theory 66

3.3 Computational Implementation of Fragments 67

3.3.1 Stem Alternations in Sanskrit 68

3.3.2 Position Classes in Swahili 73

3.3.3 Double Plurals in Breton 79

3.4 Equivalence of Inferential-Realizational and Lexical-Incremental Approaches: A Formal Analysis 83

3.5 Conclusions 85

Appendix 3A Lextools 86

Appendix 3B XFST Implementation of Sanskrit 95

4 A Brief History of Computational Morphology 100

4.1 Introduction 100

4.2 The KIMMO Two-Level MorphologicalAnalyzer 102

4.2.1 KIMMO Basics 103

4.2.2 FST Intersection 105

4.2.3 Koskenniemi's Rule Types 109

4.2.4 Koskenniemi's System as a Historical Accident 110

4.3 Summary 113

5 Machine Learning of Morphology 116

5.1 Introduction 116

5.2 Goldsmith, 2001 119

5.2.1 Candidate Generation 121

5.2.2 Candidate Evaluation 122

5.3 Schone and Jurafsky, 2001 124

5.4 Yarowsky and Wicentowski, 2001 129

5.5 Discussion 132

Part II Computational Approaches to Syntax

6 Finite-state Approaches to Syntax 139

6.1 N-gram Models 139

6.1.1 Background 139

6.1.2 Basic Approach 141

6.1.3 Smoothing 143

6.1.4 Encoding 148

6.1.5 Factored Language Models 150

6.2 Class-based Language Models 151

6.2.1 Forward Algorithm 154

6.3 Part-of-Speech Tagging 159

6.3.1 Viterbi Algorithm 160

6.3.2 Efficient N-best Viterbi Decoding 162

6.3.3 Forward-backward Algorithm 164

6.3.4 Forward-backward Decoding 168

6.3.5 Log-linear Models 170

6.4 NP Chunking and Shallow Parsing 173

6.5 Summary 174

7 Basic Context-free Approaches to Syntax 176

7.1 Grammars, Derivations and Trees 176

7.2 Deterministic Parsing Algorithms 180

7.2.1 Shift-reduce Parsing 181

7.2.2 Pushdown Automata 182

7.2.3 Top-down and Left-corner Parsing 184

7.3 Non-deterministic Parsing Algorithms 189

7.3.1 Re-analysis and Beam-search 191

7.3.2 CYK Parsing 193

7.3.3 Earley Parsing 201

7.3.4 Inside-outside Algorithm 203

7.3.5 Labeled Recall Parsing 206

7.4 Summary 208

8 Enriched Context-free Approaches to Syntax 209

8.1 Stochastic CFG-based Parsing 209

8.1.1 Treebanks and PCFGs 210

8.1.2 Lexicalized Context-free Grammars 221

8.1.3 Collins Parser 226

8.1.4 Charniak Parser 230

8.2 Dependency Parsing 234

8.3 PCFG-based Language Models 238

8.4 Unsupervised Grammar Induction 240

8.5 Finite-state Approximations 244

8.6 Summary 246

9 Context-sensitive Approaches to Syntax 248

9.1 Unification Grammars and Parsing 248

9.2 Lexicalized Grammar Formalisms and Parsing 257

9.2.1 Tree-adjoining Grammars 258

9.2.2 Combinatory Categorial Grammars 265

9.2.3 Other Mildly Context-sensitive Approaches 270

9.2.4 Finite-state and Context-free Approximations 271

9.3 Parse Selection 273

9.3.1 Stochastic Unification Grammars 273

9.3.2 Data-oriented Parsing 275

9.3.3 Context-free Parser Re-ranking 277

9.4 Transduction Grammars 279

9.5 Summary 283

References 285

Name Index 307

Language Index 312

Index 313

Read More Show Less

Customer Reviews

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

5 Star


4 Star


3 Star


2 Star


1 Star


Your Rating:

Your Name: Create a Pen Name or

Barnes & 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 & 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 & 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 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


  • - By submitting a review, you grant to Barnes & and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Terms of Use.
  • - Barnes & reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & 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 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
Sort by: Showing 1 Customer Reviews
  • Posted June 18, 2013

    I¿m loving McDonalds for fast food... MyDeals247 for the best de

    I’m loving McDonalds for fast food... MyDeals247 for the best deals;))

    Was this review helpful? Yes  No   Report this review
Sort by: Showing 1 Customer Reviews

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