Splitting EUD graphs into trees: A quick and clatty approach
We present the system submission from the FASTPARSE team for the EUD Shared Task at IWPT 2021. We engaged in the task last year by focusing on efficiency. This year we have focused on experimenting with new ideas on a limited time budget. Our system is based on splitting the EUD graph into several trees, based on linguistic criteria. We predict these trees using a sequence-labelling parser and combine them into an EUD graph. The results were relatively poor, although not a total disaster and could probably be improved with some polishing of the system's rough edges.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Top-Down RST Parsing Utilizing Granularity Levels in Documents
Some downstream NLP tasks exploit discourse dependency trees converted from RST trees. To obtain better discourse dependency trees, we need to improve the accuracy of RST trees at the upper parts of the structures. Thus,…
Discourse ParsingRelationHoeffding adaptive splitting trees for data stream classification with concept drift and ensemble learning
Ensembles of decision trees are well-established methods for data stream classification. In ensemble learning, Hoeffding Trees are widely adopted as base learners, performing periodic split attempts according to the Hoef…
Ensemble LearningChange DetectionNode Splitting SVMs for Survival Trees Based on an L2-Regularized Dipole Splitting Criteria
This paper proposes a novel, node-splitting support vector machine (SVM) for creating survival trees. This approach is capable of non-linearly partitioning survival data which includes continuous, right-censored outcomes…
Efficient Parsing for Head-Split Dependency Trees
Head splitting techniques have been successfully exploited to improve the asymptotic runtime of parsing algorithms for projective dependency trees, under the arc-factored model. In this article we extend these techniques…
ARCDependency ParsingPractical Fixed-Parameter Algorithms for Defending Active Directory Style Attack Graphs
Active Directory is the default security management system for Windows domain networks. We study the shortest path edge interdiction problem for defending Active Directory style attack graphs. The problem is formulated a…
ManagementTree Decomposition