Sciweavers

621 search results - page 28 / 125
» Parsing As Tree Traversal
Sort
View
ACL
2006
13 years 11 months ago
Trimming CFG Parse Trees for Sentence Compression Using Machine Learning Approaches
Sentence compression is a task of creating a short grammatical sentence by removing extraneous words or phrases from an original sentence while preserving its meaning. Existing me...
Yuya Unno, Takashi Ninomiya, Yusuke Miyao, Jun-ich...
ICCV
2009
IEEE
13 years 7 months ago
Efficient human pose estimation via parsing a tree structure based human model
Human pose estimation is the task of determining the states (location, orientation and scale) of each body part. It is important for many vision understanding applications, e.g. v...
Xiaoqin Zhang, Changcheng Li, Xiaofeng Tong, Weimi...
ACL
1998
13 years 11 months ago
Parsing Ambiguous Structures using Controlled Disjunctions and Unary Quasi-Trees
The problem of parsing ambiguous structures concerns (i) their representation and (ii) the specification of mechanisms allowing to delay and control their evaluation. We first pro...
Philippe Blache
ACL
1990
13 years 11 months ago
An Efficient Parsing Algorithm for Tree Adjoining Grammars
In the literature, Tree Adjoining Grammars (TAGs) are propagated to be adequate for natural language description -- analysis as well as generation. In this paper we concentrate on...
Karin Harbusch
EMNLP
2007
13 years 11 months ago
Treebank Annotation Schemes and Parser Evaluation for German
Recent studies focussed on the question whether less-configurational languages like German are harder to parse than English, or whether the lower parsing scores are an artefact o...
Ines Rehbein, Josef van Genabith