English
Related papers

Related papers: Incremental Parsing with Minimal Features Using Bi…

200 papers

Recursive neural networks (RvNN) have been shown useful for learning sentence representations and helped achieve competitive performance on several natural language inference tasks. However, recent RvNN-based models fail to learn simple…

Computation and Language · Computer Science 2021-04-13 Atul Sahay , Ayush Maheshwari , Ritesh Kumar , Ganesh Ramakrishnan , Manjesh Kumar Hanawal , Kavi Arya

Characters have commonly been regarded as the minimal processing unit in Natural Language Processing (NLP). But many non-latin languages have hieroglyphic writing systems, involving a big alphabet with thousands or millions of characters.…

Computation and Language · Computer Science 2018-01-08 Han He , Lei Wu , Xiaokun Yang , Hua Yan , Zhimin Gao , Yi Feng , George Townsend

Most previous approaches to Chinese word segmentation formalize this problem as a character-based sequence labeling task where only contextual information within fixed sized local windows and simple interactions between adjacent tags can be…

Computation and Language · Computer Science 2016-12-05 Deng Cai , Hai Zhao

This paper presents a novel unifying framework of bilinear LSTMs that can represent and utilize the nonlinear interaction of the input features present in sequence datasets for achieving superior performance over a linear LSTM and yet not…

Machine Learning · Computer Science 2023-09-12 Mohit Rajpal , Bryan Kian Hsiang Low

This paper presents a new context-free parsing algorithm based on a bidirectional strictly horizontal strategy which incorporates strong top-down predictions (derivations and adjacencies). From a functional point of view, the parser is able…

cmp-lg · Computer Science 2007-05-23 Jose F. Quesada

Because of their superior ability to preserve sequence information over time, Long Short-Term Memory (LSTM) networks, a type of recurrent neural network with a more complex computational unit, have obtained strong results on a variety of…

Computation and Language · Computer Science 2015-06-02 Kai Sheng Tai , Richard Socher , Christopher D. Manning

Autoregressive transformer language models (LMs) possess strong syntactic abilities, often successfully handling phenomena from agreement to NPI licensing. However, the features they use to incrementally process language inputs are not well…

Computation and Language · Computer Science 2024-12-10 Michael Hanna , Aaron Mueller

Learning algorithms for natural language processing (NLP) tasks traditionally rely on manually defined relevant contextual features. On the other hand, neural network models using an only distributional representation of words have been…

Computation and Language · Computer Science 2017-11-30 Kushal Chawla , Sunil Kumar Sahu , Ashish Anand

This thesis provides methods and analysis of models which make progress on this goal. The techniques outlined are task agnostic, and should provide benefit when used with nearly any transformer LM. We introduce two new finetuning methods…

Computation and Language · Computer Science 2024-08-30 Davis Yoshida

The prevalent approach to neural machine translation relies on bi-directional LSTMs to encode the source sentence. In this paper we present a faster and simpler architecture based on a succession of convolutional layers. This allows to…

Computation and Language · Computer Science 2017-07-26 Jonas Gehring , Michael Auli , David Grangier , Yann N. Dauphin

Using token representation from bidirectional language models (LMs) such as BERT is still a widely used approach for token-classification tasks. Even though there exist much larger unidirectional LMs such as Llama-2, they are rarely used to…

Computation and Language · Computer Science 2024-12-11 Takumi Goto , Hiroyoshi Nagao , Yuta Koreeda

Recent latent tree learning models can learn constituency parsing without any exposure to human-annotated tree structures. One such model is ON-LSTM (Shen et al., 2019), which is trained on language modelling and has near-state-of-the-art…

Computation and Language · Computer Science 2020-10-13 Yian Zhang

Classical non-neural dependency parsers put considerable effort on the design of feature functions. Especially, they benefit from information coming from structural features, such as features drawn from neighboring tokens in the dependency…

Computation and Language · Computer Science 2019-06-05 Agnieszka Falenska , Jonas Kuhn

Autoregressive Large Language Models (LLMs) demonstrate exceptional performance in language understanding and generation. However, their application in text embedding tasks has been relatively slow, along with the analysis of their semantic…

Computation and Language · Computer Science 2025-10-03 Zhaoxin Feng , Jianfei Ma , Emmanuele Chersoni , Xiaojing Zhao , Xiaoyi Bao

Recurrent neural networks have become ubiquitous in computing representations of sequential data, especially textual data in natural language processing. In particular, Bidirectional LSTMs are at the heart of several neural models achieving…

Machine Learning · Computer Science 2018-09-12 Siddhartha Brahma

For both human readers and pre-trained language models (PrLMs), lexical diversity may lead to confusion and inaccuracy when understanding the underlying semantic meanings of given sentences. By substituting complex words with simple…

Computation and Language · Computer Science 2021-01-01 Rongzhou Bao , Jiayi Wang , Zhuosheng Zhang , Hai Zhao

A wide variety of neural-network architectures have been proposed for the task of Chinese word segmentation. Surprisingly, we find that a bidirectional LSTM model, when combined with standard deep learning techniques and best practices, can…

Computation and Language · Computer Science 2018-08-27 Ji Ma , Kuzman Ganchev , David Weiss

Data and knowledge representation are fundamental concepts in machine learning. The quality of the representation impacts the performance of the learning model directly. Feature learning transforms or enhances raw data to structures that…

Artificial Intelligence · Computer Science 2021-04-26 Filipe Alves Neto Verri , Renato Tinós , Liang Zhao

In this study, we propose a structured methodology that utilizes large language models (LLMs) in a cost-efficient and parsimonious manner, integrating the strengths of scholars and machines while offsetting their respective weaknesses. Our…

Computation and Language · Computer Science 2025-12-30 Navid Asgari , Benjamin M. Cole

This is a work-in-progress report, which aims to share preliminary results of a novel sequence-to-sequence schema for dependency parsing that relies on a combination of a BiLSTM and two Pointer Networks (Vinyals et al., 2015), in which the…

Computation and Language · Computer Science 2019-03-19 Matteo Grella