Articles

This paper describes applications of stochastic and symbolic NLP methods to treebank anno- tation. In paxticular we focus on (1) the au- tomation of treebank annotation, (2) the com- parison of conflicting annotations for the same sentence and (3) the automatic detection of in- consistencies. These techniques are currently employed …...

The performance of PCFGs estimated from tree banks is shown to be sensitive to the par- ticular way in which linguistic constructions are represented as trees in the tree bank. This paper presents a theoretical analysis of the effect of different tree representations for PP attachment on PCFG models, and …...

This paper describes the conversion of a Hid- den Markov Model into a finite state trans- ducer that closely approximates the behavior of the stochastic model. In some cases the transducer is equivalent to the HMM. This conversion is especially advantageous for part- of-speech tagging because the resulting trans- ducer …...

This paper is an outline of a statistical learn- ing algorithm for information extraction sys- tems. It is based on a lexicaUy intensive anal- ysis of a small number of texts that belong to one domain and provides a robust lemma- tisation of the word forms and the collection of …...

In syntax, the trend nowadays is towards lexiealized grammar formalisms. It is now widely accepted that dividing words into wordclasses may serve as a labor-saving mechanism - but at the same time, it discards all detailed information on the idiosyncratic behavior of words. And that is exactly the type of …...

We present results of experiments with Elman recurrent neural networks (Elman, 1990) trained on a natural language processing task. The task was to learn sequences of word categories in a text derived from a primary school reader. The grammar induced by the network was made explicit by cluster analysis which …...

We present preliminary results of experiments with two types of recurrent neural networks for a natural language learning task. The neural networks, Elman networks and Recurrent Cascade Correlation (RCC), were trained on the text of a first-year primary school reader. The networks performed a one-step-look-ahead task, i.e. they had to …...

In this paper we present results on developing ro- bust natural language interfaces by combining shal- low and partial interpretation with dialogue manage- ment. The key issue is to reduce the effort needed to adapt the knowledge sources for parsing and in- terpretation to a necessary minimum. In the paper …...

This paper describes novel results on the char- actcristics of three-party dialogues by quantita- tively comparing them with those of two-party. In previous dialogue research, two-party dia- logues are mainly focussed because data col- lection of multi-party dialogues is difficult and there are very few theories handling them, al- though …...

We demonstrate the feasibility of using unary primes in speech-driven language processing. Proponents of Government Phonology (one of several phonological frameworks in which speech segments are represented as combinations of relatively few subsegmental primes) claim that primes are acoustically realisable. This claim is examined critically searching out signatures for primes …...

After extracting terms from a corpus of titles and abstracts in English, syntactic variation relations are identified amongst them in order to detect research topics. Three types of syntactic variations were studied : permutation, expansion and substitution. These syntactic variations yield other relations of formal and conceptual nature. Basing on …...

We present an empirical study of the applica- bility of Probabilistic Lexicalized Tree Inser- tion Grammars (PLTIG), a lexicalized counter- part to Probabilistic Context-Free Grammars (PCFG), to problems in stochastic natural- language processing. Comparing the perfor- mance of PLTIGs with non-hierarchical N-gram models and PCFGs, we show that PLTIG com- …...

~:aditional accounts of quantifier scope em- ploy qualitative constraints or rules to account for scoping preferences. This paper outlines a feature-based parsing algorithm for a gram- mar with multiple simultaneous levels of repre- sentation, one of which corresponds to a par- tial ordering among quantifiers according to scope. The optimal …...

The multiplicative fi'agment of linear logic has found a number of applications in computa- tional linguistics: in the "glue language" ap- proach to LFG semantics, and in the formu- lation and parsing of various categorial gram- mars. These applications call for efficient de- duction methods. Although a number of de- …...

We present a connectionist architecture and demon- strate that it can learn syntactic parsing from a cor- pus of parsed text. The architecture can represent syntactic constituents, and can learn generalizations over syntactic constituents, thereby addressing the sparse data problems of previous connectionist ar- chitectures. We apply these Simple Synchrony …...

This paper proposes a method by which 5W1H (who, when, where, what, why, how, and predicate) infor- mation is used to classify and navigate Japanese- language texts. 5WlH information, extracted from text data, has an access platform with three func- tions: episodic retrieval, multi-dimensional classi- fication, and overall classification. In …...

Resource adaptivity: Because the sets of struc- Natural language parsing is conceived to be a pro- cedure of disambiguation, which successively re- duces an initially totally ambiguous structural rep- resentation towards a single interpretation. Graded constraints are used as means to express well- formedness conditions of different strength and to …...

One of the major problems when translating from Japanese into a European language such as German or English is to determine definiteness of noun phrases in order to choose the correct determiner in the target language. Even though in Japanese, noun phrase reference is said to de- pend in large …...

This l)al)er describes novel and practical .lal)anesc parsers that uses decision trees, l"irst, we COl> struct a single, decision tree to estimate modifica-- lion probabilities; how one phrase tends t.o modify another. Next, we introduce a boosting algorithm in which several decision t.rees are COllst.ructed and then combined for probalfility …...

This paper reports the results of a preliminary experiment on the detection of semantic vari- ants of terms in a French technical document. The general goal of our work is to help the struc- turation of terminologies. Two kinds of seman- tic variants can be found in traditional termi- nologies …...