Iterative operations

0Citations
Citations of this article
61Readers
Mendeley users who have this article in their library.

Abstract

We present in this article, as a part of aspectual operation system, a generation system of iterative expressions using a set of operators called iterative operators. In order to execute the iterative operations efficiently, we have classified previously propositions denoting a single occurrence of a single event into three groupes. The definition of a single event is given recursively. The classification has been carried out especially in consideration of the dura-tive / non-durative character of the denoted events and also in consideration of existence / non-existence of a culmination point (or a boundary) in the events. The operations concerned with iteration have either the effect of giving a boundary to an event ( in the case of a non-bounded event) or of extending an event through repetitions. The operators concerned are: N,F .. direct iterative operators; I,G .. boundary giving operators; I .. extending operator. There are direct and indirect operations: the direct ones change a non-repetitious proposition into a repetitious one directly, whereas the indirect ones change it indirectly. The indirect iteration is indicated with S. The scope of each operator is not uniquely definable, though the mutual relation of the operators can be given more or less explicitly.

Cite

CITATION STYLE

APA

Yamada, S. (1983). Iterative operations. In 1st Conference of the European Chapter of the Association for Computational Linguistics, EACL 1983 - Proceedings (pp. 14–20). Association for Computational Linguistics (ACL). https://doi.org/10.3115/980092.980095

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free