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

12.5%25.0%37.5%50.0% · Sep 199319922001200920182026
48 results for parallel sentence extraction

CURE extracts relations without supervision by clustering similar entity pairs.

problem Extracting relations unsupervised without considering sentence correlations.
method CURE uses Encoder-Decoder architecture for self-supervised learning and clustering similar relations.
result CURE outperforms state-of-the-art models on NYT and UNPC datasets.

Paper proposes a novel model to improve n-ary cross-sentence relation extraction by addressing noisy data and non-consecutive sentences.

problem Noisy labeled data and non-consecutive sentences in n-ary cross-sentence relation extraction.
method Two-level agent reinforcement learning model and hybrid attention mechanism/PCNN approach.
result The model reduces the impact of noisy data and achieves better performance.

This study improves sentence embeddings from BERT models.

problem Capturing the underlying meaning of sentences using BERT models.
method Comprehensive review and testing of various sentence embedding extraction and refinement methods.
result Representation-shaping techniques significantly improve sentence embeddings from BERT-based and simple baseline models.

Improves document summarization by combining word embeddings and n-grams.

problem Exact word matching fails to measure semantic similarity between sentences.
method Uses deep embedding features and tf-idf features to improve sentence similarity measure; builds an improved sentence similarity graph; employs a submodular objective function; develops a Transformer-based compression model.
result Outperforms tf-idf based approach and achieves state-of-the-art performance on DUC04 dataset.

This work tackles extractive compression by formulating it as tree transduction.

problem Extractive compression as a challenging natural language processing problem.
method Formulated as a parse tree transduction problem, using a deep neural model with Long Short-Term Memory extended to consider parent-child relationships.
result Achieves state-of-the-art performance on sentence compression benchmarks.

CGMH uses Metropolis-Hastings sampling to generate sentences with complex constraints.

problem Generating sentences with specific constraints while maintaining fluency and naturalness.
method CGMH employs Metropolis-Hastings sampling for constrained sentence generation.
result CGMH outperforms previous methods in various constrained sentence generation tasks.

Automates summarizing federal grant audits with machine learning.

problem Manual analysis of large federal grant audits is time-consuming and error-prone.
method Sentence clustering, k-means, proximity to centroids, human input for refinement.
result Automated summaries are comparable to human-generated ones using ROUGE metric.

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.

A new model improves relation extraction accuracy through relation-gated adversarial learning.

problem Relation extraction from sentences is challenging due to expensive human annotation and noisy distant supervision.
method Proposes relation-gated adversarial learning for relation extraction, extending domain adaptation methods.
result The model outperforms previous domain adaptation methods and improves accuracy of distance supervised relation extraction.

The paper improves ESG taxonomy and classifies sentences as sustainable or unsustainable.

problem Improving ESG taxonomy and classifying sentences based on ESG factors.
method For ESG taxonomy, used Sentence-BERT models. For sentence classification, combined RoBERTa with a multi-layer perceptron.
result Significant performance improvement and high accuracy in classifying sentences.

Hi-RES framework extracts medical relations from articles and EHRs.

problem Manual annotation bottleneck in relation extraction.
method Labeling sentences, creating improved negative samples, using pretrained language models, and combining EHR embeddings.
result Significant accuracy increases in relation extraction, up to 0.998 for disorder-location relations.

Proposes a new RNN for language generation capturing long-range dependencies.

problem Capturing long-range word dependencies and sentence order in text corpora.
method Recurrent Hierarchical Topic-Guided RNN with dynamic deep topic model.
result Outperforms larger-context RNN-based language models and learns interpretable topics.

A new method extracts events and their arguments efficiently from text.

problem Efficiently extract event information from texts with long-range dependencies and associations.
method Graph Convolutional Networks with shortest dependency paths to capture syntactic relationships.
result Significant improvement over state-of-the-art methods.

Systems rank PubMed abstracts and sentences for RDoC criteria, achieving high mAP and MAA.

