English
Related papers

Related papers: Refining Syntactic Distinctions Using Decision Tre…

200 papers

We describe a cross-lingual transfer method for dependency parsing that takes into account the problem of word order differences between source and target languages. Our model only relies on the Bible, a considerably smaller parallel data…

Computation and Language · Computer Science 2019-03-15 Mohammad Sadegh Rasooli , Michael Collins

We describe a cross-lingual adaptation method based on syntactic parse trees obtained from the Universal Dependencies (UD), which are consistent across languages, to develop classifiers in low-resource languages. The idea of UD parsing is…

Computation and Language · Computer Science 2020-03-31 Nasrin Taghizadeh , Heshaam Faili

Despite the impressive growth of the abilities of multilingual language models, such as XLM-R and mT5, it has been shown that they still face difficulties when tackling typologically-distant languages, particularly in the low-resource…

Computation and Language · Computer Science 2023-10-23 Ofir Arviv , Dmitry Nikolaev , Taelin Karidi , Omri Abend

Recursive neural networks (Tree-RNNs) based on dependency trees are ubiquitous in modeling sentence meanings as they effectively capture semantic relationships between non-neighborhood words. However, recognizing semantically dissimilar…

Computation and Language · Computer Science 2022-01-14 Jeena Kleenankandy , K A Abdul Nazeer

Data augmentation methods for neural machine translation are particularly useful when limited amount of training data is available, which is often the case when dealing with low-resource languages. We introduce a novel augmentation method,…

Computation and Language · Computer Science 2023-11-07 Attila Nagy , Dorina Lakatos , Botond Barta , Judit Ács

In creating sentence embeddings for Natural Language Inference (NLI) tasks, using transformer-based models like BERT leads to high accuracy, but require hundreds of millions of parameters. These models take in sentences as a sequence of…

Computation and Language · Computer Science 2025-12-17 Jason Lunder

We discuss two constructions (long scrambling and ECM verbs) which challenge most syntactic theories (including traditional TAG approaches) since they seem to require exceptional mechanisms and postulates. We argue that these constructions…

cmp-lg · Computer Science 2008-02-03 Anthony Kroch , Owen Rambow

We introduce Transformer Grammars (TGs), a novel class of Transformer language models that combine (i) the expressive power, scalability, and strong performance of Transformers and (ii) recursive syntactic compositions, which here are…

Computation and Language · Computer Science 2022-12-07 Laurent Sartran , Samuel Barrett , Adhiguna Kuncoro , Miloš Stanojević , Phil Blunsom , Chris Dyer

CHILDES is a paramount resource for language acquisition studies -- yet computational tools for analyzing its syntactic structure remain limited. Leveraging the recent release of the UD-English-CHILDES treebank with gold-standard Universal…

Computation and Language · Computer Science 2026-05-20 Francesca Padovani , Xiulin Yang , Bastian Bunzeck , Jaap Jumelet , Yevgen Matusevych , Nathan Schneider , Arianna Bisazza

This paper presents our submission to Task 1, Subjectivity Detection, of the CheckThat! Lab at CLEF 2025. We investigate the effectiveness of transfer-learning and stylistic data augmentation to improve classification of subjective and…

Computation and Language · Computer Science 2025-07-09 Maximilian Heil , Dionne Bang

Latent tree learning models represent sentences by composing their words according to an induced parse tree, all based on a downstream task. These models often outperform baselines which use (externally provided) syntax trees to drive the…

Computation and Language · Computer Science 2020-01-16 Jean Maillard , Stephen Clark

We present Ditto, a novel entity matching system based on pre-trained Transformer-based language models. We fine-tune and cast EM as a sequence-pair classification problem to leverage such models with a simple architecture. Our experiments…

Databases · Computer Science 2020-09-04 Yuliang Li , Jinfeng Li , Yoshihiko Suhara , AnHai Doan , Wang-Chiew Tan

This paper describes our submission to the First Workshop on Reordering for Statistical Machine Translation. We have decided to build a reordering system based on tree-to-string model, using only publicly available tools to accomplish this…

Computation and Language · Computer Science 2013-02-14 Jacob Dlougach , Irina Galinskaya

The end-to-end TTS, which can predict speech directly from a given sequence of graphemes or phonemes, has shown improved performance over the conventional TTS. However, its predicting capability is still limited by the acoustic/phonetic…

Computation and Language · Computer Science 2019-04-10 Haohan Guo , Frank K. Soong , Lei He , Lei Xie

We study the problem of leveraging the syntactic structure of text to enhance pre-trained models such as BERT and RoBERTa. Existing methods utilize syntax of text either in the pre-training stage or in the fine-tuning stage, so that they…

Computation and Language · Computer Science 2021-06-01 Zenan Xu , Daya Guo , Duyu Tang , Qinliang Su , Linjun Shou , Ming Gong , Wanjun Zhong , Xiaojun Quan , Nan Duan , Daxin Jiang

Cross-linguistically, native words and loanwords follow different phonological rules. In English, for example, words of Germanic and Latinate origin exhibit different stress patterns, and a certain syntactic structure, double-object…

Computation and Language · Computer Science 2026-02-09 Takashi Morita , Timothy J. O'Donnell

We study the problem of analyzing tweets with Universal Dependencies. We extend the UD guidelines to cover special constructions in tweets that affect tokenization, part-of-speech tagging, and labeled dependencies. Using the extended…

Computation and Language · Computer Science 2018-04-24 Yijia Liu , Yi Zhu , Wanxiang Che , Bing Qin , Nathan Schneider , Noah A. Smith

Syntactic Transformer language models aim to achieve better generalization through simultaneously modeling syntax trees and sentences. While prior work has been focusing on adding constituency-based structures to Transformers, we introduce…

Computation and Language · Computer Science 2024-07-25 Yida Zhao , Chao Lou , Kewei Tu

Query expansion is a method for alleviating the vocabulary mismatch problem present in information retrieval tasks. Previous works have shown that terms selected for query expansion by traditional methods such as pseudo-relevance feedback…

Information Retrieval · Computer Science 2018-11-09 Ayyoob Imani , Amir Vakili , Ali Montazer , Azadeh Shakery

I describe the TreeBanker, a graphical tool for the supervised training involved in domain customization of the disambiguation component of a speech- or language-understanding system. The TreeBanker presents a user, who need not be a system…

cmp-lg · Computer Science 2008-02-03 David Carter