Articles

A basic problem that must be dealt with in order to build an intelligent tutoring system (ITS) in the domain of foreign language teaching is that of establishing what kind of grammatical knowledge has to be included in the domain expert module. Two basic options are possible: (i) to use …...

Prosodic Inheritance (PI) morphology pro- vides uniform treatment of both concatenative and non-concatenative morphological and phonological generalisations using default inheri- tance. Models of an extensive range of German Umlaut and Arabic intercalation facts, imple- mented in DATR, show that the PI approach also covers 'hard cases' more homogeneously and more …...

Certain pairs or groups of sentences appear to be semantically distinct, yet specify the same underlying state of affairs, from different per- spectives. This leads to questions about what that underlying state of affairs might be, and, for generation, how and why the alternative ex- pressions might be produced. This …...

A new approach to structure-driven generation is I)resented that is based on a separate seman- tics as input structure. For the first time, a GPSG- based formalism is complemented with a system of pattern-action rules that relate the parts of a se- mantics to appropriate syntactic rules. This way a …...

Current approaches to generating multi-sentence text fail to consider what the user may infer from the dif- ferent statements in a description. This paper presents a system which contains an explicit model of the infer- ences that people may make from different statement types, and uses this model, together with …...

The paper presents a morpho-lexical environ- ment, designed for the management of root- oriented natural language dictionaries. It also encapsulates the basic morpho-lexical processings: analysis and synthesis of individual word-forms or compounds (idioms and analytic constructions)....

Logical approaches to linguistic description, particu- larly those which employ feature structures, have generally treated phonology as though it was the same as orthography. This approach breaks down for languages where the phono- logical shape of a morpheme can be heavily dependent on the phonological shape of another, as is …...

This paper presents a human-machine dia- logue model in the field of task-oriented dialogues. The originality of this model resides in the clear separation of dialogue knowledge from task knowl- edge in order to facilitate for the modeling of di- alogue strategies and the maintenance of dialogue coherence. These two …...

What is the relationship between syntax, prosody and phonetics? This paper argues for a declarative constraint-based theory, in which each step in a derivation adds diverse constraints to a pool. Some of these describe well formed objects in the feature structure domain, in terms of both syntactic and prosodic features. …...

This paper proposes an LR parsing algorithm modified for grammars with feature-based categories. The proposed algorithm does not instantiate categories during preprocessing of a grammar as proposed elsewhere. As a result, it constructs a minimal size of GOTO/ACTION table and eliminates the necessity of search for GOTO table entries during …...

In this document, we present a language which associates type construction principles to constraint logic programming. We show that it is very appropriate for language processing, providing more uniform, expressive and efficient tools and treatments. We introduce three kinds of constraints, that we exemplify by motivational examples. Finally, we give …...

Command relations are important tools in linguistics, especially in anaphora theory. In this paper I present an indexing technique which allows us to implement a simple and efficient check for most cases of command relations which have been presented in linguistic literature. I also show a wide perspective of applications …...

This work is concerned with the development of instruments for GB parsing. An alternative to the well known indexation system of (Chomsky, 1981) will be proposed and then used to formalize the view of Binding Theory in terms of the generation of constraints on the referential properties of the NPs …...

In this paper a bidirectional parser for Lexicalized Tree Adjoining Grammars will be presented. The algorithm takes advantage of a peculiar characteristic of Lexicalized TAGs, i.e. that each elementary tree is associated with a lexical item, called its anchor. The algorithm employs a mixed strategy: it works bot- tom-up from …...

This paper analyses the syntax and seman- tics of English comparatives, and some types of ellipsis. It improves on other recent analy- ses in the computational linguistics literature in three respects: (i) it uses no tree- or logical-form rewriting devices in building meaning represen- tations (ii) this results in a …...

This i)al)er describes a Ilatural language i)ars - ing algorith,n for unrestricted text which uses a prol)al)ility-I~ased scoring function to select the "l)est" i)arse of a sclfl,ence. The parser, T~earl, is a time-asynchronous I)ottom-ul) chart parser with Earley-tyl)e tol)-down prediction which l)ur - sues the highest-scoring theory iu the chart, …...

This paper presents a unification pro- cedure which eliminates the redundant copying of structures by using a lazy in- cremental copying appr0a~:h to achieve structure sharing. Copying of structures accounts for a considerable amount of the total processing time. Several meth- ods have been proposed to minimize the amount of …...

This paper presents a computational model of how conversational participants collaborate in making re- ferring expressions. The model is based on the plan- ning paradigm. It employs plans for constructing and recognizing referring expressions and meta-plans for constructing and recognizing clarifications. This al- lows the model to account for the …...

Unification of disjunctive feature descriptions is important for efficient unification-based pars- ing. This paper presents constraint projection, a new method for unification of disjunctive fea- ture structures represented by logical constraints. Constraint projection is a generalization of con- straint unification, and is more efficient because constraint projection has a mechanism …...

Integration of language constraints into a large vocabulary speech recognition system often leads to prohibitive complexity. We propose to factor the constraints into two components. The first is characterized by a covering grammar which is small and easily integrated into existing speech recognizers. The recognized string is then decoded by …...