scispace - formally typeset
Search or ask a question
Topic

Approximate string matching

About: Approximate string matching is a research topic. Over the lifetime, 1903 publications have been published within this topic receiving 62352 citations. The topic is also known as: fuzzy string-searching algorithm & fuzzy string-matching algorithm.


Papers
More filters
Proceedings ArticleDOI
16 Oct 2006
TL;DR: The problem of string matching is posed as a maximum a posteriori probability (MAP) alignment of the string sequences for shapes and the shape edit distance is computed by finding the sequence of string edit operations which minimizes the cost of the path traversing the edit lattice.
Abstract: We present a new distance for the contour-based shapes recognition which we called shape edit distance (SED). Unlike the traditional distance, SED takes into account the spatial deformation of shapes. To compute the shape edit distance, we convert shapes to string sequences so that string matching techniques can be used. We pose the problem of string matching as a maximum a posteriori probability (MAP) alignment of the string sequences for shapes and compute the shape edit distance by finding the sequence of string edit operations which minimizes the cost of the path traversing the edit lattice. Experiments demonstrate the utility of the shape edit distance on a number of image retrieval and clustering problems

5 citations

Journal Article
Xie Gaogang1
TL;DR: RoSunday algorithm adds a conditional statement before the starting of comparing to reduce the times of attempts and enhance the matching speed.
Abstract: String matching algorithm is a very important issue in network monitor and audit area.Several classical string matching algorithms are discussed,and a new algorithm named RoSunday based on Sunday algorithm is proposed.RoSunday algorithm adds a conditional statement before the starting of comparing to reduce the times of attempts and enhance the matching speed.The performance of this improved algorithm is analyzed.The experimental results prove the effectiveness of it.

5 citations

Journal ArticleDOI
TL;DR: This paper considers the case where bits of i may be stuck, either in a consistent or transient manner, and formally defines the corresponding approximate pattern matching problems, and provides efficient algorithms for their resolution.

5 citations

Journal ArticleDOI
10 Dec 2019
TL;DR: In this paper, the Damerau-Levenshtein Distance Approximate String Matching algorithm was used to calculate the editing distance of each word in a keywords with each word from the Indonesian word dictionary.
Abstract: Searching is one of the important features on the website, but it is not uncommon for users to make typos when typing keywords. Typing errors of these keywords is usually referred to as typo. This study aims to build a system by providing suggestions for correcting typos in the search feature. Keywords search correction are obtained using the Damerau-Levenshtein Distance Approximate String Matching algorithm by to calculate the editing distance of each word in a keywords with each word in the Indonesian word dictionary. Testing was carried out as many as 40 experiments, with 10 keywords and 250 articles taken randomly. The test results show the Damerau-Levenshtein Distance algorithm is able to provide precision and recall values of 91.24% and 89.58% in providing keyword improvement suggestions. With the improvement of the system, each trial increases with precision value of 0.80 and recall value of 0.98

5 citations


Network Information
Related Topics (5)
Server
79.5K papers, 1.4M citations
81% related
Cluster analysis
146.5K papers, 2.9M citations
80% related
Scheduling (computing)
78.6K papers, 1.3M citations
79% related
Network packet
159.7K papers, 2.2M citations
78% related
Optimization problem
96.4K papers, 2.1M citations
78% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20238
202230
202132
202030
201948
201839