Advertisement
Published in:
2011 | OriginalPaper | Chapter
Some Generalised Comparative Determiners
Author : Richard Zuber
Published in: Logical Aspects of Computational Linguistics
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Functions denoted by specific comparative expressions called
generalised comparative determiners
are analysed. These expressions form verb arguments when applied to common nouns. They denote functions which take sets and a binary relation as argument and give a set as result. These functions are thus different from denotations of ”ordinary” determiners. However, they do obey some similar constraints, properly generalised. It is shown that verbal arguments obtained from such generalised determiners extend the expressive power of NLs since functions that they denote are not just case extensions of type 〈1〉 quantifiers used to interpret ”ordinary” determiner phrases.