Sciweavers

41 search results - page 4 / 9
» Constraints on Non-Projective Dependency Parsing
Sort
View
ACL
2010
13 years 5 months ago
Using Smaller Constituents Rather Than Sentences in Active Learning for Japanese Dependency Parsing
We investigate active learning methods for Japanese dependency parsing. We propose active learning methods of using partial dependency relations in a given sentence for parsing an...
Manabu Sassano, Sadao Kurohashi
COLING
2008
13 years 9 months ago
Robust and Efficient Chinese Word Dependency Analysis with Linear Kernel Support Vector Machines
Data-driven learning based on shift reduce parsing algorithms has emerged dependency parsing and shown excellent performance to many Treebanks. In this paper, we investigate the e...
Yu-Chieh Wu, Jie-Chi Yang, Yue-Shi Lee
EMNLP
2006
13 years 9 months ago
Incremental Integer Linear Programming for Non-projective Dependency Parsing
Integer Linear Programming has recently been used for decoding in a number of probabilistic models in order to enforce global constraints. However, in certain applications, such a...
Sebastian Riedel, James Clarke
ACL
2007
13 years 9 months ago
K-best Spanning Tree Parsing
This paper introduces a Maximum Entropy dependency parser based on an efficient kbest Maximum Spanning Tree (MST) algorithm. Although recent work suggests that the edge-factored ...
Keith Hall
ACL
2006
13 years 9 months ago
Guiding a Constraint Dependency Parser with Supertags
We investigate the utility of supertag information for guiding an existing dependency parser of German. Using weighted constraints to integrate the additionally available informat...
Kilian A. Foth, Tomas By, Wolfgang Menzel