DMCA
Bidirectional automata for tree adjoining grammars (2001)
Cached
Download Links
- [www.lsi.us.es]
- [coleweb.dc.fi.udc.es]
- [www.grupocole.org]
- [coleweb.dc.fi.udc.es]
- [www.grupocole.org]
- [www.grupolys.org]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proc. of the Seventh International Workshop on Parsing Technologies (IWPT-2001 |
| Citations: | 3 - 2 self |
BibTeX
@INPROCEEDINGS{Alonso01bidirectionalautomata,
author = {Miguel A. Alonso and Manuel Vilares and Depto De Computación and Víctor J. Díaz},
title = {Bidirectional automata for tree adjoining grammars},
booktitle = {In Proc. of the Seventh International Workshop on Parsing Technologies (IWPT-2001},
year = {2001},
pages = {42--53},
publisher = {Tsinghua University Press}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We define a new model of automata for the description of bidirectional parsing strategies for tree adjoining grammars and a tabulation mechanism that allow them to be executed in polynomial time. This new model of automata provides a modular way of describing bidirectional parsing strategies for TAG, separating the description of a strategy from its execution. 1
