Filters








101 Hits in 3.6 sec

Comparison of search algorithms in Javanese-Indonesian dictionary application

Yana Aditia Gerhana, Nur Lukman, Arief Fatchul Huda, Cecep Nurul Alam, Undang Syaripudin, Devi Novitasari
2020 TELKOMNIKA (Telecommunication Computing Electronics and Control)  
The test results show that the Boyer Moore and Knuth Morris Pratt algorithms have an accuracy rate of 100%, and the Horspool algorithm 85.3%.  ...  While the complexity test results, the Boyer Moore algorithm has an overall number of n 26n 2 , Knuth Morris Pratt and Horspool 20n 2 each.  ...  The Horspool algorithm has a simpler shifting compared to the Boyer-Moore algorithm.  ... 
doi:10.12928/telkomnika.v18i5.14882 fatcat:dllvlhj6dvedbfckentxuh3yme

On Obtaining the Boyer-Moore String-Matching Algorithm by Partial Evaluation

Olivier Danvy, Henning Korsholm Rohde
2005 BRICS Report Series  
An inefficient string matcher incorporating this binding-time improvement specializes into the search phase of the Horspool algorithm, which is a simplified variant of the Boyer-Moore algorithm.  ...  We present the first derivation of the search phase of the Boyer-Moore string-matching algorithm by partial evaluation of an inefficient string matcher.  ...  variant of the Boyer-Moore algorithm [12] .  ... 
doi:10.7146/brics.v12i14.21880 fatcat:rfiyuigchjcqndbqj74bmlsnw4

On obtaining the Boyer–Moore string-matching algorithm by partial evaluation

Olivier Danvy, Henning Korsholm Rohde
2006 Information Processing Letters  
An inefficient string matcher incorporating this binding-time improvement specializes into the search phase of the Horspool algorithm, which is a simplified variant of the Boyer-Moore algorithm.  ...  We present the first derivation of the search phase of the Boyer-Moore stringmatching algorithm by partial evaluation of an inefficient string matcher.  ...  of the Boyer-Moore algorithm.  ... 
doi:10.1016/j.ipl.2006.04.001 fatcat:5mxetsqqw5a7pbqjqotrfqelby

On Obtaining the Boyer-Moore String-Matching Algorithm by Partial Evaluation

Olivier Danvy, Henning Korsholm Rohde
2005 BRICS Report Series  
An inefficient string matcher incorporating this binding-time improvement specializes into the search phase of the Horspool algorithm, which is a simplified variant of the Boyer-Moore algorithm.  ...  We present the first derivation of the search phase of the Boyer-Moore string-matching algorithm by partial evaluation of an inefficient string matcher.  ...  of the Boyer-Moore algorithm.  ... 
doi:10.7146/brics.v12i29.21896 fatcat:vsnahhfcfjaqpf6nhzcr7c5aeu

IMPLEMENTASI ALGORITMA HORSPOOL PADA APLIKASI TAKSONOMI BERBASIS ANDROID

Fajar Ikhwan
2018 Buffer Informatika  
Salah satu jenis string matching adalah algoritma Horspool. Algoritma Horspool merupakan turunan dari algoritma Boyer-Moore dan mudah dalam implementasinya.  ...  Algoritma Horspool hanya menggunakan perpindahan bad character yang terjadi pada Boyer Moore.Kata Kunci : Taksonomi,Plantae, Android, String Matching, Horspool  ...  One type of string matching is the Horspool algorithm. Horspool algorithm is a derivative of the Boyer-Moore algorithm and easy to implement.  ... 
doi:10.25134/buffer.v4i2.1474 fatcat:ckvzh3nsmzfvhhlg6qd3isebwq

IMPLEMENTASI ALGORITMA HORSPOOL PADA APLIKASI ISTILAH FASHION

Azhar Azhar, Nasib Marbun, Soeb Aripin, Efori Buulolo
2019 KOMIK (Konferensi Nasional Teknologi Informasi dan Komputer)  
The horspool algorithm is a boyer-moore derivative algorithm, to go through the process when there is a mismatch of character patterns with text characters, the horspool algorithm uses bad-matches repeatedly  ...  Algortima string matching which is implemented to search for the meaning of the term fashion in this study is the Horspool algorithm.  ...  Algoritma exact matching pada kategori ini yaitu algoritma Horspool, Turbo Boyer-Moore, Boyer Moore, Raita, dan lain-lain. 3.  ... 
doi:10.30865/komik.v3i1.1641 fatcat:jyxbqlhvejcq5lpyv7bh5ad2du

Average running time of the Boyer-Moore-Horspool algorithm

Ricardo A. Baeza-Yates, Mireille Régnier
1992 Theoretical Computer Science  
Concluding remarks In this paper we have realized an extensive study of a Boyer-Moore-type string searching algorithm. We first derived an average analysis of the Boyer-Mooree Horspool algorithm.  ...  The Boyer-Moore-Horspool algorithm The Boyer-Moore (BM) algorithm positions the pattern over the leftmost characters in the text and attempts to match it from right to left.  ... 
doi:10.1016/0304-3975(92)90133-z fatcat:qrtfiy5eibfohktty22msgonhe

Dictionary Of Psychology With Horspool Algorithm

Ade Mutiara Kartika, Poltak Sihombing, Ade Candra
2018 Talenta Conference Series: Science and Technology (ST)  
Horspool algorithm apply a saved search information to shift even further because the string matching is done from right to left, so the time to search a string is shorter.  ...  Made an Android-based application of psychology dictionary that applies the Horspool algorithm for terms search and SQLite for data storage is a solution.  ...  One of a string matching algorithm is Horspool algorithm. Horspool algorithm is derived from the Boyer-Moore algorithm and easy in implementation.  ... 
doi:10.32734/st.v1i1.192 fatcat:xwpy33j6wnfsrk27bf5adt3wey

