Sciweavers

4199 search results - page 70 / 840
» Generalizing Data in Natural Language
Sort
View
ICASSP
2009
IEEE
15 years 11 months ago
Resampling auxiliary data for language model adaptation in machine translation for speech
Performance of n-gram language models depends to a large extent on the amount of training text material available for building the models and the degree to which this text matches...
Sameer Maskey, Abhinav Sethy
IPM
2007
114views more  IPM 2007»
15 years 4 months ago
s-grams: Defining generalized n-grams for information retrieval
For European languages, n-gram has proved to be the cost effective alternative to morphological processing during indexing task and it has been studied and analyzed extensively us...
Anni Järvelin, Antti Järvelin, Kalervo J...
ICDM
2008
IEEE
136views Data Mining» more  ICDM 2008»
15 years 11 months ago
Generalized Framework for Syntax-Based Relation Mining
Supervised approaches to Data Mining are particularly appealing as they allow for the extraction of complex relations from data objects. In order to facilitate their application i...
Bonaventura Coppola, Alessandro Moschitti, Daniele...
KDD
2009
ACM
200views Data Mining» more  KDD 2009»
15 years 11 months ago
Visual analysis of documents with semantic graphs
In this paper, we present a technique for visual analysis of documents based on the semantic representation of text in the form of a directed graph, referred to as semantic graph....
Delia Rusu, Blaz Fortuna, Dunja Mladenic, Marko Gr...
FSTTCS
1993
Springer
15 years 8 months ago
Induce-Statements and Induce-Expressions: Constructs for Inductive Programming
A for-loop is somewhat similar to an inductive argument. Just as the truth of a proposition P(n + 1) depends on the truth of P(n), the correctness of iteration n+1 of a for-loop de...
Theodore S. Norvell