COLING '94


UNIVERSAL GUIDES AND FINITENESS AND
SYMMETRY OF GRAMMAR PROCESSING ALGORITHMS
Miroslav Martinovic



 
 
 
 

TOPIC AREA: Mathematical Linguistics, Quantitative/Qualitative Linguistics, Language Understanding
 
 



ABSTRACT

This paper presents a novel technique called "universal guides" which explores inherent properties of logic grammars (changing variable binding status) in order to characterize formal criteria for termination in a derivation process. The notion of universal guides also offers a new framework in which both parsing and generation can be viewed merely as two different instances of a same generic process: guide consumption. This technique generalizes and exemplifies a new and original use of an existing concept of "proper guides" recently proposed in literature for controlling top-down left-to-right (TDLR) execution in logic programs. We show that universal guides are independent of a particular grammar evaluation strategy. Also, unlike the proper guides they can be specified in the same manner for any given algorithm without knowing in advance whether the algorithm is a parsing or a generation algorithm. Their introduction into a grammar as well prevents the occurrence of certain grammar rules infinitely many times in a derivation.