Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,051 papers · 148 categories

Trend · papers per month

4285127169 · Jun 202019922001200920182026
48 results for phrase attention

NP2^2MT uses phrase attention to translate phrases efficiently.

problem Phrase-based machine translation inefficiency and performance degradation across different distributions.
method Phrase attention mechanism and dynamic programming for efficient decoding.
result NP2^2MT achieves comparable performance and outperforms state-of-the-art methods in certain conditions.

Model learns image-word associations from captions using contrastive learning.

problem Phrase grounding, associating image regions to caption words.
method Optimizing word-region attention to maximize mutual information, using language model guided word substitutions for negatives.
result Model achieves 76.7% accuracy on Flickr30K Entities benchmark, a 5.7% gain from weak supervision.

In this paper, we present Neural Phrase-based Machine Translation (NPMT). Our method explicitly models the phrase structures in output sequences using Sleep-WAke Networks (SWAN), a recently proposed segmentation-based sequence modeling method. To mitigate the monotonic alignment requirement of SWAN, we introduce a new …

2017-06-17abs ↗pdf ↗

Employers actively look for talents having not only specific hard skills but also various soft skills. To analyze the soft skill demands on the job market, it is important to be able to detect soft skill phrases from job advertisements automatically. However, a naive matching of soft skill phrases can lead to false pos…

2018-07-20abs ↗pdf ↗

Equivalence relations can be defined on Gauss phrases using combinatorial moves. In this paper we consider two closely related equivalence relations on Gauss phrases, homotopy and open homotopy. In particular, in each case, we define a new invariant and determine the values that it can attain.

2008-10-24abs ↗pdf ↗

Deep neural networks improve music phrase segmentation.

problem Automated melodic phrase detection and segmentation in music.
method Adapted various neural network architectures to symbolic music representation, addressing sparse labeling problem.
result CNN-CRF architecture performs best, offering finer segmentation and faster training.

V. Turaev introduced the theory of topology of words and phrases in 2005. This is a combinatorialy extension of the theory of virtual knots and links. In this paper we generalize the notion of homotopy of words and phrases and we give geometric meanings of the generalized homotopy of words. Moreover using the generaliz…

2009-08-20abs ↗pdf ↗

Out-of-vocabulary word translation is a major problem for the translation of low-resource languages that suffer from a lack of parallel training data. This paper evaluates the contributions of target-language context models towards the translation of OOV words, specifically in those cases where OOV translations are der…

2018-01-26abs ↗pdf ↗

Music relies heavily on repetition to build structure and meaning. Self-reference occurs on multiple timescales, from motifs to phrases to reusing of entire sections of music, such as in pieces with ABA structure. The Transformer (Vaswani et al., 2017), a sequence model based on self-attention, has achieved compelling …

2018-09-12abs ↗pdf ↗

Proposes a new neural network for text-dependent speaker verification.

problem Improves speaker verification by encoding phrase and speaker information.
method Uses differentiable alignment models to produce supervectors from utterances.
result Achieves competitive performance in text-dependent speaker verification tasks.

Unsupervised scheme ranks sentences in text documents based on semantic importance.

problem Ranking sentences in text documents without labeled data.
method Extracts essential words and phrases, constructs semantic phrase and sentence graphs, applies PageRank, combines scores, and optimizes for topic diversity.
result SSR outperforms individual judges and compares favorably with combined rankings on benchmarks.

Text2Node maps medical phrases to a taxonomy, overcoming coding standard limitations.

problem Limited data interchangeability between EHR systems due to different coding standards.
method Text2Node uses word and node embeddings, along with mapping functions, to generalize from limited training data.
result Text2Node achieves high accuracy in mapping phrases to a taxonomy, even for unseen concepts.

The weighted k-nearest neighbors algorithm is one of the most fundamental non-parametric methods in pattern recognition and machine learning. The question of setting the optimal number of neighbors as well as the optimal weights has received much attention throughout the years, nevertheless this problem seems to have r…

2017-01-25abs ↗pdf ↗

Neural machine translation aims at building a single large neural network that can be trained to maximize translation performance. The encoder-decoder architecture with an attention mechanism achieves a translation performance comparable to the existing state-of-the-art phrase-based systems on the task of English-to-Fr…

2016-08-16abs ↗pdf ↗

This paper improves neural network explanations by quantifying and visualizing semantic compositions.

problem Improving neural network explanations for natural language processing tasks.
method Proposes a formal way to quantify word and phrase importance, introduces SCD and SOC algorithms.
result Our algorithms outperform prior methods in explaining neural network predictions.

This new research explores the effects of various training methods on a Polish to English Statistical Machine Translation system for medical texts. Various elements of the EMEA parallel text corpora from the OPUS project were used as the basis for training of phrase tables and language models and for development, tunin…

2015-09-29abs ↗pdf ↗

Although deep learning models have proven effective at solving problems in natural language processing, the mechanism by which they come to their conclusions is often unclear. As a result, these models are generally treated as black boxes, yielding no insight of the underlying learned patterns. In this paper we conside…

2017-02-08abs ↗pdf ↗

In automatic speech recognition (ASR) what a user says depends on the particular context she is in. Typically, this context is represented as a set of word n-grams. In this work, we present a novel, all-neural, end-to-end (E2E) ASR sys- tem that utilizes such context. Our approach, which we re- fer to as Contextual Lis…

2018-08-07abs ↗pdf ↗

Study shows mutual information can reward structure learning agents without expert systems.

problem Designing rewards for structure learning agents in natural language environments.
method Revisited Information Theory of unsupervised induction of phrase-structure grammars, using random sets of linguistic samples.
result Empirical evidence that simulated semantic structures can be distinguished from random ones by mutual information among their constituents.

We investigate cobordisms of free knots. Free knots and links are also called homotopy classes of Gauss words and phrases. We define a new strong invariant of free knots which allows to detect free knots not cobordant to the trivial one.

2009-04-18abs ↗pdf ↗

Paper analyzes word embedding composition using tensor decomposition.

problem Given vector representations of two words, compute a vector for the entire phrase.
method Generative model with low rank Tucker decomposition of word embedding correlations.
result Word embeddings and a core tensor can be derived from the Tucker decomposition.

Objective: We investigate whether deep learning techniques for natural language processing (NLP) can be used efficiently for patient phenotyping. Patient phenotyping is a classification task for determining whether a patient has a medical condition, and is a crucial part of secondary analysis of healthcare data. We ass…

2017-03-25abs ↗pdf ↗

We introduce a graphical calculus for computing morphism spaces between the categorified spin networks of Cooper and Krushkal. The calculus, phrased in terms of planar compositions of categorified Jones-Wenzl projectors and their duals, is then used to study the module structure of spin networks over the colored unknot…

2012-09-12abs ↗pdf ↗

Improves medication name inference for telemedicine and conversational agents.

problem Challenges in mapping user-friendly medication names to standardized ones.
method Entity-boosted two-tower neural network for ranking SMN to DMP.
result State-of-the-art results achieved with improved attention-based ranking.

Proposes EM-HRNN model for better hierarchical language representation.

problem Learning hierarchical representations in natural language processing.
method Introduces latent indicator layer and EM algorithm for training.
result EM-HRNN model outperforms other RNN-based models in document classification.

A resolution of the St. Petersburg paradox is presented. In contrast to the standard resolution, utility is not required. Instead, the time-average performance of the lottery is computed. The final result can be phrased mathematically identically to Daniel Bernoulli's resolution, which uses logarithmic utility, but is …

2010-11-19abs ↗pdf ↗