Articles

: It oftcn makes sense to employ both text and pictures wheu referring to world objects. In this pa- per, we present a model for referring which is based on the assumption that concepts may be activated not only by Icxt, but also by pictures and tcxt-pieturc combiniltious. By means …...

In this paper it is shown how simple texts that can be parsed in a Lambek Categorial Grammar can also automatically be provided with a semantics in the form of a Discourse Representation Structure in the sense of Kamp [1981]. The assignment of meanings to texts uses the Curry-Howard-Van Benthem …...

In this paper, we make use of linguistic knowledge to identify certain noun phrases, both in English and French, which are likely to be terms. We then test and cmnl)are (lifl'e.r- ent statistical scores to select the "good" ones among tile candidate terms, and finally propose a statistical method to …...

This paper describes our work on parsing Turk- ish using the lexical-functional grammar formalism. This work represents the first effort for parsing Turkish. Our implementation is based on Tomita's parser developed at Carnegie-Mellon University Center for Machine Transla- tion. The grammar covers a substantial subset of Turkish including simple and …...

. The behavioral specification of an obj~t-ori- cnted grammar model is considered. The model is based on full lexicalization, hcad-oricntation via valency con- straints and dependency relations, inhcritancc as a means for non-redundant lexicon specification, and conct, rrcncy of computation. The compntation model relies upon the actor l)aradigm, with concurrency …...

We present an efI]cient, broad-coverage, principle-based parser for English. The parser has been implemented in C++ and runs on SUN Sparcstations with X-windows. It con- rains a lexicon with over 90,000 entries, con- structed automatically by applying a set of ex- traction and conversion rules to entries from machine readable …...

The previously proposed semanlic-head-driw'.n Ken - eration methods run into problems if none of the daughter eonstituents in the syntact.o-semantic rule schemata of a grammar fits the definition of a semantic head given in [Shieber et al., 1990]. This is the case for the semantic analysis rnles of certain constraint- …...

Ideally, the time that an incremental algorithm uses to process a change should be a fimction of the size of the change rather than, say, the size of the entire current input. Based on a formalization of "the set of things changed" by an increInental modification, this paper investigates how …...

The goal of this study is to evaluate the potential for using large vocabulary continuous speech recognition as an engine for automatically classifying utterances according to the lan- guage being spoken. The problem of language identification is often thought of as being separate from the problem of speech recognition. But …...

The BYBLOS continuous speech recognition system is applied to on-line cursive handwriting recognition. By exploiting similarities between on-line cursive handwriting and continuous speech recogni- tion, we can use the same base system adapted to handwriting feature vectors instead of speech. The use of hidden Markov models obvi- ates the need …...

The output of handwritten word recognizers (Wit) tends to be very noisy due to various factors. In order to compensate for this behaviour, several choices of the WR must be ini- tially considered. In the case of handwritten sentence/phrase recognition, linguistic constraints may be applied in order to improve the …...

Because of the complexity of documents and the variety of ap- plications which must be supported, document understand- ing requires the integration of image understanding with text understanding. Our docum(,nt understanding technology is implemented in a system called IDUS (Intelligent Document Undcrstanding System), which creates the data for a text …...

Much interest already exists in the electronics research community for developing and integrating speech technology to a variety of ap- plications, ranging from voice-activated systems to automatic tele- phone transactions. This interest is particularly true in the field of aerospace where the training and operational demands on the crew have …...

We developed a faster search algorithm that avoids the use of the N-Best paradigm until after more powerful knowledge sources have been used. We found, however, that there was little or no decrease in word errors. We then showed that the use of the N-Best paradigm is still essential for …...

This paper describes an accurate and efficient algorithm for very-large-vocabulary continuous speech recognition based on an HMM-LR algorithm. The HMM-LR algorithm uses a generalized LR parser as a language model and hidden Markov models (HMMs) as phoneme models. To reduce the search space without pruning the correct candidate, we use …...

To achieve reasonable accuracy in large vocabulary speech recognition systems, it is important to use detailed acous- tic models together with good long span language models. For example, in the Wall Street Journal (WSJ) task both cross-word triphones and a trigram language model are neces- sary to achieve state-of-the-art performance. …...

Acquisition of semantic information is necessary for proper understanding of natural language text. Such information is often domain-speclfic in nature and must be acquized from the domain. This causes a problem whenever a natural fan- guage processing (NLP) system is moved from one domain to another. The portability of an …...

We show how the recognition performance of a speech recog- nition component in a speech retrieval system affects the retrieval effectiveness. A speech retrieval system facilitates content-based retrieval of speech documents, i.e. audio recordings containing spoken text. The speech retrieval pro- cess receives queries from users and for every query …...

In information retrieval, the content of a document may be represented as a collection of terms: words, stems, phrases, or other units derived or inferred from the text of the document. These terms are usually weighted to indicate their importance within the document which can then be viewed as a …...

The normal practice of selecting relevant documents for training routing queries is to either use all relevants or the 'best n' of them after a (retrieval) ranking operation with respect to each query. Using all relevants can introduce noise and ambiguities in training because documents can be long with many …...