Sciweavers

93 search results - page 8 / 19
» Fast Searching on Compressed Text Allowing Errors
Sort
View
ICASSP
2009
IEEE
14 years 2 months ago
Spoken term detection using fast phonetic decoding
While spoken term detection (STD) systems based on word indices provide good accuracy, there are several practical applications where it is infeasible or too costly to employ an L...
Roy Wallace, Robbie Vogt, Sridha Sridharan
IUI
2003
ACM
14 years 21 days ago
Abbreviated text input
We address the problem of improving the efficiency of natural language text input under degraded conditions (for instance, on PDAs or cell phones or by disabled users) by taking a...
Stuart M. Shieber, Ellie Baker
UIST
1995
ACM
13 years 11 months ago
Speech for Multimedia Information Retrieval
We describe the Informediatm News-on-Demand system. News-on-Demand is an innovative example of indexing and searching broadcast video and audio material by text content. The fully...
Alexander G. Hauptmann, Michael J. Witbrock, Alexa...
CATA
1998
13 years 8 months ago
QVI: Query-based virtual index for distributed information retrieval
The large unstructured text collections demand full-text search capabilities from IR systems. Current systems typically allow users only to connect to a single database (or site) ...
Dong-gyu Kim, Sang-goo Lee
CPM
2008
Springer
148views Combinatorics» more  CPM 2008»
13 years 9 months ago
On-Line Approximate String Matching with Bounded Errors
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
Marcos A. Kiwi, Gonzalo Navarro, Claudio Telha