Sciweavers

60 search results - page 5 / 12
» Incremental Parser Generation for Tree Adjoining Grammars
Sort
View
CSB
2004
IEEE
208views Bioinformatics» more  CSB 2004»
13 years 11 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
ACL
2009
13 years 5 months ago
A Polynomial-Time Parsing Algorithm for TT-MCTAG
This paper investigates the class of TreeTuple MCTAG with Shared Nodes, TTMCTAG for short, an extension of Tree Adjoining Grammars that has been proposed for natural language proc...
Laura Kallmeyer, Giorgio Satta
ACL
2010
13 years 5 months ago
The Importance of Rule Restrictions in CCG
Combinatory Categorial Grammar (CCG) is generally construed as a fully lexicalized formalism, where all grammars use one and the same universal set of rules, and crosslinguistic v...
Marco Kuhlmann, Alexander Koller, Giorgio Satta
ACL
2007
13 years 8 months ago
A Symbolic Approach to Near-Deterministic Surface Realisation using Tree Adjoining Grammar
Surface realisers divide into those used in generation (NLG geared realisers) and those mirroring the parsing process (Reversible realisers). While the first rely on grammars not...
Claire Gardent, Eric Kow
ACL
1992
13 years 8 months ago
A Functional Approach to Generation with TAG
It has been hypothesized that Tree Adjoining Grammar (TAG) is particularly well suited for sentence generation. It is unclear, however, how a sentence generation system based on T...
Kathleen F. McCoy, K. Vijay-Shanker, Gijoo Yang