Search Results for author:
Found 16 papers, 3 papers with code
Generalization Analysis on Learning with a Concurrent Verifier
In practical situations, it is natural to expect the input-output pairs of a machine learning model to satisfy some requirements.
Differentiable Inductive Logic Programming for Structured Examples
Our framework can be scaled to deal with complex programs that consist of several clauses with function symbols.
SpanAlign: Sentence Alignment Method based on Cross-Language Span Prediction and ILP
In particular, our method improved by +53. 9 F1 scores for extracting non-parallel sentences.
Bilingual Text Extraction as Reading Comprehension
We also conduct a sentence alignment experiment using En-Ja newspaper articles and find that the proposed method using multilingual BERT achieves significantly better accuracy than a baseline method using a bilingual dictionary and dynamic programming.
A Supervised Word Alignment Method based on Cross-Language Span Prediction using Multilingual BERT
For example, we achieved an F1 score of 86. 7 for the Chinese-English data, which is 13. 3 points higher than the previous state-of-the-art supervised methods.
Variable Shift SDD: A More Succinct Sentential Decision Diagram
We show that VS-SDDs are never larger than SDDs and there are cases in which the size of a VS-SDD is exponentially smaller than that of an SDD.
Recovery command generation towards automatic recovery in ICT systems by Seq2Seq learning
With the increase in scale and complexity of ICT systems, their operation increasingly requires automatic recovery from failures.
Metric Learning for Ordered Labeled Trees with pq-grams
In order to perform metric learning based on pq-grams, we propose a new differentiable parameterized distance, weighted pq-gram distance.
Generating Natural Anagrams: Towards Language Generation Under Hard Combinatorial Constraints
An anagram is a sentence or a phrase that is made by permutating the characters of an input sentence or a phrase.
Provable Fast Greedy Compressive Summarization with Any Monotone Submodular Function
This approach is known to have three advantages: its applicability to many useful submodular objective functions, the efficiency of the greedy algorithm, and the provable performance guarantee.
Oracle Summaries of Compressive Summarization
This paper derives an Integer Linear Programming (ILP) formulation to obtain an oracle summary of the compressive summarization paradigm in terms of ROUGE.
Enumeration of Extractive Oracle Summaries
To analyze the limitations and the future directions of the extractive summarization paradigm, this paper proposes an Integer Linear Programming (ILP) formulation to obtain extractive oracle summaries in terms of ROUGE-N. We also propose an algorithm that enumerates all of the oracle summaries for a set of reference summaries to exploit F-measures that evaluate which system summaries contain how many sentences that are extracted as an oracle summary.
Exploring Text Links for Coherent Multi-Document Summarization
Existing methods focus on the extraction of key information, but often neglect coherence.
