Filters








44,316 Hits in 5.8 sec

A Comparative Study of String Dissimilarity Measures in Structural Clustering [chapter]

Ana L. N. Fred, José M. N. Leitão
1999 International Conference on Advances in Pattern Recognition  
on the concept of reduction in grammatical complexity; string matching and error-correcting parsing.  ...  Test examples include: synthetic data, with variable length strings; text analysis; and contour images.  ...  ACKNOWLEDGEMENTS This work was partially supported by the projects PECS/C/SAU/212/95 and PRAXIS 2/2.1/ TIT/1580/95.  ... 
doi:10.1007/978-1-4471-0833-7_39 fatcat:23k3jnshyfcr3aat6fr3aafmam

A Survey of Text Matching Techniques

A. Alqahtani, H. Alhakami, T. Alsubait, A. Baz
2021 Engineering, Technology & Applied Science Research  
Text matching is the process of identifying and locating particular text matches in raw data. Text matching is a vital component in practical applications and an essential process in several fields.  ...  , string-based, and hybrid similarities).  ...  first organizing and structuring the data in a particular fashion before subjecting them to qualitative and quantitative analysis Depends on other methods.  ... 
doi:10.48084/etasr.3968 fatcat:nxttwlssdzgxrpwlzspb6diufa

Approximate String Matching [chapter]

1994 String Searching Algorithms  
Approximate matching of strings is reviewed with the aim of surveying techniques suitable for finding an item in a database when there may be a spelling mistake or other error in the keyword.  ...  For sinuiarity problems difference measures are surveyed, with a full description of the wellestablmhed dynamic programming method relating this to the approach using probabilities and likelihoods.  ...  It is a pleasure, too, to thank the Associate Editor, Bruce Weide, and the referees for their help in preparing this manuscript, and in (dare we say) spotting numerous spelling mistakes. DAME64  ... 
doi:10.1142/9789814317368_0005 fatcat:odpamuih3beojgxvpfn3f3iyx4

Approximate String Matching

Patrick A. V. Hall, Geoff R. Dowling
1980 ACM Computing Surveys  
Approximate matching of strings is reviewed with the aim of surveying techniques suitable for finding an item in a database when there may be a spelling mistake or other error in the keyword.  ...  For sinuiarity problems difference measures are surveyed, with a full description of the wellestablmhed dynamic programming method relating this to the approach using probabilities and likelihoods.  ...  It is a pleasure, too, to thank the Associate Editor, Bruce Weide, and the referees for their help in preparing this manuscript, and in (dare we say) spotting numerous spelling mistakes. DAME64  ... 
doi:10.1145/356827.356830 fatcat:zigzo2hlejc63l6i332zuiraqe

Aparametric investigation of multiletter matches

Robert W. Proctor, Philip W. Hurst
1982 Perception & Psychophysics  
Because comparison across studies is always a tenuous process and because the absence of several relevant conditions precluded a complete analysis of predictions, a within-experiment manipulation of the  ...  He also argued that these variables were critical in multiletter matches, and performed a between-study comparison of existing data to support his contention.  ...  of these proposed mechanisms. that employed longer string lengths (e.g., Bruder, 1978; 3-6 letters) are excluded because patterns beyond the length of 4 appear to require multiple glances, and, as a  ... 
doi:10.3758/bf03204871 pmid:7133951 fatcat:c3kd62zktfgdjhoad7jn7utdga

Approximate String Matching using a Bidirectional Index [article]

