A Survey of Computational Semantics
Representation, Inference and Knowledge in Wide‐Coverage Text Understanding
Bibliographic Data
| ID | 7900729 |
|---|---|
| Authors | Jolanda Bos (0000-0002-9079-5438, University of Groningen, corresponding author), Johan Bos |
| Year | 2011 |
| Volume | 5 |
| Issue | 6 |
| Pages | 336-366 |
| Publication date | 2011-06-01 |
| Peer Reviewed | Yes |
| Open Access | Yes |
| Type | ARTICLE |
| Venue | Language and Linguistics Compass (JOURNAL) |
| Journal identifiers | ISSN: 1749-818X • E-ISSN: 1749-818X |
| Publisher | Wiley (PUBLISHER • GB) |
| DOI | 10.1111/j.1749-818x.2011.00284.x |
| OpenAlex | W2099698106 |
| Language | EN |
| Citations received | 4 |
| References cited | 61 |
The aim of computational semantics is to capture the meaning of natural language expressions in representations suitable for performing inferences, in the service of understanding human language in written or spoken form. First‐order logic is a good starting point, both from the representation and inference point of view. But even if one makes the choice of first‐order logic as representation language, this is not enough: the computational semanticist needs to make further decisions on how to model events, tense, modal contexts, anaphora and plural entities. Semantic representations are usually built on top of a syntactic analysis, using unification, techniques from the lambda‐calculus or linear logic, to do the book‐keeping of variable naming. Inference has many potential applications in computational semantics. One way to implement inference is using algorithms from automated deduction dedicated to first‐order logic, such as theorem proving and model building. Theorem proving can help in finding contradictions or checking for new information. Finite model building can be seen as a complementary inference task to theorem proving, and it often makes sense to use both procedures in parallel. The models produced by model generators for texts not only show that the text is contradiction‐free; they also can be used for disambiguation tasks and linking interpretation with the real world. To make interesting inferences, often additional background knowledge is required (not expressed in the analysed text or speech parts). This can be derived (and turned into first‐order logic) from raw text, semi‐structured databases or large‐scale lexical databases such as WordNet. Promising future research directions of computational semantics are investigating alternative representation and inference methods (using weaker variants of first‐order logic, reasoning with defaults), and developing evaluation methods measuring the semantic adequacy of systems and formalisms
Description logic · Inference · Knowledge representation and reasoning · Natural language processing · Programming language · Semantic interpretation · Computer Science · Natural Language Processing Techniques · Semantic Web and Ontologies · Topic Modeling · Artificial Intelligence
Logic, semantics, metamathematics
The Generative Lexicon
Reference to Abstract Objects in Discourse
Quantification and Syntactic Theory
WordNet
The Proper Treatment of Quantification in Ordinary English
The Logical Analysis of Plurals and Mass Terms
Generalized quantifiers and natural language
Ellipsis and higher-order unification
Presupposition Projection as Anaphora Resolution
Dealing with Ambiguities by Underspecification
Plurality and Conjunction
A Machine Learning Approach to Coreference Resolution of Noun Phrases
Automatic Discovery of Part–Whole Relations
Implementing the Binding and Accommodation Theory for Anaphora Resolution and Presupposition Projection
Representation and Inference for Natural Language
Similarity of Semantic Relations
Automatic Discovery of Part-Whole Relations
Linguistics and natural logic
The Proposition Bank
Distributional Structure
| Unique citing works | 4 |
|---|---|
| Citations per year | 0,29 |
| Citation span | 2012 - 2018 (7) |
| Citation velocity | historical |
| Highly cited | No |
| Citation types | Neutral: 4 |