English
Related papers

Related papers: pyBART: Evidence-based Syntactic Transformations f…

200 papers

Recent advances in multilingual dependency parsing have brought the idea of a truly universal parser closer to reality. However, cross-language interference and restrained model capacity remain major obstacles. To address this, we propose a…

Computation and Language · Computer Science 2020-10-07 Ahmet Üstün , Arianna Bisazza , Gosse Bouma , Gertjan van Noord

Word ordering is a constrained language generation task taking unordered words as input. Existing work uses linear models and neural networks for the task, yet pre-trained language models have not been studied in word ordering, let alone…

Computation and Language · Computer Science 2022-10-31 Zebin Ou , Meishan Zhang , Yue Zhang

We target the task of cross-lingual Machine Reading Comprehension (MRC) in the direct zero-shot setting, by incorporating syntactic features from Universal Dependencies (UD), and the key features we use are the syntactic relations within…

Computation and Language · Computer Science 2022-03-17 Liyan Xu , Xuchao Zhang , Bo Zong , Yanchi Liu , Wei Cheng , Jingchao Ni , Haifeng Chen , Liang Zhao , Jinho D. Choi

Accurate processing of non-compositional language relies on generating good representations for such expressions. In this work, we study the representation of language non-compositionality by proposing a language model, PIER, that builds on…

Computation and Language · Computer Science 2023-10-31 Ziheng Zeng , Suma Bhat

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

The utility of linguistic annotation in neural machine translation seemed to had been established in past papers. The experiments were however limited to recurrent sequence-to-sequence architectures and relatively small data settings. We…

Computation and Language · Computer Science 2019-10-25 Thuong-Hai Pham , Dominik Macháček , Ondřej Bojar

We reduce the task of (span-based) PropBank-style semantic role labeling (SRL) to syntactic dependency parsing. Our approach is motivated by our empirical analysis that shows three common syntactic patterns account for over 98% of the SRL…

Computation and Language · Computer Science 2020-10-22 Tianze Shi , Igor Malioutov , Ozan İrsoy

Knowledge-enhanced pre-trained models for language representation have been shown to be more effective in knowledge base construction tasks (i.e.,~relation extraction) than language models such as BERT. These knowledge-enhanced language…

Computation and Language · Computer Science 2022-10-25 Jiacheng Li , Yannis Katsis , Tyler Baldwin , Ho-Cheol Kim , Andrew Bartko , Julian McAuley , Chun-Nan Hsu

This paper presents a novel treebank-driven approach to comparing syntactic structures in speech and writing using dependency-parsed corpora. Adopting a fully inductive, bottom-up method, we define syntactic structures as delexicalized…

Computation and Language · Computer Science 2026-02-24 Kaja Dobrovoljc

Relation Extraction (RE) is one of the fundamental tasks in Information Extraction and Natural Language Processing. Dependency trees have been shown to be a very useful source of information for this task. The current deep learning models…

Computation and Language · Computer Science 2019-07-09 Amir Pouran Ben Veyseh , Thien Huu Nguyen , Dejing Dou

The objective of Information Extraction (IE) is to derive structured representations from unstructured or semi-structured documents. However, developing IE models is complex due to the need of integrating several subtasks. Additionally,…

Information Retrieval · Computer Science 2024-06-04 Arne Binder , Leonhard Hennig , Christoph Alt

Bayesian Additive Regression Trees (BART) is a tree-based machine learning method that has been successfully applied to regression and classification problems. BART assumes regularisation priors on a set of trees that work as weak learners…

Machine Learning · Statistics 2022-06-07 Estevão B. Prado , Rafael A. Moral , Andrew C. Parnell

Using ensemble methods for regression has been a large success in obtaining high-accuracy prediction. Examples are Bagging, Random forest, Boosting, BART (Bayesian additive regression tree), and their variants. In this paper, we propose a…

Machine Learning · Computer Science 2019-11-06 Yuhao Su , Jie Ding

Structural probes learn a linear transformation to find how dependency trees are embedded in the hidden states of language models. This simple design may not allow for full exploitation of the structure of the encoded information. Hence, to…

Computation and Language · Computer Science 2024-02-27 Avik Pal , Madhura Pawar

The paper investigates the use of richer syntactic dependencies in the structured language model (SLM). We present two simple methods of enriching the dependencies in the syntactic parse trees used for intializing the SLM. We evaluate the…

Computation and Language · Computer Science 2007-05-23 Ciprian Chelba , Peng Xu

We present a generic framework for data augmentation via dependency subtree swapping that is applicable to machine translation. We extract corresponding subtrees from the dependency parse trees of the source and target sentences and swap…

Computation and Language · Computer Science 2023-07-17 Attila Nagy , Dorina Petra Lakatos , Botond Barta , Patrick Nanys , Judit Ács

We consider the problem of making expressive static analyzers interactive. Formal static analysis is seeing increasingly widespread adoption as a tool for verification and bug-finding, but even with powerful cloud infrastructure it can take…

Programming Languages · Computer Science 2021-04-08 Benno Stein , Bor-Yuh Evan Chang , Manu Sridharan

Most of the syntax-based metrics obtain the similarity by comparing the sub-structures extracted from the trees of hypothesis and reference. These sub-structures are defined by human and can't express all the information in the trees…

Computation and Language · Computer Science 2016-11-07 Hui Yu , Xiaofeng Wu , Wenbin Jiang , Qun Liu , ShouXun Lin

Most neural machine translation (NMT) models are based on the sequential encoder-decoder framework, which makes no use of syntactic information. In this paper, we improve this model by explicitly incorporating source-side syntactic trees.…

Computation and Language · Computer Science 2017-07-19 Huadong Chen , Shujian Huang , David Chiang , Jiajun Chen

The Universal Dependencies (UD) project has created an invaluable collection of treebanks with contributions in over 140 languages. However, the UD annotations do not tell the full story. Grammatical constructions that convey meaning…

‹ Prev 1 4 5 6 7 8 10 Next ›