By Topic

A context-free parsing algorithm using heuristic search

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
A. L. N. Fred ; Inst. de Telecommun., Inst. Superior Tecnico, Lisbon, Portugal ; J. M. N. Leitao

This paper presents a heuristic parsing algorithm for general stochastic context-free grammars (SCFG). The method is based on the formulation of the parsing problem as a search on the state-space representing legal phrases generated by the grammars. An extension of the state-space search algorithm A* to stochastic graphs is applied to solve the parsing problem. Simple, grammar independent, heuristics are described that ensure convergence to the solution and guarantee the choice of the most probable parsing in case of ambiguous grammars. The method is compared with Earley's algorithm (1986) and with a related heuristic recognizer (AE*). Several test grammars are used as examples; showing that the proposed algorithm outperforms both methods in many situations

Published in:

Systems, Man and Cybernetics, 1995. Intelligent Systems for the 21st Century., IEEE International Conference on  (Volume:5 )

Date of Conference:

22-25 Oct 1995