Sciweavers

116 search results - page 2 / 24
» An Efficient Parsing Algorithm for Tree Adjoining Grammars
Sort
View
ACL
1990
13 years 7 months ago
Deterministic Left to Right Parsing of Tree Adjoining Languages
We define a set of deterministic bottom-up left to right parsers which analyze a subset of Tree Adjoining Languages. The LR parsing strategy for Context Free Grammars is extended ...
Yves Schabes, K. Vijay-Shanker
ACL
1996
13 years 7 months ago
Another Facet of LIG Parsing
In this paper 1 we present a new parsing algorithm for linear indexed grammars (LIGs) in the same spirit as the one described in (Vijay-Shanker and Weir, 1993) for tree adjoining ...
Pierre Boullier
ACL
2009
13 years 3 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
CSB
2004
IEEE
208views Bioinformatics» more  CSB 2004»
13 years 9 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
ICAART
2009
INSTICC
13 years 3 months ago
Parsing Tree Adjoining Grammars using Evolutionary Algorithms
Adrian Horia Dediu, Catalin Ionut Tîrnauca