Offline Approximate String Matching forInformation Retrieval : An experiment on technical documentation
Approximate string matching consists in identifying strings as similar even ifthere is a number of mismatch between them. This technique is one of thesolutions to reduce the exact matching strictness in data comparison. In manycases it is useful to identify stream variation (e.g. audio) or word decl...
Main Author: | Dubois, Simon |
---|---|
Format: | Others |
Language: | English |
Published: |
Tekniska Högskolan, Högskolan i Jönköping, JTH. Forskningsmiljö Informationsteknik
2013
|
Subjects: | |
Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-22566 |
Similar Items
-
APPLYING A Q-GRAM BASED MULTIPLE STRING MATCHING ALGORITHM FOR APPROXIMATE MATCHING
by: Robert Susik
Published: (2017-09-01) -
Efficient and effectiveness retrieval of information using some of the approximate string matching algorithms
by: Anhar Mohammed, et al.
Published: (2008-09-01) -
Intuitionistic Fuzzy Automaton for Approximate String Matching
by: K.M. Ravi, et al.
Published: (2014-03-01) -
A Comparative Study for String Metrics and the Feasibility of Joining them as Combined Text Similarity Measures
by: Safa S. Abdul-Jabbar, et al.
Published: (2017-11-01) -
Supporting Uncertain Predicates in DBMS Using Approximate String Matching and Probabilistic Databases
by: Amol S. Jumde, et al.
Published: (2020-01-01)