Jump to ContentJump to Main Navigation
Thinking as ComputationA First Course$
Users without a subscription are not able to see the full content.

Hector J. Levesque

Print publication date: 2012

Print ISBN-13: 9780262016995

Published to MIT Press Scholarship Online: August 2013

DOI: 10.7551/mitpress/9780262016995.001.0001

Show Summary Details
Page of

PRINTED FROM MIT PRESS SCHOLARSHIP ONLINE (www.mitpress.universitypressscholarship.com). (c) Copyright The MIT Press, 2022. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in MITSO for personal use.date: 04 July 2022

Case Study: Understanding Natural Language

Case Study: Understanding Natural Language

(p.152) (p.153) 8 Case Study: Understanding Natural Language
Thinking as Computation

Levesque Hector J.

The MIT Press

This chapter focuses on the sort of thinking required to make sense of expressions in a natural language, that is, a language like English or Italian or Swahili that is spoken naturally by people. Section 8.1 explains how language is usually studied in terms of syntax and semantics. Section 8.2 focuses on the noun phrases of English and how they can be used to refer to known individuals and objects. Section 8.3 examines how these noun phrases can be put to work in answering yes/no questions written in English and in adding to what is known using English declarative sentences. To do so, a new feature of Prolog is introduced: dynamic predicates. Section 8.4 briefly discusses how the utility of noun phrases is actually even more extensive.

Keywords:   Prolog programming, syntax, semantics, noun phrases, English language, dynamic predicates

MIT Press Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs, and if you can't find the answer there, please contact us.