116 search results - page 1 / 24 » An Efficient Parsing Algorithm for Tree Adjoining Grammars |
GRAMMARS
2000
13 years 4 months ago
2000
Abstract. We propose a modular design of tabular parsing algorithms for treeadjoining languages. The modularity is made possible by a separation of the parsing strategy from the me...
ACL
1990
13 years 6 months ago
1990
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...
EACL
1993
ACL Anthology
13 years 6 months ago
1993
ACL Anthology
We study parsing of tree adjoining grammars with particular emphasis on the use of shared forests to represent all the parse trees deriving a well-formed string. We show that ther...
ACL
1996
13 years 6 months ago
1996
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...
DEXA
2007
Springer
13 years 8 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. ...