Sciweavers

34 search results - page 2 / 7
» Simple Semi-supervised Dependency Parsing
Sort
View
131
Voted
EMNLP
2009
15 years 16 days ago
Improving Dependency Parsing with Subtrees from Auto-Parsed Data
This paper presents a simple and effective approach to improve dependency parsing by using subtrees from auto-parsed data. First, we use a baseline parser to parse large-scale una...
Wenliang Chen, Jun'ichi Kazama, Kiyotaka Uchimoto,...
146
Voted
IJCAI
2007
15 years 4 months ago
Simple Training of Dependency Parsers via Structured Boosting
Recently, significant progress has been made on learning structured predictors via coordinated training algorithms such as conditional random fields and maximum margin Markov ne...
Qin Iris Wang, Dekang Lin, Dale Schuurmans
CVPR
2010
IEEE
15 years 10 months ago
Detecting and Parsing Architecture at City Scale from Range Data
We present a method for detecting and parsing buildings from unorganized 3D point clouds into a compact, hierarchical representation that is useful for high-level tasks. The input...
Alexander Toshev, Philippos Mordohai, Ben Taskar
126
Voted
ACL
2010
15 years 23 days ago
Detecting Errors in Automatically-Parsed Dependency Relations
We outline different methods to detect errors in automatically-parsed dependency corpora, by comparing so-called dependency rules to their representation in the training data and ...
Markus Dickinson
146
Voted
ACL
2011
14 years 6 months ago
Event Extraction as Dependency Parsing
Nested event structures are a common occurrence in both open domain and domain specific extraction tasks, e.g., a “crime” event can cause a “investigation” event, which c...
David McClosky, Mihai Surdeanu, Christopher D. Man...