problem Lack of RDoC labeled datasets and complex labelling process hinder full use of RDoC framework.
method Attention-based neural topic models, supervised and unsupervised sentence ranking models, BM25, BoW, TF-IDF.
result Best systems achieved 1st rank with 0.86 mAP and 0.58 MAA.

This paper classifies tweets into positive and negative sentiments using distributed word and sentence representations.

problem Classifying tweets into positive and negative sentiments.
method Used distributed representations of words and sentences, and LSTM and CNN networks for classification.
result Achieved accuracies as high as 81%.

This study analyzes financial equity research reports to identify frequently asked questions and automates 80% of them.

problem Insufficient empirical analysis of questions answered in financial equity research reports.
method Analyzed 72 financial equity research reports, classifying sentences into 169 unique question archetypes. Used public corporate reports to classify questions' potential for automation.
result Approximately 80% of financial equity research reports can be automated, with 78.7% of questions automatable.

Sequence learning improves query expansion in information retrieval.

problem Improving query expansion in information retrieval systems.
method Used sequence to sequence algorithms to extract keywords from sentence embeddings and trained a neural network on open datasets.
result Sequence to sequence models can capture complex query expansion relations in word embeddings.

CLIP dataset helps extract action items from hospital discharge notes.

problem Lost action items in long discharge notes hinder information sharing.
method Created CLIP dataset of annotated discharge notes, used multi-aspect extractive summarization, trained models on pre-trained language models and context.
result Best models improved by incorporating context and pre-trained language models.

A new method uses PSO to optimize sentence weights for user-oriented document summaries.

problem Handling information overload in documents through efficient summarization.
method Particle Swarm Optimization (PSO) to identify and weight sentence features.
result Improved accuracy in summarization compared to previous methods.

Extracts biological context from biomedical texts to associate with events.

problem Identifying biological context and associating it with biochemical events in texts.
method Analyzed an annotated corpus and developed classifiers using syntactic, distance, and frequency features.
result Developed and evaluated classifiers for context-event association.

Study of sentence representations in AI shows parallels to human learning.

problem Understanding how AI systems learn and generalize from training data.
method Diagnostic tests, performance analysis, training distribution effects, representation changes with augmentations.
result AI systems can learn abstract rules and generalize under certain conditions, similar to human zero-shot reasoning.

Paper introduces methods to automatically generate SOAP notes from patient-physician conversations.

problem Burden of creating digital SOAP notes by physicians.
method Cluster2Sent algorithm for summarizing patient-physician conversations.
result Cluster2Sent algorithm outperforms existing methods by 8 ROUGE-1 points.

ExpBERT uses natural language explanations to improve text interpretation.

problem Improving text interpretation for relation extraction tasks.
method Fine-tuning BERT on MultiNLI to interpret natural language explanations.
result ExpBERT matches a BERT baseline but requires less labeled data and improves performance.

Automatic summarisation is a popular approach to reduce a document to its main arguments. Recent research in the area has focused on neural approaches to summarisation, which can be very data-hungry. However, few large datasets exist and none for the traditionally popular domain of scientific publications, which opens …

2017-06-13abs ↗pdf ↗

Paper develops a new unsupervised scoring function for cross-lingual document alignment.

problem Aligning documents across different languages for NLP tasks.
method Uses cross-lingual sentence embeddings to compute semantic distances and guides document alignment.
result The proposed scoring function outperforms current methods by 7-22% on various language pairs.

Determinantal point processes (DPPs), which arise in random matrix theory and quantum physics, are natural models for subset selection problems where diversity is preferred. Among many remarkable properties, DPPs offer tractable algorithms for exact inference, including computing marginal probabilities and sampling; ho…

2012-02-14abs ↗pdf ↗

DSE learns sentence embeddings from cross-attention models to speed up sentence-pair similarity computation.

problem Computing sentence-pair similarity is computationally expensive when candidate sentences are large.
method Distilled Sentence Embedding (DSE) based on knowledge distillation from cross-attentive models.
result DSE significantly outperforms ELMO variants and other sentence embedding methods, accelerating computation by several orders of magnitude.