Leonid Mityushin - Academia.edu (original) (raw)
Related Authors
University of the Basque Country, Euskal Herriko Unibertsitatea
University of Illinois at Urbana-Champaign
Uploads
Papers by Leonid Mityushin
Problems of Information Transmission, Jul 1, 2013
We consider a growing set U of segments with integer endpoints on a line. For every pair of adjac... more We consider a growing set U of segments with integer endpoints on a line. For every pair of adjacent segments, their union is added to U with probability q. At the beginning, U contains all segments of length from 1 to m. Let h n be the probability that the segment [a, a + n] will be created; the critical value q c (m) is defined as sup{q | lim nāā h n = 0}. Lower and upper bounds for q c (m) are obtained.
Theory of Probability and Its Applications, Dec 1, 1988
Siberian Mathematical Journal, 1986
RePEc: Research Papers in Economics, 1978
The paper presents the module of interactive word sense disambiguation and syntactic ambiguity re... more The paper presents the module of interactive word sense disambiguation and syntactic ambiguity resolution used within a machine translation system, ETAP-3. The method applied consists in asking the user to identify a word sense, or a syntactic interpretation, whenever the system lacks reliable data to make the choice automatically. In lexical disambiguation, part of man-machine dialogue refers to the analysis phase, while the other part is activated during transfer. For this purpose, entries of the working dictionaries of the system are supplemented with clear diagnostic comments and illustrations that enable the user to choose the most appropriate option and in this way channel the course of system operation.
We formulate a simple necessary and sufficient condition of monotonicity of a consumer's dema... more We formulate a simple necessary and sufficient condition of monotonicity of a consumer's demand function in terms of the first and second derivatives of the consumer's utility function.
Experiments have been carried out in which human subjects incrementally constructed dependency tr... more Experiments have been carried out in which human subjects incrementally constructed dependency trees of English sentences. The subjects were successively presented with growing initial segments of a sentence, and had to draw syntactic links between the last word of the segment and the previous words. They were also shown a fixed number of lookahead words following the last word of the segment. The results of the experiments show that lookahead of 1 or 2 words is sufficient for confident incremental parsing of English declarative sentences.
Proceedings of the Fifth International Conference on Dependency Linguistics (Depling, SyntaxFest 2019)
Problemy Peredachi Informatsii
Lecture Notes in Computer Science, 2005
Theory of Probability & Its Applications, 1988
Siberian Mathematical Journal, 1986
Problems of Information Transmission, 2013
Problems of Information Transmission, 2013
Problems of Information Transmission, Jul 1, 2013
We consider a growing set U of segments with integer endpoints on a line. For every pair of adjac... more We consider a growing set U of segments with integer endpoints on a line. For every pair of adjacent segments, their union is added to U with probability q. At the beginning, U contains all segments of length from 1 to m. Let h n be the probability that the segment [a, a + n] will be created; the critical value q c (m) is defined as sup{q | lim nāā h n = 0}. Lower and upper bounds for q c (m) are obtained.
Theory of Probability and Its Applications, Dec 1, 1988
Siberian Mathematical Journal, 1986
RePEc: Research Papers in Economics, 1978
The paper presents the module of interactive word sense disambiguation and syntactic ambiguity re... more The paper presents the module of interactive word sense disambiguation and syntactic ambiguity resolution used within a machine translation system, ETAP-3. The method applied consists in asking the user to identify a word sense, or a syntactic interpretation, whenever the system lacks reliable data to make the choice automatically. In lexical disambiguation, part of man-machine dialogue refers to the analysis phase, while the other part is activated during transfer. For this purpose, entries of the working dictionaries of the system are supplemented with clear diagnostic comments and illustrations that enable the user to choose the most appropriate option and in this way channel the course of system operation.
We formulate a simple necessary and sufficient condition of monotonicity of a consumer's dema... more We formulate a simple necessary and sufficient condition of monotonicity of a consumer's demand function in terms of the first and second derivatives of the consumer's utility function.
Experiments have been carried out in which human subjects incrementally constructed dependency tr... more Experiments have been carried out in which human subjects incrementally constructed dependency trees of English sentences. The subjects were successively presented with growing initial segments of a sentence, and had to draw syntactic links between the last word of the segment and the previous words. They were also shown a fixed number of lookahead words following the last word of the segment. The results of the experiments show that lookahead of 1 or 2 words is sufficient for confident incremental parsing of English declarative sentences.
Proceedings of the Fifth International Conference on Dependency Linguistics (Depling, SyntaxFest 2019)
Problemy Peredachi Informatsii
Lecture Notes in Computer Science, 2005
Theory of Probability & Its Applications, 1988
Siberian Mathematical Journal, 1986
Problems of Information Transmission, 2013
Problems of Information Transmission, 2013