Dependency parsing

Bài giảng Xử lý ngôn ngữ tự nhiên (Natural language processing): Bài 5c cung cấp cho học viên những nội dung về: tổng quan Dependency Parsing; các ứng dụng của Dependency Parsing; các tính chất của cây cú pháp phụ thuộc; các phương pháp giải quyết bài toán; các kết quả cài đặt;... Mời các bạn cùng tham khảo chi tiết nội dung bài giảng!

64p duonghoanglacnhi 07-11-2022 16 3   Download

Part 2 of the document "Speech and language processing: An introduction to natural language processing, computational linguistics, and speech recognition" provide with knowledge about: dependency parsing; logical representations of sentence meaning; computational semantics and semantic parsing; information extraction; word senses and WordNet; semantic role labeling; lexicons for sentiment, affect, and connotation;...

336p britaikridanik 05-07-2022 20 6   Download

Dependency parsing, which is the task of automatically doing syntactic analysis and defining the binary dependencies between words in a sentence, has gained much attention from researchers in recent years. Besides that, to build effective and robust dependency parsers, we also need a large number of annotated treebanks to train the models. However, constructing such treebanks is complicated and requires considerable human effort.

8p visherylsandberg 18-05-2022 11 2   Download

Biomedical semantic role labeling (BioSRL) is a natural language processing technique that identifies the semantic roles of the words or phrases in sentences describing biological processes and expresses them as predicate-argument structures (PAS’s). Currently, a major problem of BioSRL is that most systems label every node in a full parse tree independently; however, some nodes always exhibit dependency.

12p vikentucky2711 26-11-2020 14 0   Download

Dependency parsing has attracted many natural language processing research groups in recent years. Dependency syntax is a form of sentence representation which has many applications in problems such as question answering system, information extraction, text summarization, machine translation ... Currently, there are many approaches for dependency parsing and they have achieved high accuracy for different languages. For Vietnamese, our research group has used Skip-gram and GloVe model to produce distributed word representations.

7p quenchua9 20-11-2020 17 2   Download

Despite the ubiquity of mass spectrometry (MS), data processing tools can be surprisingly limited. To date, there is no stand-alone, cross-platform 3-D visualizer for MS data. Available visualization toolkits require large libraries with multiple dependencies and are not well suited for custom MS data processing modules, such as MS storage systems or data processing algorithms.

7p viconnecticut2711 29-10-2020 5 1   Download

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 information, it is valuable to understand which approaches to syntactic processing of biomedical text have the highest performance.

13p vicoachella2711 27-10-2020 9 1   Download

Bài giảng "Xử lý ngôn ngữ tự nhiên - Chương 9: Dependency parsing" cung cấp cho người học các kiến thức: Tổng quan về Dependency parsing, phương pháp Transition-based, phương pháp Graph-based,... Mời các bạn cùng tham khảo nội dung chi tiết.

24p dien_vi10 02-10-2018 125 6   Download

Part-of-speech (POS) tagging plays an important role in Natural Language Processing (NLP). Its applications can be found in many other NLP tasks such as named entity recognition, syntactic parsing, dependency parsing and text chunking. In the investigation conducted in this paper, we utilize the techniques of two widely-used toolkits, ClearNLP and Stanford POS Tagger, and develop two new POS taggers for Vietnamese, then compare them to three well-known Vietnamese taggers, namely JVnTagger, vnTagger and RDRPOSTagger.

15p truongtien_09 10-04-2018 32 6   Download

In this paper, we present an approach as pre-processing step based on a dependency parser in phrase-based statistical machine translation (SMT) to learn automatic and manual reordering rules from English to Vietnamese. The dependency parse trees and transformation rules are used to reorder the source sentences and applied for systems translating from English to Vietnamese. We evaluated our approach on English-Vietnamese machine translation tasks, and showed that it outperforms the baseline phrase-based SMT system.

14p truongtien_09 10-04-2018 39 3   Download

