Clive Matthews is a lecturer in Linguistics at the University of East Anglia.

• PrefacePart I: Introduction1. Natural Language Processing1.1 Natural Language Interfaces1.2 The Linguistic Application of NLP1.3 NLP as a Tool for Linguistic Research1.4 Further Reading2. The Challenge of Natural Language Processing2.1 Knowledge of the Linguistic Structure2.2 Ambiguity and Contextual Knowledge2.3 The Process of Language Understanding2.4 Psycholinguistics and NLP2.5 Further ReadingPart II: The Fundamentals of Prolog Programming3. Facts3.1 Facts3.2 Asking Simple Questions in Prolog3.3 Compound Questions3.4 Questions and Variables3.5 Finding Alternative Answers: Backtracking3.6 Using Variables in Facts3.7 Further Reading4. Rules and Complex Names4.1 Rules4.2 How Prolog Answers Questions Using Rules4.3 Structured Objects5. Lists and Recursive Structures5.1 Lists5.2 Recursive Rules6. Developing Prolog Programs6.1 The Meaning of Prolog Programs6.2 Designing Programs6.3 Laying Out Programs6.4 Search Trees6.5 Search Strategies6.6 Tracing a Proof6.7 Some Common Programming Errors7. Built-In Predicates7.1 Input and Output7.2 fail7.3 consult and reconsult7.4 Modifying a Database7.5 Defining Operators7.6 The 'cut'7.7 Program ListingPart III: Natural Language Processing with Prolog8. Sentence Recognition And Finite State Grammars8.1 Sentence Frame Grammars8.2 A Sentence Frame Grammar-based Recognisor8.3 An Alternative Notation for Sentence Frame Grammars8.4 An FSG-Based Recognisor8.5 Extending The Range of Finite State Grammars8.6 Further Reading8.7 Program Listings9. Recursive Transition Networks9.1 Constituent Structure9.2 Extending the Network Notation9.3 An RTN-Based Recognisor9.4 Implementing an RTN Recognisor in Prolog9.5 Extending the RTN Notation9.6 Further Reading9.7 Program Listings10. Phrase Structure Grammars10.1 Phrase Structure Grammars10.2 A Simple Phrase Structure Recognisor10.3 Directly Representing Phrase Structure Grammars in Prolog10.4 Efficiency10.5 Difference Lists10.6 The Grammar Rule Notation10.7 Further Reading10.8 Program Listings11. Definite Clause Grammars11.1 Grammar Symbols as Complex Terms11.2 Procedure Calls11.3 Further Reading11.4 Program Listings12. Alternative Parsing Strategies12.1 A Top-Down Interpreter12.2 Problems with Top-Down Parsing12.3 A Bottom-Up Interpreter12.4 A Left-Corner Interpreter12.5 Deterministic Parsing12.6 Chart Parsing12.7 Further Reading12.8 Program ListingsSolutions to ExercisesGlossary of TermsBibliographyIndex

Clive Matthews is a lecturer in Linguistics at the University of East Anglia.

