Sciweavers

35 search results - page 5 / 7
» Learning Bigrams from Unigrams
Sort
View
SIGIR
2009
ACM
14 years 1 months ago
An improved markov random field model for supporting verbose queries
Recent work in supervised learning of term-based retrieval models has shown significantly improved accuracy can often be achieved via better model estimation [2, 10, 11, 17]. In ...
Matthew Lease
EACL
2006
ACL Anthology
13 years 8 months ago
Generalized Hebbian Algorithm for Incremental Singular Value Decomposition in Natural Language Processing
An algorithm based on the Generalized Hebbian Algorithm is described that allows the singular value decomposition of a dataset to be learned based on single observation pairs pres...
Genevieve Gorrell
CLEF
2007
Springer
14 years 1 months ago
Amharic-English Information Retrieval with Pseudo Relevance Feedback
We describe cross language retrieval experiments using Amharic queries and English language document collection from our participation in the bilingual ad hoc track at the CLEF 20...
Atelach Alemu Argaw
ANLP
1997
137views more  ANLP 1997»
13 years 8 months ago
Probabilistic and Rule-Based Tagger of an Inflective Language- a Comparison
We present results of probabilistic tagging of Czech texts in order to show how these techniques work for one of the highly morphologically ambiguous inflective languages. After d...
Jan Hajic, Barbora Hladká
EACL
2006
ACL Anthology
13 years 8 months ago
Discriminative Sentence Compression with Soft Syntactic Evidence
We present a model for sentence compression that uses a discriminative largemargin learning framework coupled with a novel feature set defined on compressed bigrams as well as dee...
Ryan T. McDonald