Empirical Analysis for Unsupervised Universal Dependency Parse Tree Aggregation
원문 초록
Dependency parsing is an essential task in NLP, and the quality of dependency parsers is crucial for many downstream tasks. Parsers' quality often varies depending on the domain and the language involved. Therefore, it is essential to combat the issue of varying quality to achieve stable performance. In various NLP tasks, aggregation methods are used for post-processing aggregation and have been shown to combat the issue of varying quality. However, aggregation methods for post-processing aggregation have not been sufficiently studied in dependency parsing tasks. In an extensive empirical study, we compare different unsupervised post-processing aggregation methods to identify the most suitable dependency tree structure aggregation method.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Step-by-step Instructions and a Simple Tabular Output Format Improve the Dependency Parsing Accuracy of LLMs
Hierarchical Bracketing Encodings for Dependency Parsing as Tagging
An Aspect Extraction Framework using Different Embedding Types, Learning Models, and Dependency Structure
Multi-View Attention Syntactic Enhanced Graph Convolutional Network for Aspect-based Sentiment Analysis
Top General Performance = Top Domain Performance? DomainCodeBench: A Multi-domain Code Generation Benchmark
Error Diversity Matters: An Error-Resistant Ensemble Method for Unsupervised Dependency Parsing
토론
이 논문과 연결된 포럼 글이 아직 없습니다.