TY - GEN
T1 - An efficient string searching algorithm based on vowel occurrence pattern
AU - Chung, Kwang Sik
AU - Yu, Heon Chang
AU - Jin, Sung Ho
PY - 2011
Y1 - 2011
N2 - String searching algorithm is used to determine whether a word, a statement and a phrase exists in newspaper article, books, web pages or not. Especially as the volume of web pages and documentation increases, time and cost of searching a pattern increases. In this paper, we consider the characteristics of English alphabets combination in a pattern and a text(frequency and position of vowels in a pattern and a text), and propose new efficient string searching algorithm based on vowel composition structure of pattern and text. If a pattern has two or more vowels, proposed vowel-based string searching algorithm is more efficient at the both case of best matching case and worst matching case. Especially, a pattern's length does not affect performance of proposed vowel-based string searching algorithm. Only a pattern's location in a text can affect running time of algorithm. Proposed vowel-based string searching algorithm can avoid un-matching vowels in a text and un-necessary comparison between a pattern and a text. Therefore in reality, vowel-based string searching algorithm is usefully and effectively applicable to string searching function of a pattern and a text.
AB - String searching algorithm is used to determine whether a word, a statement and a phrase exists in newspaper article, books, web pages or not. Especially as the volume of web pages and documentation increases, time and cost of searching a pattern increases. In this paper, we consider the characteristics of English alphabets combination in a pattern and a text(frequency and position of vowels in a pattern and a text), and propose new efficient string searching algorithm based on vowel composition structure of pattern and text. If a pattern has two or more vowels, proposed vowel-based string searching algorithm is more efficient at the both case of best matching case and worst matching case. Especially, a pattern's length does not affect performance of proposed vowel-based string searching algorithm. Only a pattern's location in a text can affect running time of algorithm. Proposed vowel-based string searching algorithm can avoid un-matching vowels in a text and un-necessary comparison between a pattern and a text. Therefore in reality, vowel-based string searching algorithm is usefully and effectively applicable to string searching function of a pattern and a text.
KW - pattern
KW - string searching algorithm
KW - text
KW - vowel-based string search
UR - http://www.scopus.com/inward/record.url?scp=79960137297&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-22309-9_52
DO - 10.1007/978-3-642-22309-9_52
M3 - Conference contribution
AN - SCOPUS:79960137297
SN - 9783642223082
T3 - Communications in Computer and Information Science
SP - 379
EP - 386
BT - Future Information Technology - 6th International Conference, FutureTech 2011, Proceedings
T2 - 6th International Conference on Future Information Technology, FutureTech 2011
Y2 - 28 June 2011 through 30 June 2011
ER -