This paper proposes the use of "patternbased" context-free grammars as a basis for building machine translation (MT) systems, which are now being adopted as personal too...
We extend the centering model for the resolution of intia-sentential anaphora and specify how to handle complex sentences. An empirical evaluation indicates that the functional in...
We report on a method for compiling decision trees into weighted finite-state transducers. The key assumptions are that the tree predictions specify how to rewrite symbols from an...
In transformation-based parsing, a finite sequence of tree rewriting rules are checked for application to an input structure. Since in practice only a small percentage of rules ar...
This paper describes the incremental generation of parse tables for the LR-type parsing of Tree Adjoining Languages (TALs). The algorithm presented handles modications to the inp...
This paper presents an architecture for the generation of spoken monologues with contextually appropriate intonation. A twotiered information structure representation is used in t...
This paper presents a quantitative evaluation of the portability to the stock market domain of the revision rule hierarchy used by the system STREAKto incrementally generate newsw...
We show how a general grammar may be automatically adapted for fast parsing of utterances from a specific domain by means of constituent pruning and grammar specialization based o...
In this paper, we present a new approach for word sense disambiguation (WSD) using an exemplar-based learning algorithm. This approach integrates a diverse set of knowledge source...