Sciweavers

57 search results - page 2 / 12
» Parsing Tree Adjoining Grammars using Evolutionary Algorithm...
Sort
View
ACL
1996
13 years 7 months ago
Incremental Parser Generation for Tree Adjoining Grammars
This paper describes the incremental generation of parse tables for the LR-type parsing of Tree Adjoining Languages (TALs). The algorithm presented handles modi cations to the inp...
Anoop Sarkar
ACL
1998
13 years 7 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
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
2007
13 years 7 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
1990
13 years 7 months ago
An Efficient Parsing Algorithm for Tree Adjoining Grammars
In the literature, Tree Adjoining Grammars (TAGs) are propagated to be adequate for natural language description -- analysis as well as generation. In this paper we concentrate on...
Karin Harbusch