Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 213

The DOI matches its Crossref record.

Representation and Inference for Natural Language: A First Course in Computational Semantics

Open access
Pelletier, Francis Jeffry·2006·Computational Linguistics

Abstract

Computational semantics is the study of how to represent meaning in a way that computers can use.For the authors of this textbook, this study includes the representation of the meaning of natural language in logic formalisms, the recognition of certain relations that hold within this formalization (such as synonymy, consistency, and implication), and the computational implementation of all this.I think that, while there probably are not many courses devoted to computational semantics, this book could profitably be incorporated into more traditional computational linguistics courses, especially when two courses are offered serially.The material here could be spread out and integrated into parts of a more standard pair of these courses, and it would result in a substantial widening of the knowledge that students come away with from these courses.The introduction of this book traces the history of computational semantics, with a goal of justifying the enterprise in the face of the modern emphasis on statistical natural language processing.Besides this introduction, the book contains six substantial chapters and four short appendices.There is also a very extensive suite of material online at a Web site maintained by the authors.Chapter 1 is an introduction to first-order logic, but with a twist that underscores the particular outlook taken in this book.There is a very short introduction to the notion of a model of a set of quantifier-free sentences, followed by an equally short discussion of the interpretation of quantifiers in a model.With respect to quantifier-free sentences, students are referred to the three-page Appendix B on propositional logic, where truth-tables are covered.The innovations start with the introduction of three "inference tasks": querying, consistency checking, and informativity checking.These correspond to the logical concepts of satisfiability (of a given formula in a given model), consistency (whether there is a model that satisfies a given formula), and validity (whether a formula is true in all models, or, equivalently, whether a given argument is valid).Although the notions of querying, etc., are thus merely renamings of standard logical notions, it seems to me that the renaming is particularly apposite in the setting of a textbook for non-logicians, especially since much is to be done computationally with these notions in the enterprise of computational semantics.Much of the remainder of chapter 1 consists of a gentle introduction to Prolog and using it to check formulas for well-formedness and to build model checkers with the goal of implementing the querying task.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1162/coli.2006.32.2.283

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 213

Metadata

Authors
Pelletier, F. J.
Venue
Computational Linguistics
Published
2006-06
Volume
32
Issue
2
Pages
283-286
ISSN
  • 0891-2017 (ISSN-L)
  • 1530-9312
OpenAlex
W1986423506
Cited by
213
References
0
FWCI
22.20
Type
journal article
Language
en
Open access
bronze

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Representation and Inference for Natural Language: A First Course in Computational Semantics. https://app.cochat.ai/papers/10.1162/coli.2006.32.2.283
The paper
Pelletier, F. J. (2006). Representation and Inference for Natural Language: A First Course in Computational Semantics. Computational Linguistics. https://doi.org/10.1162/coli.2006.32.2.283

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.