Gregory Kucherov, Kamil Salikhov, Dekel Tsur
2015 arXiv   pre-print
We study strategies of approximate pattern matching that exploit bidirectional text indexes, extending and generalizing ideas of Lam et al.  ...  on efficient search schemes, and finally, provide experimental computations supporting the superiority of our strategies.  ...  GK has been supported by the ABS2NGS grant of the French government (program Investissement d'Avenir ) as well as by a EU Marie-Curie Intra-European Fellowship for Carrier Development.  ... 
arXiv:1310.1440v3 fatcat:r4s3ammfzzcc3opce5nppscsu4

Automatic Classification to Matching Patterns for Process Model Matching Evaluation

Elena Kuss, Heiner Stuckenschmidt
2017 International Conference on Conceptual Modeling  
In this paper, we propose an evaluation by automatic classification of the alignments to matching patterns. On the one hand, to understand strength and weaknesses of a matching technique.  ...  On the other hand, to identify potential for further improvement. Consequently, optimal matching scenarios of a specific matcher can be derived.  ...  We thank Kristian Kolthoff for his work on implementing the automatic assignment of the problem categories.  ... 
dblp:conf/er/KussS17 fatcat:gy4fjx27mzc45ihyllg3t5q3na

Approximate string matching using a bidirectional index

Gregory Kucherov, Kamil Salikhov, Dekel Tsur
2016 Theoretical Computer Science  
We study strategies of approximate pattern matching that exploit bidirectional text indexes, extending and generalizing ideas of [5] .  ...  on efficient search schemes, and finally, provide experimental computations supporting the superiority of our strategies.  ...  GK has been supported by the ABS2NGS grant of the French government (program Investissement d'Avenir ) as well as by a EU Marie-Curie Intra-European Fellowship for Carrier Development.  ... 
doi:10.1016/j.tcs.2015.10.043 fatcat:o3io5otmcreorggsxjgxwj4q6u

Approximate String Matching Using a Bidirectional Index [chapter]

Gregory Kucherov, Kamil Salikhov, Dekel Tsur
2014 Lecture Notes in Computer Science  
We study strategies of approximate pattern matching that exploit bidirectional text indexes, extending and generalizing ideas of [5] .  ...  on efficient search schemes, and finally, provide experimental computations supporting the superiority of our strategies.  ...  GK has been supported by the ABS2NGS grant of the French government (program Investissement d'Avenir ) as well as by a EU Marie-Curie Intra-European Fellowship for Carrier Development.  ... 
doi:10.1007/978-3-319-07566-2_23 fatcat:ocef5ye4gvd5bm7wsdsld4bx34

Entropy-Based Approach in Selection Exact String-Matching Algorithms

Ivan Markić, Maja Štula, Marija Zorić, Darko Stipaničev
2020 Entropy  
The proposed approach is limited to on-line exact string-matching problems based on information entropy for a search pattern.  ...  The existence of a plethora of string-matching algorithms makes it hard to choose the best one for any particular case.  ...  The model proposes a more efficient algorithm for string matching for a given pattern based on the entropy class to which the observed pattern belongs.  ... 
doi:10.3390/e23010031 pmid:33379282 fatcat:jbw5ovzfsrh3bdnoczblqbzcdu

Similarity Measures and Clustering of String Patterns [chapter]

Ana Fred
2003 Pattern Recognition and String Matching  
The distinction between string matching and structural resemblance is stressed.  ...  A clustering of structural patterns consists of an unsupervised association of data based on the similarity of their structures and primitives.  ...  Acknowledgments This work was partially supported by the Portuguese Foundation for Science and Technology (FCT), Portuguese Ministry of Science and Technology, and FEDER, under grant POSI/33143/SRI/2000  ... 
doi:10.1007/978-1-4613-0231-5_7 fatcat:ntxyaqvk5re7xc6abdd54s7umm

A novel algorithm for online inexact string matching and its FPGA implementation [article]

Alessandro Cinti, Filippo Maria Bianchi, Alessio Martino, Antonello Rizzi
2018 arXiv   pre-print
This paper introduces a novel algorithm for Online Approximate String Matching (OASM) able to filter shadow hits on the fly, according to general purpose priority rules that greedily assign priorities  ...  An FPGA hardware implementation of OASM is proposed and compared with a serial software version.  ...  Introduction Approximate String Matching (ASM) studies the problem of matching two generic strings defined on the same alphabet and, unlike in Exact String Matching, a level of inexactness is allowed:  ... 
arXiv:1712.03560v2 fatcat:5tv4cjos3vdpdio4byrulf7gyu

A k-mismatch string matching for generalized edit distance using diagonal skipping method

HyunJin Kim
2021 PLoS ONE  
This paper proposes an approximate string matching with k-mismatches when calculating the generalized edit distance.  ...  Even though the proposed skipping method requires additional overhead, the proposed scheme's practical embodiments show that the execution time of string matching is reduced significantly when k is small  ...  k-mismatch string matching A k-mismatch approximate string matching is defined as: Definition 2 In k-mismatch string matching, for input sequence X i and pattern Y j , when D (X i , Y j ) � k, X i matches  ... 
doi:10.1371/journal.pone.0251047 pmid:33945564 pmcid:PMC8096107 fatcat:byeftxhrure6japioxmfnqj5gu

Face Recognition Using Ensemble String Matching

Weiping Chen, Yongsheng Gao
2013 IEEE Transactions on Image Processing  
A novel ensemble string matching approach that can perform non-sequential string matching between two Stringfaces is proposed.  ...  String matching is a powerful partial matching technique, but is not suitable for frontal face recognition due to its requirement of globally sequential representation and the complex nature of human faces  ...  String matching is a syntactic and structural method for similarity measurement between strings or vectors, and has been widely used for pattern matching in molecular biology [25] , speech recognition  ... 
doi:10.1109/tip.2013.2277920 pmid:23955761 fatcat:zp6ts3ctcrcv3ke7vcynkcbmra

Ontology matching by applying parallelization and distribution of matching task within clustering environment

Tanni Mittra, Muhammad Masroor Ali
2014 8th International Conference on Electrical and Computer Engineering  
In this thesis, we propose a new method of ontology matching using parallelization and distribution technique.  ...  I have learned from him how to carry on a research work, how to write, speak and present well.  ...  The new version quantitatively estimates the similarity characteristics for each matching task. These characteristics are used for dynamicly selecting and combining the multiple matching methods.  ... 
doi:10.1109/icece.2014.7026909 fatcat:iihpywtpirfc3gnom5uug4j3iu
« Previous Showing results 1 — 15 out of 44,316 results