Results 321 to 330 of about 3,424,284 (379)

Psychomedical named entity recognition method based on multi-level feature extraction and multi-granularity embedding fusion. [PDF]

Sci Rep
Liu Z, Zhang G, Shen Y.
europepmc   +1 more source

Leveraging two-dimensional pre-trained vision transformers for three-dimensional model generation via masked autoencoders. [PDF]

Sci Rep
Sajid M, Razzaq Malik K, Ur Rehman A, Safdar Malik T, Alajmi M, Haider Khan A, Haider A, Hussen S.   +7 more
europepmc   +1 more source

Siamese comparative transformer-based network for unsupervised landmark detection. [PDF]

PLoS One
Zhao C, Wu T, Zhang J, Xu Z, Li M, Liu D.   +5 more
europepmc   +1 more source

EFCRFNet: A novel multi-scale framework for salient object detection. [PDF]

PLoS One
Peng H, Hu Y, Yu B, Zhang Z.
europepmc   +1 more source

Principles and Practices for Bipolar Semantics and Impact Measures in Computational Argumentation

Caren Al Anaissy
openalex   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Computational Semantics with Functional Programming

2010
Computational semantics is the art and science of computing meaning in natural language. The meaning of a sentence is derived from the meanings of the individual words in it, and this process can be made so precise that it can be implemented on a computer.
van Eijck, Jan, Unger, Christina
openaire   +6 more sources

Computational Semantics Requires Computation

The Florida AI Research Society, 2012
This chapter argues, briefly, that much work in formal Computational Semantics (alias CompSem) is not computational at all, and does not attempt to be; there is some mis-description going on here on a large and long-term scale. The aim of this chapter is to show that such work is not just misdescribed, but loses value because of the scientific ...
Y. Wilks
openaire   +3 more sources

Inference and Computational Semantics

Journal of Logic, Language and Information, 2004
In this paper we discuss inference in computational semantics. In particular, we argue that state-of-the-art methods in first-order theorem proving and model generation are of direct relevance to inference for natural language processing. This claim is based on our experience of implementing van der Sandt’s approach to presupposition, and much of the ...
Michael Kohlhase, Patrick Blackburn
openaire   +3 more sources

Towards a Computational Semantics

1987
In ordinary model-theoretic semantics, set-theoretic denotations are assigned to linguistic expressions without regard to computational complexity. Yet, there is a reasonable prima facie case for the assumption that at least basic items in natural language correspond to simple procedures, that are easy to learn. What is needed to investigate such ideas
J. Benthem
openaire   +3 more sources