Mathematical and computational aspects of lexicalized grammars
Mathematical and computational aspects of lexicalized grammars
Some computational properties of Tree Adjoining Grammars
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
An efficient parsing algorithm for Tree Adjoining Grammars
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
An Earley-type parsing algorithm for Tree Adjoining Grammars
ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
Parsing strategies with 'lexicalized' grammars: application to tree adjoining grammars
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Tree-adjoining grammar parsing and boolean matrix multiplication
Computational Linguistics
An efficient implementation of the head-corner parser
Computational Linguistics
Head-driven parsing for lexicalist grammars: experimental results
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
A unification-based parser for relational grammar
ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
Relating tabular parsing algorithms for LIG and TAG
New developments in parsing technology
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
| Hi-index | 0.00 |
In this paper a bidirectional parser for Lexicalized Tree Adjoining Grammars will be presented. The algorithm takes advantage of a peculiar characteristic of Lexicalized TAGs, i.e. that each elementary tree is associated with a lexical item, called its anchor. The algorithm employs a mixed strategy: it works bottom-up from the lexical anchors and then expands (partial) analyses making top-down predictions. Even if such an algorithm does not improve the worst-case time bounds of already known TAGs parsing methods, it could be relevant from the perspective of linguistic information processing, because it employs lexical information in a more direct way.