Branching of Fuzzy Quantifiers and Multiple Variable Binding: An Extension of DFS Theory
نویسنده
چکیده
Lindström [11] introduced a very powerful notion of quantifiers, which permits multi-place quantification and the simultaneous binding of several variables. A special case, 'branching' quantifiers, was found to be useful in linguistics, specifically for modelling reciprocal constructions like " Most men and most women admire each other ". Westerståhl [13] showed how to compute the three-place Lindström quantifier for " © ® each other " from the two-place quanti-fiers © b ª and © ¬ , assuming precise quantifiers and crisp arguments. In the report, I generalize Westerståhl's method to approximate quantifiers like " many " and fuzzy arguments like " young ". A consistent interpretation is achieved by incorporating Lindström quanti-fiers into the DFS theory of fuzzy quantification [5, 8], which rests on a system of formal adequacy criteria. The proposed analysis is of special importance to linguistic data summarization because the full meaning of reciprocal summarizers (e.g. describing factors which are " correlated " or " associated " with each other), can only be captured by branching quantification.
منابع مشابه
Fuzzy Quantifiers, Multiple Variable Binding and Branching Quantification
Lindström [1] introduced a very powerful notion of quantifiers, which permits multi-place quantification and the simultaneous binding of several variables. ‘Branching’ quantifification was found to be useful by linguists e.g. for modelling reciprocal constructions like “Most men and most women admire each other”. Westerståhl [2] showed how to compute the three-place Lindström quantifier for “Q1...
متن کاملData Fusion Based on Fuzzy Quantifiers
Fuzzy quantifiers (like many, few, ) are an important research topic not only due to their abundance in natural language (NL), but also because an adequate account of these quantifiers would provide a class of powerful yet human-understandable operators for information aggregation and data fusion. We introduce the DFS theory of fuzzy quantification, present a model of the theory, and describe a...
متن کاملCOMBINING FUZZY QUANTIFIERS AND NEAT OPERATORS FOR SOFT COMPUTING
This paper will introduce a new method to obtain the order weightsof the Ordered Weighted Averaging (OWA) operator. We will first show therelation between fuzzy quantifiers and neat OWA operators and then offer anew combination of them. Fuzzy quantifiers are applied for soft computingin modeling the optimism degree of the decision maker. In using neat operators,the ordering of the inputs is not...
متن کاملFuzzy quantifiers: a linguistic technique for data fusion
Fuzzy quantifiers like “few”, “almost”, “about” and many others abound in natural language. They are used by humans for describing uncertain facts, quantitative relations and processes. An adequate contradiction-free computer-operational implementation of these quantifiers would provide a class of powerful yet human-understandable operators both for aggregation and fusion of data but also for s...
متن کاملFuzzy Quantifiers: A Natural Language Technique for Data Fusion
Fuzzy quantifiers like ‘almost all’ and ‘about half’ abound in natural language. They are used for describing uncertain facts, quantitative relations and processes. An implementation of these quantifiers can provide expressive and easy-to-use operators for aggregation and data fusion, but also for steering the fusion process on a higher level through a safe transfer of expert-knowledge expresse...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002