Generating More Interesting Responses in Neural Conversation Models with Distributional Constraints

In the first part of the paper we give an overwiew of a natural syntactic class of constituents defined by means of a specific set of criteria : the “non régis” (NR) (non integrated in the grammatical structure of the utterance). This class, gathers, various kinds of grammatical units of non canonical syntactic status in traditional descriptions : sentence adverbials, appositions, interjections, non canonical subordinate clauses, discourse particles… In the second part of the paper we show that, contrary to current assumptions, these linguistic units are not randomly combined with the core elements of the sentence. They are inserted in the utterance according to specific ordering rules and distributional constraints. These constraints are studied at two levels : constraints on their possible insertions in grammatical structures (microsyntax), constraints on the positions they can occupy in relation with the “macrosyntactic” nucleus of the utterance (the part of the utterance bearing its illocutionnary force) as defined in Blanche-Benveniste (84, 90).

Download Full-text

Designing Matching Mechanisms under General Distributional Constraints

Proceedings of the Sixteenth ACM Conference on Economics and Computation - EC '15 ◽

10.1145/2764468.2764501 ◽

2015 ◽

Cited By ~ 1

Author(s):

Masahiro Goto ◽

Fuhiko Kojima ◽

Ryoji Kurata ◽

Akihisa Tamura ◽

Makoto Yokoo

Keyword(s):

Distributional Constraints

Download Full-text

Lexicalizing directional and nondirectional motion in Emai

Studies in African Linguistics ◽

10.32473/sal.v17i2.107491 ◽

1986 ◽

Vol 17 (2) ◽

pp. 177-198 ◽

Cited By ~ 1

Author(s):

Ronald P. Schaefer

Keyword(s):

Motion Path ◽

Continuous Series ◽

Semantic Composition ◽

The World ◽

Directional Motion ◽

Serial Verbs ◽

Distributional Constraints

Motion expressions in Emai, an Edoid language of Nigeria, are examined within the lexical typology of Talmy [1985]. Both directional and nondirectional motion structures involving the MANNER verb la 'to run' are analyzed, though only the former, syntactically expressed by verbs in continuous series, poses a particular problem for interpretation. Three hypotheses concerning the semantic composition of these serial verbs are considered and evaluated in terms of their distributional constraints. It is concluded that nondirectional motion can be lexicalized by either of two patterns [MOTION+MANNER] PATH or MOTION PATH ... MANNER, while directional motion allows only the single lexicalization pattern MANNER [MOTION+PATH]. Typologically, these reflect two of the incorporation patterns Talmy has identified as characteristic in languages of the world.

Download Full-text

Matching with Constraints

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence ◽

10.24963/ijcai.2019/921 ◽

2019 ◽

Author(s):

Zhaohong Sun

Keyword(s):

Affirmative Action ◽

School Choice ◽

Ad Hoc ◽

Real Life ◽

Efficient Algorithms ◽

Matching Theory ◽

Matching Markets ◽

Timely Manner ◽

Distributional Constraints ◽

New Challenges

In recent years, a number of new challenges have been observed in the application of matching theory. One of the most pressing problems concerns how to allocate refugees to hosts safely and in a timely manner. Currently, this placement is implemented on an ad hoc basis where the preferences of both refugees and hosts are not taken into account. Another important realization is that real-life matching markets are often subject to various distributional constraints. For example, there has been increased attention to school choice models that take account of affirmative action and diversity concerns. The objective of this research is to design efficient algorithms while satisfying desirable properties for these new emerging problems.

Download Full-text

Strategyproof and Fair Matching Mechanism for Union of Symmetric M-convex Constraints

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence ◽

10.24963/ijcai.2018/82 ◽

2018 ◽

Cited By ~ 1

Author(s):

Yuzhe Zhang ◽

Kentaro Yahiro ◽

Nathanaël Barrot ◽

Makoto Yokoo

Keyword(s):

Convex Sets ◽

Real Life ◽

Convex Constraints ◽

New Class ◽

Distributional Constraints ◽

Deferred Acceptance ◽

Matching Mechanism

In this paper, we identify a new class of distributional constraints defined as a union of symmetric M-convex sets, which can represent a variety of real-life constraints in two-sided matching settings. Since M-convexity is not closed under union, a union of symmetric M-convex sets does not belong to this well-behaved class of constraints in general. Thus, developing a fair and strategyproof mechanism that can handle this class is challenging. We present a novel mechanism called Quota Reduction Deferred Acceptance (QRDA), which repeatedly applies the standard DA mechanism by sequentially reducing artificially introduced maximum quotas. We show that QRDA is fair and strategyproof when handling a union of symmetric M-convex sets. Furthermore, in comparison to a baseline mechanism called Artificial Cap Deferred Acceptance (ACDA), QRDA always obtains a weakly better matching for students and, experimentally, performs better in terms of nonwastefulness.

Download Full-text