The logic of typed feature structures
The logic of typed feature structures
Generalized probabilistic LR parsing of natural language (Corpora) with unification-based grammars
Computational Linguistics - Special issue on using large corpora: I
HPSG-style underspecified Japanese grammar with wide coverage
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
Using restriction to extend parsing algorithms for complex-feature-based formalisms
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Computing phrasal-signs in HPSG prior to parsing
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
A bag of useful techniques for efficient and robust parsing
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
A hybrid Japanese parser with hand-crafted grammar and statistics
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
Comparison between CFG filtering techniques for LTAG and HPSG
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 2
Generic NLP technologies: language, knowledge and information extraction
ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics
STAR '01 Proceedings of the ACL 2001 Workshop on Sharing Tools and Resources - Volume 15
Efficient HPSG parsing with supertagging and CFG-filtering
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
Computational linguistics and natural language processing
CICLing'11 Proceedings of the 12th international conference on Computational linguistics and intelligent text processing - Volume Part I
IJCNLP'04 Proceedings of the First international joint conference on Natural Language Processing
Precompilation of HPSG in ALE into a CFG for fast parsing
Proceedings of the COLING-2000 Workshop on Efficiency In Large-Scale Parsing Systems
| Hi-index | 0.00 |
This article presents an HPSG parser using a technique called CFG filtering. The parser predicts possible parse trees using a CFG generated automatically from a given HPSG-based grammar. Parsing costs are reduced because unification is applied only to the predicted parse trees. In other words, parsing is speeded up because the parser avoids unnecessary unification by eliminating impossible parse trees. We show the method for generating a CFG from an HPSG-based grammar and outline a parsing scheme using the CFG. The effectiveness of the parsing scheme is shown through experimental results obtained by using several HPSG-based grammars, including the LinGO grammar.