An heuristic-based context-free parsing algorithm

Authors:
Ana L. N. Fred;José M. N. Leitão
Affiliations:
Centro de Análise e Processamento de Sinais, Instituto Superior Técnico, Lisboa Cedex, Portugal;Centro de Análise e Processamento de Sinais, Instituto Superior Técnico, Lisboa Cedex, Portugal
Venue:
ICASSP'93 Proceedings of the 1993 IEEE international conference on Acoustics, speech, and signal processing: speech processing - Volume II
Year:
1993

Citing 4
Cited 0

An efficient context-free parsing algorithm

Readings in natural language processing
The Theory of Parsing, Translation, and Compiling

The Theory of Parsing, Translation, and Compiling
Problem-Solving Methods in Artificial Intelligence

Problem-Solving Methods in Artificial Intelligence
A study of search methods: the effect of constraint satisfaction and adventurousness

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an heuristic-based parsang algorithm for general stochastic context-free grammars. The algorithm is basically a top-down parser that combines an extension of the A* search paradigm with a constraint satisfaction procedure Heuristics are used to increase the lakelihood of making a correct choice while constraint satisfaction eliminates states that cannot lead to a solution. Two simple heuristics are introduced ensuring convergence to the solution and guaranteeing the choice of the most probable parsing in case of ambiguous grammars. A comparison of the proposed parser with Earley's algorithm on four different grammars is presented.