The paper presents a tabular interpretation for a kind of 2-Stack Automata. These automata may be used to describe various parsing strategies, ranging from purely top-down to purely bottom-up, for LIGs and TAGs. The tabular interpretation ensures, for ...

Several methods are known for parsing languages generated by Tree Adjoining Grammars (TAGs) in O(n⁶) worst case running time. In this paper we investigate which restrictions on TAGs and TAG derivations are needed in order to lower this O(n⁶) time ...

Much of the power of probabilistic methods in modelling language comes from their ability to compare several derivations for the same string in the language. An important starting point for the study of such cross-derivational properties is the notion ...

Since the early Sixties and Seventies it has been known that the regular and context-free languages are characterized by definability in the monadic second-order theory of certain structures. More recently, these descriptive characterizations have been ...

Language models for speech recognition typically use a probability model of the form Pr(a_n/a₁, a₂, .... a_n-1 Stochastic grammars, on the other hand, are typically used to assign structure to utterances. A language model of the above form is constructed ...

We present a new LR algorithm for tree-adjoining grammars. It is an alternative to an existing algorithm that is shown to be incorrect. Furthermore, the new algorithm is much simpler, being very close to traditional LR parsing for context-free grammars. ...

Weighted context-free grammars are a convenient formalism for representing grammatical constructions and their likelihoods in a variety of language-processing applications. In particular, speech understanding applications require appropriate grammars ...