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.

168,695 papers · 148 categories

Trend · papers per month

591418 · Nov 201919922001200920172026
48 results for Textual Parsing

Survey on automating geometry problem solving with large models.

problem Automating geometric problem solving with spatial understanding and logical reasoning.
method Synthesizes GPS advancements through benchmark construction, parsing, and reasoning paradigms.
result Unified analytical paradigm and emerging opportunities identified.

Human communication takes many forms, including speech, text and instructional videos. It typically has an underlying structure, with a starting point, ending, and certain objective steps between them. In this paper, we consider instructional videos where there are tens of millions of them on the Internet. We propose a…

2016-05-11abs ↗pdf ↗

Typical spoken language understanding systems provide narrow semantic parses using a domain-specific ontology. The parses contain intents and slots that are directly consumed by downstream domain applications. In this work we discuss expanding such systems to handle compound entities and intents by introducing a domain…

2018-10-26abs ↗pdf ↗

This paper explores unsupervised learning of parsing models along two directions. First, which models are identifiable from infinite data? We use a general technique for numerically checking identifiability based on the rank of a Jacobian matrix, and apply it to several standard constituency and dependency parsing mode…

2012-06-14abs ↗pdf ↗

We propose a method for non-projective dependency parsing by incrementally predicting a set of edges. Since the edges do not have a pre-specified order, we propose a set-based learning method. Our method blends graph, transition, and easy-first parsing, including a prior state of the parser as a special case. The propo…

2019-05-27abs ↗pdf ↗

System detects financial forecasts in tweets, achieving high precision.

problem Detecting financial forecasts in social media messages.
method Natural Language Processing and Machine Learning techniques for real-time analysis.
result Achieves over 90% precision for financial forecasts.

The emergence of structured databases for Question Answering (QA) systems has led to developing methods, in which the problem of learning the correct answer efficiently is based on a linking task between the constituents of the question and the corresponding entries in the database. As a result, parsing the questions i…

2019-09-27abs ↗pdf ↗

Domain-general semantic parsing is a long-standing goal in natural language processing, where the semantic parser is capable of robustly parsing sentences from domains outside of which it was trained. Current approaches largely rely on additional supervision from new domains in order to generalize to those domains. We …

2016-06-20abs ↗pdf ↗

Graph-to-Tree Neural Networks improve structured input-output translation in tasks like semantic parsing and math word problems.

problem Improving performance on tasks like semantic parsing and math word problem solving.
method Graph-to-Tree Neural Networks, consisting of a graph encoder and a hierarchical tree decoder.
result Graph2Tree model outperforms or matches state-of-the-art models on neural semantic parsing and math word problem tasks.

Deep models learn to parse complex language structures from local data patterns.

problem Understanding how deep models parse and represent language structures.
method Introduced tunable probabilistic context-free grammars and a learning algorithm inspired by deep networks.
result Data correlations across scales enable hierarchical language representations.

Synthetic reference strings are as effective as real ones for training citation parsing models.

problem Lack of training data for citation parsing, especially with deep neural networks.
method Trained Grobid with human-labelled and synthetically created reference strings, and evaluated retraining and out-of-sample data impact.
result Synthetic and real reference strings are equally effective for training Grobid, with retraining improving performance.

We aim to model unknown file processing. As the content of log files often evolves over time, we established a dynamic statistical model which learns and adapts processing and parsing rules. First, we limit the amount of unstructured text by focusing only on those frequent patterns which lead to the desired output tabl…

2020-01-05abs ↗pdf ↗

Translating renderings (e. g. PDFs, scans) into hierarchical document structures is extensively demanded in the daily routines of many real-world applications. However, a holistic, principled approach to inferring the complete hierarchical structure of documents is missing. As a remedy, we developed "DocParser": an end…

2019-11-05abs ↗pdf ↗

Tasks like code generation and semantic parsing require mapping unstructured (or partially structured) inputs to well-formed, executable outputs. We introduce abstract syntax networks, a modeling framework for these problems. The outputs are represented as abstract syntax trees (ASTs) and constructed by a decoder with …

2017-04-25abs ↗pdf ↗

Co-PLNet combines point and line predictions to improve wireframe parsing accuracy and efficiency.

problem Separate line and point predictions lead to inconsistent wireframes.
method Co-PLNet uses a Point-Line Prompt Encoder to convert early point detections into spatial prompts, which guide line refinement.
result Co-PLNet achieves better accuracy and robustness in wireframe parsing compared to existing methods.

In this paper, we propose a probabilistic parsing model, which defines a proper conditional probability distribution over non-projective dependency trees for a given sentence, using neural representations as inputs. The neural network architecture is based on bi-directional LSTM-CNNs which benefits from both word- and …

2017-01-04abs ↗pdf ↗

We introduce a multimodal visual-textual search refinement method for fashion garments. Existing search engines do not enable intuitive, interactive, refinement of retrieved results based on the properties of a particular product. We propose a method to retrieve similar items, based on a query item image and textual re…

2019-06-15abs ↗pdf ↗

Complex textual information extraction tasks are often posed as sequence labeling or \emph{shallow parsing}, where fields are extracted using local labels made consistent through probabilistic inference in a graphical model with constrained transitions. Recently, it has become common to locally parametrize these models…

2018-09-28abs ↗pdf ↗

While neural networks have shown impressive performance on large datasets, applying these models to tasks where little data is available remains a challenging problem. In this paper we propose to use feature transfer in a zero-shot experimental setting on the task of semantic parsing. We first introduce a new method fo…

2018-08-27abs ↗pdf ↗

The paper proposes a new recommender system combining ratings and textual reviews.