Mobile-Based Word Matching Detection using Intelligent Predictive Algorithm

Hamidah Jantan, Nurul Aisyiah Baharudin
2019 International Journal of Interactive Mobile Technologies  
There are several algorithms have been used for string search and matching such as Knuth Morris Pratt, Boyer Moore, Horspool, Intelligent Predictive and many other.  ...  The result shows that the IP algorithm for string searching process is more efficient in execution time compared to well-known algorithm i.e. Boyer Moore algorithm.  ...  Boyer Moore, Horspool and Knuth Morris Pratt algorithms are among the string search algorithms widely used for word matching.  ... 
doi:10.3991/ijim.v13i09.10848 fatcat:z4l74a3dmndkfbckm4fd4u354a

Fast Exact String Pattern-matching Algorithms Adapted to the Characteristics of the Medical Language

C. Lovis, R. H. Baud
2000 JAMIA Journal of the American Medical Informatics Association  
Results: The Boyer-Moore-Horspool algorithm achieves the best overall results when used with medical texts. This algorithm usually performs at least twice as fast as the other algorithms tested.  ...  A b s t r a c t Objective: The authors consider the problem of exact string pattern matching using algorithms that do not require any preprocessing.  ...  ; KR, Karp-Rabin algorithm; KMP, Knuth-Morris-Pratt algorithm; BMH, Boyer-Moore-Horspool algorithm; BMH-2, variant of Boyer-Moore-Horspool algorithm.  ... 
doi:10.1136/jamia.2000.0070378 pmid:10887166 pmcid:PMC61442 fatcat:gkva4qq5xfaatmcfqlpybvorjm

A FAST Pattern Matching Algorithm

S. S. Sheik, Sumit K. Aggarwal, Anindya Poddar, N. Balakrishnan, K. Sekar
2004 Journal of chemical information and computer sciences  
The new algorithm has been evolved after analyzing the well-known algorithms such as Boyer-Moore, Quick-search, Raita, and Horspool.  ...  This has also stimulated the development of many algorithms. In this paper, we propose a new algorithm that offers improved performance compared to those reported in the literature so far.  ...  Aggarwal is a summer trainee from IIT, Roorkee, India.  ... 
doi:10.1021/ci030463z pmid:15272832 fatcat:mba4z3srs5dzrfejxmbpbyxr6q

Multipattern string matching withq-grams

Leena Salmela, Jorma Tarhio, Jari Kytöjoki
2007 ACM Journal of Experimental Algorithmics  
We present three algorithms for exact string matching of multiple patterns. Our algorithms are filtering methods, which apply q-grams and bit parallelism.  ...  We ran extensive experiments with them and compared them with various versions of earlier algorithms, e.g. different trie implementations of the Aho-Corasick algorithm.  ...  Boyer-Moore-Horspool The Boyer-Moore-Horspool (BMH) algorithm [Horspool 1980 ] is a widely-known search algorithm for a single pattern.  ... 
doi:10.1145/1187436.1187438 fatcat:mcvl65aa4bbjlaceyqiu4qmb5i

Exact Online String Matching Bibliography [article]

Simone Faro
2016 arXiv   pre-print
Since 1970 more than 120 string matching algorithms have been proposed. In this note we present a comprehensive list of (almost) all string matching algorithms. The list is updated to May 2016.  ...  In this short note we present a comprehensive bibliography for the online exact string matching problem. The problem consists in finding all occurrences of a given pattern in a text.  ...  Boyer-Moore-Horspool using Probabilities (PBMH) -2006 Appeared in [84] Combination of (11) and (5) .  ... 
arXiv:1605.05067v1 fatcat:2nr7bjtafjfmjgpfcfbyjnr6oq

Measuring the Propagation of Information in Partial Evaluation

Henning Korsholm Rohde
2005 BRICS Report Series  
<br /> <br />Our analysis includes a framework that lets us obtain string matchers - notably the family of Boyer-Moore algorithms - in a systematic formalism-independent way from a few information-propagation  ...  Our analysis is based on measuring implementations of string-matching algorithms, based on the observation that the sequence of character comparisons accurately reflects maintained information.  ...  Acknowledgments A special thanks to Olivier Danvy for introducing me to the topic; for encouragement; and for countless useful comments and discussions.  ... 
doi:10.7146/brics.v12i26.21893 fatcat:i7pc455xlnc5hmodejl66nizwi

E 2 xB: A Domain-Specific String Matching Algorithm for Intrusion Detection [chapter]

K. G. Anagnostakis, S. Antonatos, E. P. Markatos, M. Polychronakis
2003 Security and Privacy in the Age of Uncertainty  
String matching computations dominate in the overall cost of running a NIDS, despite the use of efficient general-purpose string matching algorithms.  ...  Aiming at increasing the efficiency and capacity of NIDSes, we have designed E 2 xB, a string matching algorithm that is tailored to the specific characteristics of NIDS string matching.  ...  They proposed an algorithm called Setwise Boyer-Moore-Horspool, adapting the Boyer-Moore algorithm to simultaneously match a set of rules.  ... 
doi:10.1007/978-0-387-35691-4_19 fatcat:cuxvz4bylnhn3mwdqfhjylvfcq
« Previous Showing results 1 — 15 out of 101 results