One approach to understanding how the human cognitive system stores and operates with
quantifiers such as “some,”“many,” and “all” is to investigate their interaction with the …

Different classes of quantifiers provably require different verification algorithms with different
complexity profiles. The algorithm for proportional quantifiers, like 'most', is more complex …

We propose a new universal constraint on the relationship between the meaning of a clause-
embedding predicate when it takes an interrogative complement and its meaning when it …

The computation of scalar implicatures is sometimes costly relative to basic meanings.
Among the costly computations are those that involve strengthening “some” to “not all” and …

The paper presents a manually annotated corpus of Polish quantificational expressions. The
quantifier annotation was conducted on top of existing gold-standard data for Polish as its …

Measuring text complexity is an essential task in several fields and applications (such as
NLP, semantic web, smart education, etc.). The semantic layer of text is more tacit than its …

Computational complexity theory, or in other words, the theory of tractability and
intractability, is defined in terms of limit behavior. This chapter overviews some interesting …

The paper presents a tool for automatic marking up of quantifying expressions, their
semantic features, and scopes. We explore the idea of using a BERT based neural model for …

Simple measures often couldn't count a deep complexity. In the case of semantic complexity,
conventional readability formulas share a common style, a common sort of achievements …

We will present a natural logic (NQL) for reasoning with generalized quantifiers that aims to
predict mean human success on syllogistic and related reasoning tasks. Natural logics …