Natural language semantics and computability
From MaRDI portal
Publication:2425328
Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Logic of natural languages (03B65) Complexity of computation (including implicit computational complexity) (03D15) Proof-theoretic aspects of linear logic and other substructural logics (03F52)
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.
Recommendations
- scientific article; zbMATH DE number 18657
- Computational complexity of the semantics of some natural language constructions
- scientific article; zbMATH DE number 4135922
- scientific article; zbMATH DE number 2001367
- scientific article; zbMATH DE number 1794706
- scientific article; zbMATH DE number 1098501
- scientific article; zbMATH DE number 3196674
- scientific article; zbMATH DE number 4075029
- Natural language processing. Semantic aspects
Cites work
- Catalan Numbers
- Foundations of Software Science and Computation Structures
- Gapping as Like-Category Coordination
- scientific article; zbMATH DE number 3853055 (Why is no real title available?)
- scientific article; zbMATH DE number 50939 (Why is no real title available?)
- Linguistic application of first order intuitionistic linear logic
- Logic and structure
- Natural language inference in Coq
- On the expressive power of abstract categorial grammars: Representing context-free formalisms
- Parsing/theorem-proving for logical grammar \textit{CatLog3}
- Product-Free Lambek Calculus Is NP-Complete
- Proof nets for the multimodal Lambek calculus
- Soft linear logic and polynomial time
- The displacement calculus
- The logic of categorial grammars. A deductive account of natural language syntax and semantics
- The Montagovian generative lexicon Ty_n: a type theoretical framework for natural language semantics
Cited in
(13)- Towards a natural language semantics without functors and operands
- Computational analysis and understanding of natural languages: principles, methods and applications
- Meaning and computing: two approaches to computable propositions
- Natural language processing. Semantic aspects
- A Computable Solution to Partee’s Temperature Puzzle
- scientific article; zbMATH DE number 431759 (Why is no real title available?)
- scientific article; zbMATH DE number 1808285 (Why is no real title available?)
- scientific article; zbMATH DE number 4035108 (Why is no real title available?)
- scientific article; zbMATH DE number 18657 (Why is no real title available?)
- scientific article; zbMATH DE number 1098501 (Why is no real title available?)
- Compositionality, computability, and complexity
- Formal languages and the NLP black box
- Proof-theoretic aspects of the logic of scope
This page was built for publication: Natural language semantics and computability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2425328)
