Abstract
When parsing a Language the search space is traversed in a pre-defined way — top-down or bottom-up, depth-first or breath-first, typically. However, these might not be the ideal strategies: there are languages for which that process is very expensive or even, some valid sentences are not parsed straightly. Our aim is to describe an alternative method where the traversal may be heuristically defined during the process of parsing, depending only on the linguistic phenomena being analyzed. Such parser is data-driven by the string, and heuristically-driven by the annotated grammar rules. This makes it possible to mix top-down and bottom-up and also, to alternate parsing to the left or to the right of the symbol which causes the rule to be triggered. A bidirectional chart parsing was implemented in Prolog to express this idea. The results then obtained gave us some rules of thumb to get the best annotation of a grammar rule set and showed us the gain in time analysis by the spectacular pruning (65% in average for any phenomenon) of the search space.
Prof.Assistant in Esc. Superior de Tecnologia de Tomar doing a Ph.D. at the University of Minho
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Aho,A. and Ullman,J., "The Theory of Parsing, Translation, and Compiling", vol.1, Prentice-Hall, 1972
Du Boulay,B. and Elsom-Cook,M., "A Pascal program Checker", ECAI, 1986
Gazdar,G. and Kleine,E. and Pullum,G. and Sag,I., "Generalized phrase structure grammar", Blackwell, 1985
Mendes,J., "Reconhecimento com Charts", Department of Computer Science, University of Minho, 1990.
Mendes,J., "Reconhecimento:Pesquisa e Estratégias", Department of Computer Science, University of Minho, 1990.
Mendes,J., "Reconhecimento: estratégias heurísticas de pesquisa usando o chart bidireccional", Department of Computer Science, University of Minho, 1990.
Mendes,J., and DeRoeck,A., "Suport for Bidirectional Chart Parsing and search Space Pruning", Department of Computer Science, University of Essex, 1988
Mendes,J., "Comparison of three parsing strategies", M.Sc. Dissertation, Department of Computer Science, University of Essex, 1987.
Steel,S. and DeRoeck,A., "Bidirectional Chart Parsing", Department of Computer Science, University of Essex, 1986; Proc. 1987 Conf.Soc.for Artificial Intelligence and Simulation of Behaviour; reprinted in Hallam and Mellish(eds): Advances in AI 1987, John Wiley, pags 223–235.
Thompson, H. and Ritchie, G. Implementing Natural Language Parsers, in O'Shea and Eisenstadt (eds), "Artificial Intelligence", Harper and Row, New York, 1984.
Winograd,T., "Language as a Cognitive Process", Vol. 1, Chapter 3, Addison Wesley, 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mendes, J.A., Henriques, P.R. (1991). Heuristic parsing and search space pruning. In: Barahona, P., Moniz Pereira, L., Porto, A. (eds) EPIA 91. EPIA 1991. Lecture Notes in Computer Science, vol 541. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54535-2_26
Download citation
DOI: https://doi.org/10.1007/3-540-54535-2_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54535-4
Online ISBN: 978-3-540-38459-5
eBook Packages: Springer Book Archive