problem Lack of using textual reviews in recommender systems.
method Combines Latent Factor Model with Latent Dirichlet Allocation for textual reviews.
result Combining textual reviews with ratings improves recommendation quality.

Scene parsing is an important and challenging prob- lem in computer vision. It requires labeling each pixel in an image with the category it belongs to. Tradition- ally, it has been approached with hand-engineered features from color information in images. Recently convolutional neural networks (CNNs), which automatica…

2014-11-15abs ↗pdf ↗

Examines parallels between human subjects and texts for causal inference.

problem Ambiguity and fallacies in causal inference using textual data.
method Two strategies: shifting from traits to perceptions and from concepts to parts.
result Highlights the importance of clarifying fundamental concepts.

Proposes Textual Echo Cancellation to improve speech recognition.

problem Improving speech recognition performance and user experience for smart devices.
method A novel sequence-to-sequence model with multi-source attention that processes both the microphone mixture signal and source text of TTS playback.
result Demonstrates enhanced speech recognition performance and reduced latency.

Sequence to sequence learning has recently emerged as a new paradigm in supervised learning. To date, most of its applications focused on only one task and not much work explored this framework for multiple tasks. This paper examines three multi-task learning (MTL) settings for sequence to sequence models: (a) the onet…

2015-11-19abs ↗pdf ↗

Program synthesis of general-purpose source code from natural language specifications is challenging due to the need to reason about high-level patterns in the target program and low-level implementation details at the same time. In this work, we present PATOIS, a system that allows a neural program synthesizer to expl…

2019-06-26abs ↗pdf ↗

Textual network embedding aims to learn low-dimensional representations of text-annotated nodes in a graph. Prior work in this area has typically focused on fixed graph structures; however, real-world networks are often dynamic. We address this challenge with a novel end-to-end node-embedding model, called Dynamic Embe…

2019-10-05abs ↗pdf ↗

Framework for universal graph function approximators outperforms existing methods.

problem Graph classification and separation of graph classes.
method Inspired by persistent homology, dependency parsing, and multivalued functions, the framework constructs universal approximators on graph isomorphism classes.
result Achieves state-of-the-art performance on four graph datasets.

A new framework predicts stock movements using news sentiment and relational data.

problem Predicting stock prices from textual information is challenging due to market uncertainty and natural language complexity.
method Multi-Graph Recurrent Network (MGRN) combining textual sentiment from financial news and relational data.
result The model outperforms benchmarks in predicting stock movements.

Recurrent neural network grammars (RNNG) are generative models of language which jointly model syntax and surface structure by incrementally generating a syntax tree and sentence in a top-down, left-to-right order. Supervised RNNGs achieve strong language modeling and parsing performance, but require an annotated corpu…

2019-04-07abs ↗pdf ↗

Syntactic constituency parsing is a fundamental problem in natural language processing and has been the subject of intensive research and engineering for decades. As a result, the most accurate parsers are domain specific, complex, and inefficient. In this paper we show that the domain agnostic attention-enhanced seque…

2014-12-23abs ↗pdf ↗

New model uses financial filings to predict bankruptcy, even without MDA sections.

problem Lack of complete MDA data limits traditional bankruptcy prediction models.
method Conditional Multimodal Discriminative (CMMD) model learns from accounting, market, and textual data.
result Empirical results show superior classification performance compared to traditional models.

Surveying machine learning methods for economic forecasting.

problem Improving accuracy of economic forecasts using machine learning.
method Nowcasting, textual data, panel and tensor data, high-dimensional Granger causality tests, time series cross-validation, classification with economic losses.
result Recent advances in machine learning methods enhance economic forecasting accuracy.

Effective detection of fake news has recently attracted significant attention. Current studies have made significant contributions to predicting fake news with less focus on exploiting the relationship (similarity) between the textual and visual information in news articles. Attaching importance to such similarity help…

2020-02-19abs ↗pdf ↗

Paper introduces a benchmark for predicting bankruptcy from text data.

problem Lack of a common benchmark dataset and evaluation strategy for unstructured data in bankruptcy prediction.
method Describes and evaluates several baseline models, including a bag-of-words model.
result A lightweight bag-of-words model performs surprisingly well, especially when considering data from multiple years.

MoleculeSTM learns from molecule structures and texts for better drug design.

problem Lack of integration between chemical structures and textual knowledge in AI drug discovery.
method Jointly learns chemical structures and texts via contrastive learning, using a large dataset.
result MoleculeSTM achieves state-of-the-art performance in zero-shot tasks like structure-text retrieval and molecule editing.

Deep generative models have been wildly successful at learning coherent latent representations for continuous data such as video and audio. However, generative modeling of discrete data such as arithmetic expressions and molecular structures still poses significant challenges. Crucially, state-of-the-art methods often …

2017-03-06abs ↗pdf ↗

An integrated approach is proposed across visual and textual data to both determine and justify a medical diagnosis by a neural network. As deep learning techniques improve, interest grows to apply them in medical applications. To enable a transition to workflows in a medical context that are aided by machine learning,…

2019-07-12abs ↗pdf ↗

Textual network embedding leverages rich text information associated with the network to learn low-dimensional vectorial representations of vertices. Rather than using typical natural language processing (NLP) approaches, recent research exploits the relationship of texts on the same edge to graphically embed text. How…

2018-05-24abs ↗pdf ↗

Algorithm reduces audit costs by identifying best service configurations from biased textual evidence.

problem Designing service systems from textual evidence requires accurate selection despite biased automated scoring.
method Developed PP-LUCB algorithm combining LLM scores and selective audits to minimize costs.
result Correctly identified the best model in 40/40 trials with 90% cost reduction.