LibreTimes

Search results for “number-theory”

98 results

Reranking Hypotheses in Translation Models Using Human Markup

2024Journal articleK. V. Vorontsov, N. A. Skachkov

Journal of Computer and Systems Sciences International

Modern machine translation systems are trained on large volumes of parallel data obtained using heuristic methods of bypassing the Internet. The poor quality of the data leads to systematic translation errors, which can be quite noticeable to humans. To fix such errors, human-based models for reranking hypotheses is introduced in this study. In this paper the use of human markup is shown not only to increase the overall quality of the translation but also to significantly reduce the number of systematic translation errors. In addition, the relative simplicity of human markup and its integration in the model training process opens up new opportunities in the field of domain adaptation of translation models for new domains like online retail.
0
6

Hypotheses re-ranking in translation models using human markup

2024Journal articleK. V. Vorontsov, N. A. Skachkov

Известия Российской академии наук Теория и системы управления

Modern machine translation systems are trained on large volumes of parallel data obtained using heuristic methods of the Internet bypassing. The poor quality of the data leads to systematic translation errors, which can be quite noticeable from the human point of view. To fix such errors a human based models hypotheses re-ranking is introduced in this work. In this paper the use of human markup is shown not only to increase the overall quality of translation, but also to significantly reduce the number of systematic translation errors. In addition, the relative simplicity of human markup and its integration in the model training process opens up new opportunities in the field of domain adaptation of translation models for new domains like online retail.
0
2

Regularized Multimodal Hierarchical Topic Model for Document-by-Document Exploratory Search

2019Conference paperAnastasia Ianina, Konstantin Vorontsov

In the exploratory search paradigm of information retrieval, the user has a complicated search demand that can not be formulated in a short query. The user collects thematically relevant information iteratively in a “query-browse-refine” process being motivated by learning, understanding, and knowledge acquisition purposes. We consider an elementary step of this scenario in which the search intent can be expressed by a long text query. For this case, we develop an exploratory search engine based on probabilistic topic modeling. Topic model gives a low-dimensional sparse interpretable vector representation (topical embedding) of a text. The search engine uses these embeddings for ranking documents by their similarity to the query. We show that performing only one query, the topic-based search engine achieves better precision and recall that human assessors do spending up to one hour in a conventional browse-refine loop. We use additive regularization for topic modeling (ARTM) to make the model simultaneously sparse, decorrelated, n-gram, multimodal and hierarchical. We show experimentally that each of these features of the model is important to achieve precision and recall higher than 90
0
4

IMO 1962

2026Problem sheet

International mathematics competition for pre-university students, held annually since 1959. Six problems over two days.
0
340

IMO 1987

2026Problem sheet

International mathematics competition for pre-university students, held annually since 1959. Six problems over two days.
0
290

IMO 1959

2026Problem sheet

International mathematics competition for pre-university students, held annually since 1959. Six problems over two days.
0
310

IMO 1969

2026Problem sheet

International mathematics competition for pre-university students, held annually since 1959. Six problems over two days.
0
280

IMO 1971

2026Problem sheet

International mathematics competition for pre-university students, held annually since 1959. Six problems over two days.
0
180

Basic Operations on Matrices

2026TheorySergey

Addition, scalar multiplication, transposition and multiplication of matrices, along with subtraction, powers, and trace.
0
150

IMO 1961

2026Problem sheet

International mathematics competition for pre-university students, held annually since 1959. Six problems over two days.
0
240

IMO 1966

2026Problem sheet

International mathematics competition for pre-university students, held annually since 1959. Six problems over two days.
0
190

IMO 1970

2026Problem sheet

International mathematics competition for pre-university students, held annually since 1959. Six problems over two days.
0
190

IMO 1974

2026Problem sheet

International mathematics competition for pre-university students, held annually since 1959. Six problems over two days.
0
250

IMO 1976

2026Problem sheet

International mathematics competition for pre-university students, held annually since 1959. Six problems over two days.
0
260

IMO 1977

2026Problem sheet

International mathematics competition for pre-university students, held annually since 1959. Six problems over two days.
0
260

IMO 1981

2026Problem sheet

International mathematics competition for pre-university students, held annually since 1959. Six problems over two days.
0
220

IMO 1984

2026Problem sheet

International mathematics competition for pre-university students, held annually since 1959. Six problems over two days.
0
150

IMO 1985

2026Problem sheet

International mathematics competition for pre-university students, held annually since 1959. Six problems over two days.
0
120

IMO 1991

2026Problem sheet

International mathematics competition for pre-university students, held annually since 1959. Six problems over two days.
0
350

IMO 1998

2026Problem sheet

International mathematics competition for pre-university students, held annually since 1959. Six problems over two days.
0
430