Results 1 - 10 of 6,671

ON INDEX LANGUAGES by

by Cyril W. Cleverdon
"... saw the lifting of the security restrictions on large numbers of scientific and technical reports which had been written during World War Two. Pre-war virtually all publication had been in journals, and the report format was strange and unfamiliar, both for the scientific community and for librarian ..."
Abstract - Add to MetaCart
in revealing and making accessible the intellectual content of the papers. At that time there were two conventional types of index and two major indexing techniques. An index could be in the form of a card catalogue, as found in most libraries, or alternatively in printed form as, for example, an annual

Indexed Languages and Unication Grammars

by Tore Burheim
"... Indexed languages are interesting in computational linguistics because they are the least class of languages in the Chomsky hierarchy that has not been shown not to be adequate to describe the string set of natural language sen-tences. We here dene a class of unication grammars that exactly describe ..."
Abstract - Add to MetaCart
Indexed languages are interesting in computational linguistics because they are the least class of languages in the Chomsky hierarchy that has not been shown not to be adequate to describe the string set of natural language sen-tences. We here dene a class of unication grammars that exactly

A Language Modeling Approach to Information Retrieval

by Jay M. Ponte, W. Bruce Croft , 1998
"... Models of document indexing and document retrieval have been extensively studied. The integration of these two classes of models has been the goal of several researchers but it is a very difficult problem. We argue that much of the reason for this is the lack of an adequate indexing model. This sugg ..."
Abstract - Cited by 1154 (42 self) - Add to MetaCart
an approach to retrieval based on probabilistic language modeling. We estimate models for each document individually. Our approach to modeling is non-parametric and integrates document indexing and document retrieval into a single model. One advantage of our approach is that collection statistics which

Context-free characterizations of indexed languages

by El Makki Voundy
"... Indexed languages are languages recognized by pushdown automata of level 2 and by indexed grammars. We propose here some new charac-terizations linking indexed languages to context-free languages: the class of indexed languages is the image of the Dyck language by a nice class of context-free transd ..."
Abstract - Add to MetaCart
Indexed languages are languages recognized by pushdown automata of level 2 and by indexed grammars. We propose here some new charac-terizations linking indexed languages to context-free languages: the class of indexed languages is the image of the Dyck language by a nice class of context

On Infinite Words Determined by Indexed Languages?

by Tim Smith
"... Abstract. We characterize the infinite words determined by indexed languages. An infinite language L determines an infinite word α if every string in L is a prefix of α. If L is regular or context-free, it is known that α must be ultimately periodic. We show that if L is an indexed language, then α ..."
Abstract - Add to MetaCart
Abstract. We characterize the infinite words determined by indexed languages. An infinite language L determines an infinite word α if every string in L is a prefix of α. If L is regular or context-free, it is known that α must be ultimately periodic. We show that if L is an indexed language, then α

Using collaborative filtering to weave an information tapestry

by David Goldberg, David Nichols, Brian M. Oki, Douglas Terry - Communications of the ACM , 1992
"... predicated on the belief that information filtering can be more effective when humans are involved in the filtering process. Tapestry was designed to support both content-based filtering and collaborative filtering, which entails people collaborating to help each other perform filtering by recording ..."
Abstract - Cited by 953 (4 self) - Add to MetaCart
by recording their reactions to documents they read. The reactions are called annotations; they can be accessed by other people’s filters. Tapestry is intended to handle any incoming stream of electronic documents and serves both as a mail filter and repository; its components are the indexer, document store

A Shrinking Lemma for Indexed Languages

by Robert H. Gilman - Theoretical Computer Science , 1996
"... Abstract. This article presents a lemma in the spirit of the pumping lemma for indexed languages but easier to employ. Section 1. Introduction. The pumping lemma for context-free languages has been extended to stack languages [O] and indexed languages [H], but these generalizations are rather compli ..."
Abstract - Cited by 11 (1 self) - Add to MetaCart
Abstract. This article presents a lemma in the spirit of the pumping lemma for indexed languages but easier to employ. Section 1. Introduction. The pumping lemma for context-free languages has been extended to stack languages [O] and indexed languages [H], but these generalizations are rather

Unsupervised Learning by Probabilistic Latent Semantic Analysis

by Thomas Hofmann - Machine Learning , 2001
"... Abstract. This paper presents a novel statistical method for factor analysis of binary and count data which is closely related to a technique known as Latent Semantic Analysis. In contrast to the latter method which stems from linear algebra and performs a Singular Value Decomposition of co-occurren ..."
Abstract - Cited by 618 (4 self) - Add to MetaCart
Maximization algorithm for model fitting, which has shown excellent performance in practice. Probabilistic Latent Semantic Analysis has many applications, most prominently in information retrieval, natural language processing, machine learning from text, and in related areas. The paper presents perplexity

Global Index Languages

by M. Castaño, José M. Castaño , 2004
"... Debes amar la arcilla que va en tus manos debes amar su arena hasta la locura y si no, no lo emprendas, que será en vano S. Rodríguez. vii ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Debes amar la arcilla que va en tus manos debes amar su arena hasta la locura y si no, no lo emprendas, que será en vano S. Rodríguez. vii

A maximum likelihood approach to continuous speech recognition

by Lalit R. Bahl, Frederick Jelinek, Robert, L. Mercer - IEEE Trans. Pattern Anal. Machine Intell , 1983
"... Abstract-Speech recognition is formulated as a problem of maximum likelihood decoding. This formulation requires statistical models of the speech production process. In this paper, we describe a number of sta-tistical models for use in speech recognition. We give special attention to determining the ..."
Abstract - Cited by 477 (9 self) - Add to MetaCart
the parameters for such models from sparse data. We also describe two decoding methods, one appropriate for constrained artificial languages and one appropriate for more realistic decoding tasks. To illustrate the usefulness of the methods described, we review a number of decoding results that have been obtained
Results 1 - 10 of 6,671