This work is concerned with the development of instruments for GB parsing. An alternative to the well known indexation system of (Chomsky, 1981) will be proposed and then used to formalize the view of Binding Theory in terms of the generation of constraints on the referential properties of the NPs of a sentence. Finally the problems of verification and satisfiability of BT will be addressed within the proposed framework.

6p buncha_1 08-05-2013 38 3   Download

Recently, we have augmented the dependency parsing model t o c o v e r a l s o tong-distance dependencies. According to the augmented model we have implemented a blackboard-based dependency p a r s e r ADP (Augmented Dependency P a r s e r ) .

8p buncha_1 08-05-2013 42 1   Download

This paper assesses two new approaches to deterministic parsing with respect to the analysis of unbounded dependencies (UDs). UDs in English are highly locally (and often globally) ambiguous. Several researchers have argued that the difficulty of UDs undermines the programme of deterministic parsing. However, their conclusion is based on critiques of various versions of the Marcus parser which represents only one of many possible approaches to deterministic parsing.

7p buncha_1 08-05-2013 31 1   Download

This paper introduces a special programming environment for the definition of grammars and for the implementation of corresponding parsers. In natural language processing systems it is advantageous to have linguistic knowledge and processing mechanisms separated. Our environment accepts grammars consisting of binary dependency relations and grammatical functions. Well-formed expressions of functions and relations provide constituent surroundings for syntactic categories in the form of two-way automata. ...

9p buncha_1 08-05-2013 46 1   Download

The work reported here has largely involved problems with parsing Italian. One of the typical features of Italian is a lower degree of word order rigidity in sentences. For instance, "Paolo ama Maria" (Paolo loves Maria) may be rewritten without any significant difference in meaning (leaving aside questions of context and pragmatics) in any the six possible permutations: Paolo ama Maria, Paolo Maria ama, Maria ama Paolo, Maria Paolo ama, ama Paolo Maria, ama Maria Paolo.

5p buncha_1 08-05-2013 25 1   Download

The paper presents a language model that develops syntactic structure and uses it to extract meaningful information from the word history, thus enabling the use of long distance dependencies. The model assigns probability to every joint sequence of words-binary-parse-structure with headword annotation. The model, its probabilistic parametrization, and a set of experiments meant to evaluate its predictive power are presented.

3p bunthai_1 06-05-2013 34 1   Download

Results of computational complexity exist for a wide range of phrase structure-based grammar formalisms, while there is an apparent lack of such results for dependency-based formalisms. We here adapt a result on the complexity of ID/LP-grammars to the dependency framework. Contrary to previous studies on heavily restricted dependency grammars, we prove that recognition (and thus, parsing) of linguistically adequate dependency grammars is~A/T'-complete.

7p bunthai_1 06-05-2013 55 4   Download

In this paper we study spectral learning methods for non-deterministic split headautomata grammars, a powerful hiddenstate formalism for dependency parsing. We present a learning algorithm that, like other spectral methods, is efficient and nonsusceptible to local minima. We show how this algorithm can be formulated as a technique for inducing hidden structure from distributions computed by forwardbackward recursions.

11p bunthai_1 06-05-2013 49 3   Download

We introduce a new approach to transitionbased dependency parsing in which the parser does not directly construct a dependency structure, but rather an undirected graph, which is then converted into a directed dependency tree in a post-processing step. This alleviates error propagation, since undirected parsers do not need to observe the single-head constraint. Undirected parsers can be obtained by simplifying existing transition-based parsers satisfying certain conditions.

11p bunthai_1 06-05-2013 40 2   Download

Hungarian is a stereotype of morphologically rich and non-configurational languages. Here, we introduce results on dependency parsing of Hungarian that employ a 80K, multi-domain, fully manually annotated corpus, the Szeged Dependency Treebank. We show that the results achieved by state-of-the-art data-driven parsers on Hungarian and English (which is at the other end of the configurational-nonconfigurational spectrum) are quite similar to each other in terms of attachment scores.

11p bunthai_1 06-05-2013 58 3   Download