Articles

Frequency information on co-occurrence patterns can be automati- cally collected from a syntactically analyzed corpus; this information can then serve as the basis for selectional constraints when analyz- ing new text from the same domain. Better coverage of the domain can be obtained by appropriate generalization of the specific word …...

This paper reports a new method for suggesting word associations, based on a greedy algorithm that employs Chi- square statistics on joint frequencies of pairs of word groups compared against chance co-occurrence. The benefits of this new approach are: 1) we can consider even low frequency words and word pairs, …...

In this paper we describe a new technique for parsing free text: a transformational grammar I is automatically learned that is capable of accurately parsing text into binary-branching syntactic trees with nonterminals unlabelled. The algorithm works by beginning in a very naive state of knowledge about phrase structure. By repeatedly …...

I present an entropy measure for evaluating parser performance. The measure is fine-grained, and permits us to evaluate performance at the level of individual phrases. The parsing problem is characterized as statistically approximating the Penn Treebank annotations. I consider a series of models to "calibrate" the measure by determining what …...

This paper I describes a speech to speech translation system using standard components and a suite of generalizable cus- tomization techniques. The system currently translates air travel planning queries from English to Swedish. The modu- lax architecture is designed to be easy to port to new domains and languages, and …...

This paper reports results of the 1992 Evaluation of machine translation (MT) systems in the DARPA MT initiative and results of a Pre-test to the 1993 Evaluation. The DARPA initiative is unique in that the evaluated systems differ radically in languages translated, theoretical approach to system design, and intended end-user …...

Although automatic machine translation (MT) of unconstrained text is beyond the state of the art today, the need for increased translator productivity is urgent. The PANI3LOSS system addresses this dilemma by integrating MT with machine-aided translation (MAT). The main measure of progress in the development of the PANGLOSS system is …...

In this paper we present the first implementation of LING- STAT, an interactive machine translation system designed to increase the productivity of a user, with little knowledge of the source language, in translating or extracting information from foreign language documents. In its final form, LING- STAT will make use of …...

This paper describes efforts underway to construct a large- scale ontology to support semantic processing in the PAN- GLOSS knowledge-base machine translation system. Be- cause we axe aiming at broad sem~tntic coverage, we are focus- ing on automatic and semi-automatic methods of knowledge acquisition. Here we report on algorithms for …...

We describe a general framework for encoding rich domain mod- els and sophisticated plan reasoning capabilities. The approach uses graph-basedreasoning to address a wide range of tasks that typically arise in dialogue systems. The graphical plan representation is inde- pendent of but connected to the underlying representation of action and …...

A slriking difference between the interactions that students have with human tutors and those they have with computer-based instruction systems is that human tutors frequently refer to their own previous explanations. Based on a study of human-human instructional inter- actions, we are categorizing the uses of previous discourse and are …...

This paper describes a multilingual data extraction system under development for the Department of Defense (Do[)). The system, called Murasa.ki, processes Spanish and Japanese newspaper articles reporting AIDS disease statistics. Key to Murasaki's design is its language-independent and domain-independent architecture. The system consists of shared processing modules across the three …...

The Slot Grammar system is interesting for natural language applica- tions because it can deliver parses with deep grammatical information on a reasonably broad scale. The paper describes a numerical scoring system used in Slot Grammar for ambiguity resolution, which not only ranks parses but also contributes to parsing efficiency …...

We take for granted that sentences describe situations [2, 12]. One of the most important properties of situations are then their tempo- ral locations, which are indicated by tense and aspect and temporal adverbials in the surface form. In [10, 22], we offered a formal the- ory for English tense …...

In this paper we exhibit a novel approach to the problems of topic and speaker identification that makes use of a large vocabulary continuous speech recognizer. We present a theo- retical framework which formulates the two tasks as comple- mentary problems, and describe the symmetric way in which we have …...

The word-spotting task is analogous to text-based infor- marion retrieval tasks and message-understanding tasks in that an exhaustive accounting of the input is not required: only a useful subset of the full information need be extracted in the task. Tradi- tional approaches have focussed on the keywords involved. We have …...

Over the last decade technological advances have been made which en- able us to envision real-world applications of speech technologies. It is possible to foresee applications where the spoken query is to be recognized without even prior knowledge of the language being spoken, for exana- pie, information centers in public …...

Tied-mixture (or semi-continuous) distributions are an im- portant tool for acoustic modeling, used in many high- performance speech recognition systems today. This paper provides a survey of the work in this area, outlining the different options available for tied mixture modeling, intro- ducing algorithms for reducing training time, and provid- …...

This paper deals with search algorithms for real-time speech recog- nition. We argue that software-only speech recognition has several critical advantages over using special or parallel hardware. We present a history of several advances in search algorithms, which together, have made it possible to implement real-time recogni- tion of large …...

We describe a technique we call Progressive Search which is useful for developing and implementing speech recognition systems with high computational requirements. The scheme iteratively uses more and more complex recognition schemes, where each iteration constrains the search space of the next. An algorithm, the Forward-Backward Word-Life Algorithm, is described. …...