Sciweavers

3190 search results - page 629 / 638
» Natural Language in Information Retrieval
Sort
View
SIGIR
1998
ACM
13 years 12 months ago
Fast Searching on Compressed Text Allowing Errors
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
Edleno Silva de Moura, Gonzalo Navarro, Nivio Zivi...
CIKM
1993
Springer
13 years 11 months ago
Collection Oriented Match
match algorithms that can efficiently handleAbstract complex tests in the presence of large amounts of data. Match algorithms that are capable of handling large amounts of On the o...
Anurag Acharya, Milind Tambe
CIKM
2007
Springer
13 years 11 months ago
A segment-based hidden markov model for real-setting pinyin-to-chinese conversion
Hidden markov model (HMM) is frequently used for Pinyin-toChinese conversion. But it only captures the dependency with the preceding character. Higher order markov models can brin...
Xiaohua Zhou, Xiaohua Hu, Xiaodan Zhang, Xiajiong ...
NAACL
2007
13 years 9 months ago
Entity Extraction is a Boring Solved Problem - Or is it?
This paper presents empirical results that contradict the prevailing opinion that entity extraction is a boring solved problem. In particular, we consider data sets that resemble ...
Marc Vilain, Jennifer Su, Suzi Lubar
ANLP
1994
108views more  ANLP 1994»
13 years 9 months ago
Does Baum-Welch Re-estimation Help Taggers?
In part of speech tagging by Hidden Markov Model, a statistical model is used to assign grammatical categories to words in a text. Early work in the field relied on a corpus which...
David Elworthy