Natural Language Semantics and Computability

2016/05/13 by Moot, Richard, Retoré, Christian · 1 citation
#Artificial Intelligence (cs.AI) #Computation and Language (cs.CL) #Computational Complexity (cs.CC) #FOS: Computer and information sciences

paper · doi:10.48550/arxiv.1605.04122

Abstract

This paper is a reflexion on the computability of natural language semantics. It does not contain a new model or new results in the formal semantics of natural language: it is rather a computational analysis of the logical models and algorithms currently used in natural language semantics, defined as the mapping of a statement to logical formulas - formulas, because a statement can be ambiguous. We argue that as long as possible world semantics is left out, one can compute the semantic representation(s) of a given statement, including aspects of lexical meaning. We also discuss the algorithmic complexity of this process.

Cited by

• On the Relevance of Logic for Artificial Intelligence, and the Promise of Neurosymbolic Learning

Related

• Logical analysis of natural language semantics to solve the problem of computer understanding
• A New Semantic Theory of Natural Language
• We went to look for meaning and all we got were these lousy representations: aspects of meaning representation for computational semantics
• Knowledge Representation for Lexical Semantics: Is Standard First Order Logic Enough?
• Commonsense Knowledge, Ontology and Ordinary Language