Syntactic constraints on antecedent-anaphor relations can be stated within the theory of Lexical Functional Grammar (henceforth LFG) through the use of functional uncertainty (Kaplan and Maxwell 1988; Halvorsen and Kaplan 1988; Ksplan and Zaenen 1989). In the following, we summarize the general characteristics of syntactic constraints on anaphoric binding. Next, we describe a variation of funct...

~he syntax component of the speech recognition system IKAROS t is described, clhe usefidness of a probabilistic Le~jcal Functional Grammar both for cow,straining bottom-up hypotheses and top-down predicting is showtL 1. I n t r o d u c t i o n The most impor t an t p rob l em in al l speech recognit ion systems is the inherent uncer ta inty associa ted with the acous t ic -phonet ic decoding pr...

Temporal formalisms are useful in several applications such as planning scheduling and diagnosis Probabilistic temporal rea soning emerged to deal with the uncer tainties usually encountered in such ap plications Bayesian networks provide a simple compact graphical representation of a probability distribution by exploit ing conditional independencies This pa per presents a simple technique for ...