English
Related papers

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

200 papers

In some contexts, well-formed natural language cannot be expected as input to information or communication systems. In these contexts, the use of grammar-independent input (sequences of uninflected semantic units like e.g.…

Computation and Language · Computer Science 2007-05-23 Pascal Vaillant

Direct dependency parsing of the speech signal -- as opposed to parsing speech transcriptions -- has recently been proposed as a task (Pupier et al. 2022), as a way of incorporating prosodic information in the parsing system and bypassing…

Computation and Language · Computer Science 2024-06-19 Adrien Pupier , Maximin Coavoux , Jérôme Goulian , Benjamin Lecouteux

Since the popularization of the Transformer as a general-purpose feature encoder for NLP, many studies have attempted to decode linguistic structure from its novel multi-head attention mechanism. However, much of such work focused almost…

Computation and Language · Computer Science 2021-01-27 Vinit Ravishankar , Artur Kulmizev , Mostafa Abdou , Anders Søgaard , Joakim Nivre

We present POTATO, a task- and languageindependent framework for human-in-the-loop (HITL) learning of rule-based text classifiers using graph-based features. POTATO handles any type of directed graph and supports parsing text into Abstract…

Computation and Language · Computer Science 2022-10-18 Ádám Kovács , Kinga Gémes , Eszter Iklódi , Gábor Recski

Data exploration is an important step of every data science and machine learning project, including those involving textual data. We provide a novel language tool, in the form of a publicly available Python library for extracting patterns…

Computation and Language · Computer Science 2022-06-20 Piyawat Lertvittayakumjorn , Leshem Choshen , Eyal Shnarch , Francesca Toni

Bayesian additive regression trees (BART) (Chipman et. al., 2010) is a powerful predictive model that often outperforms alternative models at out-of-sample prediction. BART is especially well-suited to settings with unstructured predictor…

Machine Learning · Statistics 2019-03-15 Jingyu He , Saar Yalov , P. Richard Hahn

In many areas, we have well-founded insights about causal structure that would be useful to bring into our trained models while still allowing them to learn in a data-driven fashion. To achieve this, we present the new method of interchange…

Machine Learning · Computer Science 2022-07-22 Atticus Geiger , Zhengxuan Wu , Hanson Lu , Josh Rozner , Elisa Kreiss , Thomas Icard , Noah D. Goodman , Christopher Potts

As the technology for building knowledge based systems has matured, important lessons have been learned about the relationship between the architecture of a system and the nature of the problems it is intended to solve. We are implementing…

Artificial Intelligence · Computer Science 2013-04-08 Lashon B. Booker , Naveen Hota , Connie Loggia Ramsey

Recently BERT has been adopted for document encoding in state-of-the-art text summarization models. However, sentence-based extractive models often result in redundant or uninformative phrases in the extracted summaries. Also, long-range…

Computation and Language · Computer Science 2020-04-28 Jiacheng Xu , Zhe Gan , Yu Cheng , Jingjing Liu

We present DART, an open domain structured DAta Record to Text generation dataset with over 82k instances (DARTs). Data-to-Text annotations can be a costly process, especially when dealing with tables which are the major source of…

Extracting temporal relations between events and time expressions has many applications such as constructing event timelines and time-related question answering. It is a challenging problem which requires syntactic and semantic information…

Computation and Language · Computer Science 2020-10-06 Hayley Ross , Jonathon Cai , Bonan Min

How can we effectively find the best structures in tree models? Tree models have been favored over complex black box models in domains where interpretability is crucial for making irreversible decisions. However, searching for a tree…

Machine Learning · Computer Science 2022-02-23 Jaemin Yoo , Lee Sael

Information Extraction (IE) for semi-structured document images is often approached as a sequence tagging problem by classifying each recognized input token into one of the IOB (Inside, Outside, and Beginning) categories. However, such…

Computation and Language · Computer Science 2021-07-02 Wonseok Hwang , Jinyeong Yim , Seunghyun Park , Sohee Yang , Minjoon Seo

The non-autoregressive models have boosted the efficiency of neural machine translation through parallelized decoding at the cost of effectiveness when comparing with the autoregressive counterparts. In this paper, we claim that the…

Computation and Language · Computer Science 2021-01-25 Ye Liu , Yao Wan , Jian-Guo Zhang , Wenting Zhao , Philip S. Yu

Syntactic Language Models (SLMs) can be trained efficiently to reach relatively high performance; however, they have trouble with inference efficiency due to the explicit generation of syntactic structures. In this paper, we propose a new…

Computation and Language · Computer Science 2025-08-20 Ryo Yoshida , Taiga Someya , Yohei Oseki

To harness the power of large language models in safety-critical domains, we need to ensure the explainability of their predictions. However, despite the significant attention to model interpretability, there remains an unexplored domain in…

Computation and Language · Computer Science 2024-06-04 Kenza Amara , Rita Sevastjanova , Mennatallah El-Assady

In principle, the design of transition-based dependency parsers makes it possible to experiment with any general-purpose classifier without other changes to the parsing algorithm. In practice, however, it often takes substantial software…

Computation and Language · Computer Science 2012-11-02 Alex Rudnick

Contextualized embeddings such as BERT can serve as strong input representations to NLP tasks, outperforming their static embeddings counterparts such as skip-gram, CBOW and GloVe. However, such embeddings are dynamic, calculated according…

Computation and Language · Computer Science 2020-04-07 Yile Wang , Leyang Cui , Yue Zhang

Most syntactic dependency parsing models may fall into one of two categories: transition- and graph-based models. The former models enjoy high inference efficiency with linear time complexity, but they rely on the stacking or re-ranking of…

Computation and Language · Computer Science 2020-02-13 Zuchao Li , Hai Zhao , Kevin Parnow

Learning musical structures and composition patterns is necessary for both music generation and understanding, but current methods do not make uniform use of learned features to generate and comprehend music simultaneously. In this paper,…

Sound · Computer Science 2024-12-10 Xiao Liang , Zijian Zhao , Weichao Zeng , Yutong He , Fupeng He , Yiyi Wang , Chengying Gao
‹ Prev 1 8 9 10 Next ›