English
Related papers

Related papers: Performance of Stanford and Minipar Parser on Biom…

200 papers

Stanford typed dependencies are a widely desired representation of natural language sentences, but parsing is one of the major computational bottlenecks in text analysis systems. In light of the evolving definition of the Stanford…

Computation and Language · Computer Science 2014-04-17 Lingpeng Kong , Noah A. Smith

Syntactic parsing is an important step in the automated text analysis which aims at information extraction. Quality of the syntactic parsing determines to a large extent the recall and precision of the text mining results. In this paper we…

Computation and Language · Computer Science 2020-08-18 Maria Biryukov

While dependency parsers reach very high overall accuracy, some dependency relations are much harder than others. In particular, dependency parsers perform poorly in coordination construction (i.e., correctly attaching the "conj" relation).…

Computation and Language · Computer Science 2017-02-23 Jessica Ficler , Yoav Goldberg

We compare the performance of a transition-based parser in regards to different annotation schemes. We pro-pose to convert some specific syntactic constructions observed in the universal dependency treebanks into a so-called more standard…

Computation and Language · Computer Science 2025-03-11 Guillaume Wisniewski , Ophélie Lacroix

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

Dependency parsing is the task of inferring natural language structure, often approached by modeling word interactions via attention through biaffine scoring. This mechanism works like self-attention in Transformers, where scores are…

Computation and Language · Computer Science 2025-10-27 Paolo Gajo , Domenic Rosati , Hassan Sajjad , Alberto Barrón-Cedeño

We study the adaptation of Link Grammar Parser to the biomedical sublanguage with a focus on domain terms not found in a general parser lexicon. Using two biomedical corpora, we implement and evaluate three approaches to addressing unknown…

Computation and Language · Computer Science 2007-05-23 Sampo Pyysalo , Tapio Salakoski , Sophie Aubin , Adeline Nazarenko

Dependency parsing is one of the important natural language processing tasks that assigns syntactic trees to texts. Due to the wider availability of dependency corpora and improved parsing and machine learning techniques, parsing accuracies…

Computation and Language · Computer Science 2018-10-05 Juntao Yu

We investigate the effect of various dependency-based word embeddings on distinguishing between functional and domain similarity, word similarity rankings, and two downstream tasks in English. Variations include word embeddings trained…

Computation and Language · Computer Science 2018-04-18 Sean MacAvaney , Amir Zeldes

The growing public demand for accessible biomedical information calls for scalable text simplification. While large language models (LLMs) offer solutions, they too struggle with balancing improved readability against preservation of…

Computation and Language · Computer Science 2026-05-07 P. Bilha Githinji , Aikaterini Melliou , Zeming Liang , Lian Zhang , Peiwu Qin

Background: Given the importance of relation or event extraction from biomedical research publications to support knowledge capture and synthesis, and the strong dependency of approaches to this information extraction task on syntactic…

Computation and Language · Computer Science 2019-02-13 Dat Quoc Nguyen , Karin Verspoor

Medical relation extraction discovers relations between entity mentions in text, such as research articles. For this task, dependency syntax has been recognized as a crucial source of features. Yet in the medical domain, 1-best parse trees…

Computation and Language · Computer Science 2019-12-17 Linfeng Song , Yue Zhang , Daniel Gildea , Mo Yu , Zhiguo Wang , Jinsong Su

Overall, the two main contributions of this work include the application of sentence simplification to association extraction as described above, and the use of distributional semantics for concept extraction. The proposed work on concept…

Computation and Language · Computer Science 2011-09-13 Siddhartha Jonnalagadda

We reduce phrase-representation parsing to dependency parsing. Our reduction is grounded on a new intermediate representation, "head-ordered dependency trees", shown to be isomorphic to constituent trees. By encoding order information in…

Computation and Language · Computer Science 2015-03-03 Daniel Fernández-González , André F. T. Martins

The biaffine parser of Dozat and Manning (2017) was successfully extended to semantic dependency parsing (SDP) (Dozat and Manning, 2018). Its performance on graphs is surprisingly high given that, without the constraint of producing a tree,…

Computation and Language · Computer Science 2024-02-13 Marie Candito

While syntactic dependency annotations concentrate on the surface or functional structure of a sentence, semantic dependency annotations aim to capture between-word relationships that are more closely related to the meaning of a sentence,…

Computation and Language · Computer Science 2018-07-05 Timothy Dozat , Christopher D. Manning

Understanding the meaning of text often involves reasoning about entities and their relationships. This requires identifying textual mentions of entities, linking them to a canonical concept, and discerning their relationships. These tasks…

Computation and Language · Computer Science 2019-12-04 Trapit Bansal , Pat Verga , Neha Choudhary , Andrew McCallum

Biomedical research encompasses diverse types of activities, from basic science ("bench") to clinical medicine ("bedside") to bench-to-bedside translational research. It, however, remains unclear whether different types of research receive…

Digital Libraries · Computer Science 2019-12-17 Qing Ke

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

We demonstrate that a dependency parser can be built using a credit assignment compiler which removes the burden of worrying about low-level machine learning details from the parser implementation. The result is a simple parser which…

Computation and Language · Computer Science 2015-05-11 Kai-Wei Chang , He He , Hal Daumé , John Langford
‹ Prev 1 2 3 10 Next ›