• PrefacePart I: Introduction1. Natural Language Processing1.1 Natural Language Interfaces1.2 The Linguistic Application of NLP1.3 NLP as a Tool for Linguistic Research1.4 Further Reading2. The Challenge of Natural Language Processing2.1 Knowledge of the Linguistic Structure2.2 Ambiguity and Contextual Knowledge2.3 The Process of Language Understanding2.4 Psycholinguistics and NLP2.5 Further ReadingPart II: The Fundamentals of Prolog Programming3. Facts3.1 Facts3.2 Asking Simple Questions in Prolog3.3 Compound Questions3.4 Questions and Variables3.5 Finding Alternative Answers: Backtracking3.6 Using Variables in Facts3.7 Further Reading4. Rules and Complex Names4.1 Rules4.2 How Prolog Answers Questions Using Rules4.3 Structured Objects5. Lists and Recursive Structures5.1 Lists5.2 Recursive Rules6. Developing Prolog Programs6.1 The Meaning of Prolog Programs6.2 Designing Programs6.3 Laying Out Programs6.4 Search Trees6.5 Search Strategies6.6 Tracing a Proof6.7 Some Common Programming Errors7. Built-In Predicates7.1 Input and Output7.2 fail7.3 consult and reconsult7.4 Modifying a Database7.5 Defining Operators7.6 The 'cut'7.7 Program ListingPart III: Natural Language Processing with Prolog8. Sentence Recognition And Finite State Grammars8.1 Sentence Frame Grammars8.2 A Sentence Frame Grammar-based Recognisor8.3 An Alternative Notation for Sentence Frame Grammars8.4 An FSG-Based Recognisor8.5 Extending The Range of Finite State Grammars8.6 Further Reading8.7 Program Listings9. Recursive Transition Networks9.1 Constituent Structure9.2 Extending the Network Notation9.3 An RTN-Based Recognisor9.4 Implementing an RTN Recognisor in Prolog9.5 Extending the RTN Notation9.6 Further Reading9.7 Program Listings10. Phrase Structure Grammars10.1 Phrase Structure Grammars10.2 A Simple Phrase Structure Recognisor10.3 Directly Representing Phrase Structure Grammars in Prolog10.4 Efficiency10.5 Difference Lists10.6 The Grammar Rule Notation10.7 Further Reading10.8 Program Listings11. Definite Clause Grammars11.1 Grammar Symbols as Complex Terms11.2 Procedure Calls11.3 Further Reading11.4 Program Listings12. Alternative Parsing Strategies12.1 A Top-Down Interpreter12.2 Problems with Top-Down Parsing12.3 A Bottom-Up Interpreter12.4 A Left-Corner Interpreter12.5 Deterministic Parsing12.6 Chart Parsing12.7 Further Reading12.8 Program ListingsSolutions to ExercisesGlossary of TermsBibliographyIndex

Clive Matthews is a lecturer in Linguistics at the University of East Anglia.

• PrefacePart I: Introduction1. Natural Language Processing1.1 Natural Language Interfaces1.2 The Linguistic Application of NLP1.3 NLP as a Tool for Linguistic Research1.4 Further Reading2. The Challenge of Natural Language Processing2.1 Knowledge of the Linguistic Structure2.2 Ambiguity and Contextual Knowledge2.3 The Process of Language Understanding2.4 Psycholinguistics and NLP2.5 Further ReadingPart II: The Fundamentals of Prolog Programming3. Facts3.1 Facts3.2 Asking Simple Questions in Prolog3.3 Compound Questions3.4 Questions and Variables3.5 Finding Alternative Answers: Backtracking3.6 Using Variables in Facts3.7 Further Reading4. Rules and Complex Names4.1 Rules4.2 How Prolog Answers Questions Using Rules4.3 Structured Objects5. Lists and Recursive Structures5.1 Lists5.2 Recursive Rules6. Developing Prolog Programs6.1 The Meaning of Prolog Programs6.2 Designing Programs6.3 Laying Out Programs6.4 Search Trees6.5 Search Strategies6.6 Tracing a Proof6.7 Some Common Programming Errors7. Built-In Predicates7.1 Input and Output7.2 fail7.3 consult and reconsult7.4 Modifying a Database7.5 Defining Operators7.6 The 'cut'7.7 Program ListingPart III: Natural Language Processing with Prolog8. Sentence Recognition And Finite State Grammars8.1 Sentence Frame Grammars8.2 A Sentence Frame Grammar-based Recognisor8.3 An Alternative Notation for Sentence Frame Grammars8.4 An FSG-Based Recognisor8.5 Extending The Range of Finite State Grammars8.6 Further Reading8.7 Program Listings9. Recursive Transition Networks9.1 Constituent Structure9.2 Extending the Network Notation9.3 An RTN-Based Recognisor9.4 Implementing an RTN Recognisor in Prolog9.5 Extending the RTN Notation9.6 Further Reading9.7 Program Listings10. Phrase Structure Grammars10.1 Phrase Structure Grammars10.2 A Simple Phrase Structure Recognisor10.3 Directly Representing Phrase Structure Grammars in Prolog10.4 Efficiency10.5 Difference Lists10.6 The Grammar Rule Notation10.7 Further Reading10.8 Program Listings11. Definite Clause Grammars11.1 Grammar Symbols as Complex Terms11.2 Procedure Calls11.3 Further Reading11.4 Program Listings12. Alternative Parsing Strategies12.1 A Top-Down Interpreter12.2 Problems with Top-Down Parsing12.3 A Bottom-Up Interpreter12.4 A Left-Corner Interpreter12.5 Deterministic Parsing12.6 Chart Parsing12.7 Further Reading12.8 Program ListingsSolutions to ExercisesGlossary of TermsBibliographyIndex