Applying Bayesian belief networks in approximate string matching for robust keyword-based retrieval

2004 IEEE International Conference on Multimedia and Expo (ICME)

Volumn 3, Issue , 2004, Pages 1999-2002

  Schuller, Björn ^a   Müller, Ronald ^a   Rigoll, Gerhard ^a   Lang, Manfred ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; DATABASE SYSTEMS; DIGITAL SIGNAL PROCESSING; ONLINE SYSTEMS; PROBABILISTIC LOGICS; THEOREM PROVING;

ARCHIVES; BAYESIAN BELIEF NETWORKS; KEYWORD BASED RETRIEVAL; STRING MATCHING;

CONTENT BASED RETRIEVAL;

EID: 11244305954     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (4)

1. V. Levenstein: "Binary codes capable of correcting insertions and reversals," Soviet Physics Doklady, 10:707-710, 1966.
2. G. Navarro: "A Guided Tour to Approximate String Matching," ACM Computing Surveys, 33(1), pp. 31-88, 2001.
3. F. V. Jensen: An Introduction to Bayesian Networks, UCL Press, 1996.
4. U. Quasthoff, et al.: Projekt Deutscher Wortschatz, University of Leipzig, Institute of Computer Science, http://wortschatz.informatik.uni- leipzig.de.