Sciweavers

54 search results - page 6 / 11
» Efficient Context-Free Grammar Constraints
Sort
View
ACL
1990
13 years 9 months ago
Lexical and Syntactic Rules in a Tree Adjoining Grammar
according to this definition2. Each elementary tree is constrained to have at least one terminal at its frontier which serves as 'head' (or 'anchor'). Sentence...
Anne Abeillé
ACL
1998
13 years 9 months ago
Translating a Unification Grammar with Disjunctions into Logical Constraints
This paper proposes a method for generating a logicalconstraint-based internal representation from a unification grammar formalism with disjunctive information. Unification gramma...
Mikio Nakano, Akira Shimazu
CVPR
2006
IEEE
14 years 10 months ago
Composite Templates for Cloth Modeling and Sketching
Cloth modeling and recognition is an important and challenging problem in both vision and graphics tasks, such as dressed human recognition and tracking, human sketch and portrait...
Hong Chen, Zijian Xu, Ziqiang Liu, Song Chun Zhu
ACL
1993
13 years 9 months ago
Parsing Free Word Order Languages in the Paninian Framework
There is a need to develop a suitable computational grammar formalism for free word order languages for two reasons: First, a suitably designed formalism is likely to be more effi...
Akshar Bharati, Rajeev Sangal
ISMB
1994
13 years 9 months ago
Predicting Location and Structure Of beta-Sheet Regions Using Stochastic Tree Grammars
We describe and demonstrate the effectiveness of a method of predicting protein secondary structures, sheet regions in particular, using a class of stochastic tree grammars as rep...
Hiroshi Mamitsuka, Naoki Abe