Restrictions on Tree Adjoining Languages
| dc.creator | Satta, Giorgio | |
| dc.creator | Schuler, William | |
| dc.date | 1998-10-13 | |
| dc.date.accessioned | 2026-07-07T03:23:44Z | |
| dc.date.available | 2026-07-07T03:23:44Z | |
| dc.description | 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 TAGs and TAG derivations are needed in order to lower this O(n^6) time complexity, without introducing large runtime constants, and without losing any of the generative power needed to capture the syntactic constructions in natural language that can be handled by unrestricted TAGs. In particular, we describe an algorithm for parsing a strict subclass of TAG in O(n^5), and attempt to show that this subclass retains enough generative power to make it useful in the general case. | |
| dc.description | 7 pages LaTeX + 5 eps figures | |
| dc.identifier | https://arxiv.org/abs/cs/9810015 | |
| dc.identifier | http://arxiv.org/abs/cs/9810015 | |
| dc.identifier | Proceedings of COLING-ACL'98 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/33062 | |
| dc.subject | Computation and Language | |
| dc.subject | I.2.7 | |
| dc.title | Restrictions on Tree Adjoining Languages | |
| dc.type | text |