Computational Linguistics
Transition network grammars for natural language analysis
Communications of the ACM
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Theory of Syntactic Recognition for Natural Languages
Theory of Syntactic Recognition for Natural Languages
Natural Language Processing in the 1980s: A Bibliography
Natural Language Processing in the 1980s: A Bibliography
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
The Theory and Practice of Augmented Transition Network Grammars
Natural Language Communication with Computers
A lazy way to chart-parse with Categorial Grammars
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
Chart parsing according to the slot and filler principle
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Island parsing and bidirectional charts
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Language As a Cognitive Process: Syntax
Language As a Cognitive Process: Syntax
Fast and quasi-natural language search for gigabytes of Chinese texts
SIGIR '95 Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval
Classification and clustering for case-based criminal summary judgments
ICAIL '03 Proceedings of the 9th international conference on Artificial intelligence and law
A block-based robust dependency parser for unrestricted Chinese text
CLPW '00 Proceedings of the second workshop on Chinese language processing: held in conjunction with the 38th Annual Meeting of the Association for Computational Linguistics - Volume 12
| Hi-index | 0.00 |
In this paper an efficient natural language processing system specially designed for the Chinese language is presented. The center of the present system is a bottom-up chart parser with head-driven operation; i.e., phrases are built up by starting with their heads and adjoining constituents to the left or right of the heads instead of strictly from left to right. In this way many more unnecessary searching actions can be effectively eliminated. The present system also includes several efficient approaches such as a direction-selective chart to simplify the control of the head-driven operation; a heuristic scheduling policy and a bidirectional look-ahead approach to eliminate many unnecessary searching actions, and an improved raise-bind mechanism combined with check rules to treat the difficult problems of movement transformations and empty categories and to simplify the design of grammar rules. The present design is based on careful consideration of some special syntactic phenomena of the Chinese language, such as head-final and head-initial structures and empty categories. A prototype of the present system has been successfully implemented and extensive experiments have been performed. In the test results significant improvement in the efficiency in processing many very complicated Chinese sentences has been observed. The detailed discussion on the various approaches, the overall system design, and the experimental results will all be presented in this paper.