57 search results - page 4 / 12 » Parsing Tree Adjoining Grammars using Evolutionary Algorithm... |
DEXA
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. The parsing schemata formalism allows us to describe parsing algorithms in a simple, declarative way by capturing their fundamenntics while abstracting low-level detail. ...
ACL
2001
14 years 11 months ago
2001
The theoretical study of the range concatenation grammar [RCG] formalism has revealed many attractive properties which may be used in NLP. In particular, range concatenation langu...
COLING
1999
14 years 9 months ago
1999
languages into a general system for describing parsers. Eachparser performs abstract computations using theoperations ofasemiring. Thesystem allows asingle, simple representation t...
CSB
2004
IEEE
15 years 1 months ago
2004
IEEE
Motivation: Since the whole genome sequences for many species are currently available, computational predictions of RNA secondary structures and computational identifications of t...
ACL
2009
14 years 7 months ago
2009
We present a discourse-level Tree Adjoining Grammar which tightly integrates syntax and discourse levels, including a representation for discourse entities. We show that this tech...