Comparison between CFG filtering techniques for LTAG and HPSG

Authors:
Naoki Yoshinaga;Kentaro Torisawa;Jun'ichi Tsujii
Affiliations:
University of Tokyo, Tokyo, Japan;Japan Advanced Institute of Science and Technology, Ishikawa, Japan;CREST, JST (Japan Science and Technology Corporation), Saitama, Japan
Venue:
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 2
Year:
2003

Citing 7
Cited 0

An efficient context-free parsing algorithm

Communications of the ACM
Building a large annotated corpus of English: the penn treebank

Computational Linguistics - Special issue on using large corpora: II
The interface between phrasal and functional constraints

Computational Linguistics
An HPSG parser with CFG filtering

Natural Language Engineering
An efficient parsing algorithm for Tree Adjoining Grammars

ACL '90 Proceedings of the 28th 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
Lexicalized grammar acquisition

EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

An empirical comparison of CFG filtering techniques for LTAG and HPSG is presented. We demonstrate that an approximation of HPSG produces a more effective CFG filter than that of LTAG. We also investigate the reason for that difference.