English
Related papers

Related papers: Bracketing Encodings for 2-Planar Dependency Parsi…

200 papers

A 2-tree is a graph that can be formed by starting with a triangle and iterating the operation of making a new vertex adjacent to two adjacent vertices of the existing graph. Leizhen Cai asked in 1995 whether every maximal planar graph…

Combinatorics · Mathematics 2022-03-22 Allan Bickle

We explore whether it is possible to leverage eye-tracking data in an RNN dependency parser (for English) when such information is only available during training, i.e., no aggregated or token-level gaze features are used at inference time.…

Computation and Language · Computer Science 2019-09-04 Michalina Strzyz , David Vilares , Carlos Gómez-Rodríguez

We introduce an approach to train lexicalized parsers using bilingual corpora obtained by merging harmonized treebanks of different languages, producing parsers that can analyze sentences in either of the learned languages, or even…

Computation and Language · Computer Science 2016-05-20 David Vilares , Carlos Gómez-Rodríguez , Miguel A. Alonso

Different from other sequential data, sentences in natural language are structured by linguistic grammars. Previous generative conversational models with chain-structured decoder ignore this structure in human language and might generate…

Artificial Intelligence · Computer Science 2018-01-04 Ganbin Zhou , Ping Luo , Rongyu Cao , Yijun Xiao , Fen Lin , Bo Chen , Qing He

Several classification methods assume that the underlying distributions follow tree-structured graphical models. Indeed, trees capture statistical dependencies between pairs of variables, which may be crucial to attain low classification…

Machine Learning · Statistics 2021-05-31 Yaniv Tenzer , Amit Moscovich , Mary Frances Dorn , Boaz Nadler , Clifford Spiegelman

Sequence-to-sequence constituent parsing requires a linearization to represent trees as sequences. Top-down tree linearizations, which can be based on brackets or shift-reduce actions, have achieved the best accuracy to date. In this paper,…

Computation and Language · Computer Science 2020-05-28 Daniel Fernández-González , Carlos Gómez-Rodríguez

Unsupervised parsing, also known as grammar induction, aims to infer syntactic structure from raw text. Recently, binary representation has exhibited remarkable information-preserving capabilities at both lexicon and syntax levels. In this…

Computation and Language · Computer Science 2024-10-08 Yiran Wang , Masao Utiyama

Dependency syntax represents the structure of a sentence as a tree composed of dependencies, i.e., directed relations between lexical units. While in its more general form any such tree is allowed, in practice many are not plausible or are…

Computation and Language · Computer Science 2026-04-07 Gómez-Rodríguez , Carlos , Alemany-Puig , Lluís

Cross-lingual transfer is an effective way to build syntactic analysis tools in low-resource languages. However, transfer is difficult when transferring to typologically distant languages, especially when neither annotated target data nor…

Computation and Language · Computer Science 2021-04-30 Junxian He , Zhisong Zhang , Taylor Berg-Kirkpatrick , Graham Neubig

We propose a novel dependency-based hybrid tree model for semantic parsing, which converts natural language utterance into machine interpretable meaning representations. Unlike previous state-of-the-art models, the semantic information is…

Computation and Language · Computer Science 2018-09-05 Zhanming Jie , Wei Lu

Syntactic structure of a sentence text is correlated with the prosodic structure of the speech that is crucial for improving the prosody and naturalness of a text-to-speech (TTS) system. Nowadays TTS systems usually try to incorporate…

Computation and Language · Computer Science 2020-12-15 Changhe Song , Jingbei Li , Yixuan Zhou , Zhiyong Wu , Helen Meng

Eliciting preferences from human judgements is inherently imprecise, yet most decision analysis methods force a single priority vector from pairwise comparisons, discarding the information embedded in inconsistencies. We instead leverage…

General Economics · Economics 2026-02-27 Salvatore Greco , Sajid Siraj , Michele Lundy

In this paper, we survey some properties, encoding, and bijections involving combinatorial maps, double occurrence words, and chord diagrams. We particularly study quasi-trees from a purely combinatorial point of view and derive a…

Combinatorics · Mathematics 2022-11-16 Robert Cori , Yiting Jiang , Patrice Ossona de Mendez , Pierre Rosenstiehl

Discourse representation tree structure (DRTS) parsing is a novel semantic parsing task which has been concerned most recently. State-of-the-art performance can be achieved by a neural sequence-to-sequence model, treating the tree…

Computation and Language · Computer Science 2020-05-15 Qiankun Fu , Yue Zhang , Jiangming Liu , Meishan Zhang

Various treebanks have been released for dependency parsing. Despite that treebanks may belong to different languages or have different annotation schemes, they contain syntactic knowledge that is potential to benefit each other. This paper…

Computation and Language · Computer Science 2016-06-06 Jiang Guo , Wanxiang Che , Haifeng Wang , Ting Liu

Recent advancements in pre-trained language models (PLMs) have demonstrated that these models possess some degree of syntactic awareness. To leverage this knowledge, we propose a novel chart-based method for extracting parse trees from…

Computation and Language · Computer Science 2023-06-02 Jiaxi Li , Wei Lu

Syntactic dependency parsing is an important task in natural language processing. Unsupervised dependency parsing aims to learn a dependency parser from sentences that have no annotation of their correct parse trees. Despite its difficulty,…

Computation and Language · Computer Science 2020-10-06 Wenjuan Han , Yong Jiang , Hwee Tou Ng , Kewei Tu

Parsing is the process of analyzing a sentence's syntactic structure by breaking it down into its grammatical components. and is critical for various linguistic applications. Urdu is a low-resource, free word-order language and exhibits…

Computation and Language · Computer Science 2024-10-03 Nudrat Habib

Since the popularization of BiLSTMs and Transformer-based bidirectional encoders, state-of-the-art syntactic parsers have lacked incrementality, requiring access to the whole sentence and deviating from human language processing. This paper…

Computation and Language · Computer Science 2023-09-29 Ana Ezquerro , Carlos Gómez-Rodríguez , David Vilares

Most of the unsupervised dependency parsers are based on first-order probabilistic generative models that only consider local parent-child information. Inspired by second-order supervised dependency parsing, we proposed a second-order…

Computation and Language · Computer Science 2020-10-29 Songlin Yang , Yong Jiang , Wenjuan Han , Kewei Tu