555 search results - page 4 / 111 » Decompositions of Grammar Constraints |
ICGI
2004
Springer
14 years 22 days ago
2004
Springer
Abstract. This paper investigates the learnability of Pregroup Grammars, a context-free grammar formalism recently defined in the field of computational linguistics. In a first ...
MPC
2010
Springer
14 years 4 days ago
2010
Springer
Parser combinators are a popular tool for designing parsers in functional programming languages. If such combinators generate an abstract representation of the grammar as an interm...
COLING
2011
13 years 1 months ago
2011
CVPR
2006
IEEE
14 years 9 months ago
2006
IEEE
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...
COLING
2010
13 years 2 months ago
2010
Lexicalized Well-Founded Grammar (LWFG) is a recently developed syntacticsemantic grammar formalism for deep language understanding, which balances expressiveness with provable le...