Part III: Unification and Parsing

• 10 Unification
  • 10.1 What is Unification?
  • 10.2 Finite and Infinite Trees
  • 10.3 Equations
  • 10.4 Efficiency
  • 10.5 Feature Constraints
  • 10.6 Feature Structures versus Feature Trees
  • 10.7 Exercises

• 11 Encapsulated Search
  • 11.1 Unification as Constraint Solving
  • 11.2 Failure versus Programming Error
  • 11.3 Encapsulated Search
    • 11.3.1 Stability
    • 11.3.2 Global Variables
    • 11.3.3 Stateful Data Structures

• 12 Unification and Encapsulation
  • 12.1 Encapsulating Failure
  • 12.2 How to treat a Constraint as a Value?
  • 12.3 Constraints as Predicates
  • 12.4 Unifying Attribute Value Matrices
  • 12.5 Exercises
  • 12.6 Program Collection

• 13 Chart Parsing for Unification Grammars
  • 13.1 Unification-based Grammars
    • 13.1.1 Feature Terms
    • 13.1.2 Path equations
    • 13.1.3 Organising the lexicon
  • 13.2 Unification-based Parsing
    • 13.2.1 Structured.categories
    • 13.2.2 Is Context Free Grammar Enough?
    • 13.2.3 Rule Formats
    • 13.2.4 Chart Parsing
    • 13.2.5 A Simplistic Example
  • 13.3 The Complete Package
  • 13.4 Exercises

• 14 Active Chart Parsing
  • 14.1 Non concurrent active chart parsing
  • 14.2 Exercise