11 citations · 17 across the 12 of their papers we have counts for
13 papers
Improving Factual Error Correction for Abstractive Summarization via Data Distillation and Conditional-generation Cloze
Yiyang Li, Lei Li, Dingxin Hu +4
Improving factual consistency in abstractive summarization has been a focus of current research. One promising approach is the post-editing method. However, previous works have yet…
Just ClozE! A Novel Framework for Evaluating the Factual Consistency Faster in Abstractive Summarization
Yiyang Li, Lei Li, Marina Litvak +4
The issue of factual consistency in abstractive summarization has received extensive attention in recent years, and the evaluation of factual consistency between summary and docume…
Subjective Bias in Abstractive Summarization
Lei Li, Wei Liu, Marina Litvak +4
Due to the subjectivity of the summarization, it is a good practice to have more than one gold summary for each training document. However, many modern large-scale abstractive summ…
Automated Discovery of Mathematical Definitions in Text with Deep Neural Networks
Natalia Vanetik, Marina Litvak, Sergey Shevchuk +1
Automatic definition extraction from texts is an important task that has numerous applications in several natural language processing fields such as summarization, analysis of scie…
In Conclusion Not Repetition: Comprehensive Abstractive Summarization With Diversified Attention Based On Determinantal Point Processes
Lei Li, Wei Liu, Marina Litvak +2
Various Seq2Seq learning models designed for machine translation were applied for abstractive summarization task recently. Despite these models provide high ROUGE scores, they are…
Analyzing closed frequent itemsets with convex polytopes
Natalia Vanetik
Frequent itemsets form a polytope and can be found and analyzed with Linear Programming.
The classification problem for graphs and lattices is wild
Ruvim Lipyanski, Natalia Vanetik
We prove that the classification problem for graphs and several types of algebraic lattices (distributive, congruence and modular) up to isomorphism contains the classification pro…
On connection between division sequences and presentations of a free group
Natalia Vanetik
This paper describes a simple method for estimating lower bounds on the number of classes of equivalence for a special kind of integer sequences, called division sequences. The met…
Good characterization for path packing in a subclass of Karzanov networks
N. Vanetik
The path packing problem is stated finding the maximum number of edge-disjoint paths between predefined pairs of nodes in an undirected multigraph. Such a multigraph together with…
Computing the tree number of a cut-outerplanar graph
Natalia Vanetik
While the notion of arboricity of a graph is well-known in graph theory, very few results are dedicated to the minimal number of trees covering the edges of a graph, called the tre…
On a subclass of tame problems
N. Vanetik
In representation theory, the problem of classifying pairs of matrices up to simultaneous similarity is used as a measure of complexity; classification problems containing it are c…
On Borel complexity of the isomorphism problems for graph-related classes of Lie algebras and finite p-groups
Ruvim Lipyanski, Natalia Vanetik
We reduce the isomorphism problem for undirected graphs without loops to the isomorphism problems for a class of finite dimensional -step nilpotent Lie algebras over a field and…
On fractionality of the path packing problem
N. Vanetik
In this paper, we study fractional multiflows in undirected graphs. A fractional multiflow in a graph G with a node subset T, called terminals, is a collection of weighted paths wi…