Sciweavers

47 search results - page 5 / 10
» Statistical Parsing with an Automatically-Extracted Tree Adj...
Sort
View
ACL
1998
14 years 10 months ago
Restrictions on Tree Adjoining Languages
Several methods are known for parsing languages generated by Tree Adjoining Grammars (TAGs) in O(n 6) worst case running time. In this paper we investigate which restrictions on T...
Giorgio Satta, William Schuler
EACL
2006
ACL Anthology
14 years 11 months ago
Unifying Synchronous Tree Adjoining Grammars and Tree Transducers via Bimorphisms
We place synchronous tree-adjoining grammars and tree transducers in the single overarching framework of bimorphisms, continuing the unification of synchronous grammars and tree t...
Stuart M. Shieber
ACL
2001
14 years 11 months ago
Guided Parsing of Range Concatenation Languages
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...
François Barthélemy, Pierre Boullier...
82
Voted
CSB
2004
IEEE
208views Bioinformatics» more  CSB 2004»
15 years 1 months ago
Pair Stochastic Tree Adjoining Grammars for Aligning and Predicting Pseudoknot RNA Structures
Motivation: Since the whole genome sequences for many species are currently available, computational predictions of RNA secondary structures and computational identifications of t...
Hiroshi Matsui, Kengo Sato, Yasubumi Sakakibara