An efficient string searching algorithm based on occurrence frequency and pattern of vowels and consonants in a pattern

Kwang Sik Chung; Soo Young Kim; Heon Chang Yu

doi:10.1007/978-3-319-23862-3_27

An efficient string searching algorithm based on occurrence frequency and pattern of vowels and consonants in a pattern

Kwang Sik Chung, Soo Young Kim, Heon Chang Yu

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Citation (Scopus)

Abstract

Information and communication technologies enable people to access to various documentations and information. Huge documents and information in the Internet or storage disks have made search time more important. Especially as the volume size and the number of documents on the Internet increase, string search times and costs increase have become big burden to search service. But, most of string searching algorithms have not consider lexical structures nor vowels’ occurrence frequency. Formal documents (articles, news, novels, etc.) have important characteristic that is ‘well-formed written’ English. And words of formal documents have ‘limit number of words and alphabets’ that are listed in a dictionary. The ‘limit number of words and alphabets’ has predictable occurrence probability in real world’s documentations. We try to use the alphabet occurrence probability as first search condition. We analyze all the words in the dictionaries (dictionary of free dictionary project, scrabblehelper–Revision 20, Winedit dictionary) and calculate each alphabet occurrence probability of repeated vowels, repeated consonants, not-repeated vowels and not-repeated consonants. In this paper, we define and propose the search rules and string searching algorithm, based on occurrence frequency and patterns of vowels and consonants. We use only the occurrence patterns and repeated positions of vowel and consonant in a text. Therefore, in the real world, proposed string searching algorithm (OFRP algorithm) is based on occurrence frequency and repetition pattern of vowels and consonants and is usefully and effectively applied to string search service and web search engine.

Original language	English
Title of host publication	Intelligence Science and Big Data Engineering
Subtitle of host publication	Big Data and Machine Learning Techniques - 5th International Conference, IScIDE 2015, Revised Selected Papers
Editors	Zhi-Hua Zhou, Baochuan Fu, Fuyuan Hu, Zhancheng Zhang, Zhi-Yong Liu, Yanning Zhang, Xiaofei He, Xinbo Gao
Publisher	Springer Verlag
Pages	277-286
Number of pages	10
ISBN (Print)	9783319238616
DOIs	https://doi.org/10.1007/978-3-319-23862-3_27
Publication status	Published - 2015
Event	5th International Conference on Intelligence Science and Big Data Engineering, IScIDE 2015 - Suzhou, China Duration: 2015 Jun 14 → 2015 Jun 16

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	9243
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	5th International Conference on Intelligence Science and Big Data Engineering, IScIDE 2015
Country/Territory	China
City	Suzhou
Period	15/6/14 → 15/6/16

Bibliographical note

Funding Information:
This work was supported by 2014 Korea National Open University Research Fund.

Publisher Copyright:
© Springer International Publishing Switzerland 2015.

Keywords

Occurrence frequency of consonants
Occurrence frequency of vowels
Repetition pattern of consonants
Repetition pattern of vowels
String search
Vowel and consonant-based string search

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-319-23862-3_27

Cite this

Chung, K. S., Kim, S. Y., & Yu, H. C. (2015). An efficient string searching algorithm based on occurrence frequency and pattern of vowels and consonants in a pattern. In Z.-H. Zhou, B. Fu, F. Hu, Z. Zhang, Z.-Y. Liu, Y. Zhang, X. He, & X. Gao (Eds.), Intelligence Science and Big Data Engineering: Big Data and Machine Learning Techniques - 5th International Conference, IScIDE 2015, Revised Selected Papers (pp. 277-286). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9243). Springer Verlag. https://doi.org/10.1007/978-3-319-23862-3_27

An efficient string searching algorithm based on occurrence frequency and pattern of vowels and consonants in a pattern. / Chung, Kwang Sik; Kim, Soo Young; Yu, Heon Chang.
Intelligence Science and Big Data Engineering: Big Data and Machine Learning Techniques - 5th International Conference, IScIDE 2015, Revised Selected Papers. ed. / Zhi-Hua Zhou; Baochuan Fu; Fuyuan Hu; Zhancheng Zhang; Zhi-Yong Liu; Yanning Zhang; Xiaofei He; Xinbo Gao. Springer Verlag, 2015. p. 277-286 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9243).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Chung, KS, Kim, SY & Yu, HC 2015, An efficient string searching algorithm based on occurrence frequency and pattern of vowels and consonants in a pattern. in Z-H Zhou, B Fu, F Hu, Z Zhang, Z-Y Liu, Y Zhang, X He & X Gao (eds), Intelligence Science and Big Data Engineering: Big Data and Machine Learning Techniques - 5th International Conference, IScIDE 2015, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9243, Springer Verlag, pp. 277-286, 5th International Conference on Intelligence Science and Big Data Engineering, IScIDE 2015, Suzhou, China, 15/6/14. https://doi.org/10.1007/978-3-319-23862-3_27

Chung KS, Kim SY, Yu HC. An efficient string searching algorithm based on occurrence frequency and pattern of vowels and consonants in a pattern. In Zhou ZH, Fu B, Hu F, Zhang Z, Liu ZY, Zhang Y, He X, Gao X, editors, Intelligence Science and Big Data Engineering: Big Data and Machine Learning Techniques - 5th International Conference, IScIDE 2015, Revised Selected Papers. Springer Verlag. 2015. p. 277-286. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-23862-3_27

Chung, Kwang Sik ; Kim, Soo Young ; Yu, Heon Chang. / An efficient string searching algorithm based on occurrence frequency and pattern of vowels and consonants in a pattern. Intelligence Science and Big Data Engineering: Big Data and Machine Learning Techniques - 5th International Conference, IScIDE 2015, Revised Selected Papers. editor / Zhi-Hua Zhou ; Baochuan Fu ; Fuyuan Hu ; Zhancheng Zhang ; Zhi-Yong Liu ; Yanning Zhang ; Xiaofei He ; Xinbo Gao. Springer Verlag, 2015. pp. 277-286 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{a34bfa29fbb7492799267e9d130ffbb1,

title = "An efficient string searching algorithm based on occurrence frequency and pattern of vowels and consonants in a pattern",

abstract = "Information and communication technologies enable people to access to various documentations and information. Huge documents and information in the Internet or storage disks have made search time more important. Especially as the volume size and the number of documents on the Internet increase, string search times and costs increase have become big burden to search service. But, most of string searching algorithms have not consider lexical structures nor vowels{\textquoteright} occurrence frequency. Formal documents (articles, news, novels, etc.) have important characteristic that is {\textquoteleft}well-formed written{\textquoteright} English. And words of formal documents have {\textquoteleft}limit number of words and alphabets{\textquoteright} that are listed in a dictionary. The {\textquoteleft}limit number of words and alphabets{\textquoteright} has predictable occurrence probability in real world{\textquoteright}s documentations. We try to use the alphabet occurrence probability as first search condition. We analyze all the words in the dictionaries (dictionary of free dictionary project, scrabblehelper–Revision 20, Winedit dictionary) and calculate each alphabet occurrence probability of repeated vowels, repeated consonants, not-repeated vowels and not-repeated consonants. In this paper, we define and propose the search rules and string searching algorithm, based on occurrence frequency and patterns of vowels and consonants. We use only the occurrence patterns and repeated positions of vowel and consonant in a text. Therefore, in the real world, proposed string searching algorithm (OFRP algorithm) is based on occurrence frequency and repetition pattern of vowels and consonants and is usefully and effectively applied to string search service and web search engine.",

keywords = "Occurrence frequency of consonants, Occurrence frequency of vowels, Repetition pattern of consonants, Repetition pattern of vowels, String search, Vowel and consonant-based string search",

author = "Chung, {Kwang Sik} and Kim, {Soo Young} and Yu, {Heon Chang}",

note = "Funding Information: This work was supported by 2014 Korea National Open University Research Fund. Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2015.; 5th International Conference on Intelligence Science and Big Data Engineering, IScIDE 2015 ; Conference date: 14-06-2015 Through 16-06-2015",

year = "2015",

doi = "10.1007/978-3-319-23862-3_27",

language = "English",

isbn = "9783319238616",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "277--286",

editor = "Zhi-Hua Zhou and Baochuan Fu and Fuyuan Hu and Zhancheng Zhang and Zhi-Yong Liu and Yanning Zhang and Xiaofei He and Xinbo Gao",

booktitle = "Intelligence Science and Big Data Engineering",

}

TY - GEN

T1 - An efficient string searching algorithm based on occurrence frequency and pattern of vowels and consonants in a pattern

AU - Chung, Kwang Sik

AU - Kim, Soo Young

AU - Yu, Heon Chang

N1 - Funding Information: This work was supported by 2014 Korea National Open University Research Fund. Publisher Copyright: © Springer International Publishing Switzerland 2015.

PY - 2015

Y1 - 2015

N2 - Information and communication technologies enable people to access to various documentations and information. Huge documents and information in the Internet or storage disks have made search time more important. Especially as the volume size and the number of documents on the Internet increase, string search times and costs increase have become big burden to search service. But, most of string searching algorithms have not consider lexical structures nor vowels’ occurrence frequency. Formal documents (articles, news, novels, etc.) have important characteristic that is ‘well-formed written’ English. And words of formal documents have ‘limit number of words and alphabets’ that are listed in a dictionary. The ‘limit number of words and alphabets’ has predictable occurrence probability in real world’s documentations. We try to use the alphabet occurrence probability as first search condition. We analyze all the words in the dictionaries (dictionary of free dictionary project, scrabblehelper–Revision 20, Winedit dictionary) and calculate each alphabet occurrence probability of repeated vowels, repeated consonants, not-repeated vowels and not-repeated consonants. In this paper, we define and propose the search rules and string searching algorithm, based on occurrence frequency and patterns of vowels and consonants. We use only the occurrence patterns and repeated positions of vowel and consonant in a text. Therefore, in the real world, proposed string searching algorithm (OFRP algorithm) is based on occurrence frequency and repetition pattern of vowels and consonants and is usefully and effectively applied to string search service and web search engine.

AB - Information and communication technologies enable people to access to various documentations and information. Huge documents and information in the Internet or storage disks have made search time more important. Especially as the volume size and the number of documents on the Internet increase, string search times and costs increase have become big burden to search service. But, most of string searching algorithms have not consider lexical structures nor vowels’ occurrence frequency. Formal documents (articles, news, novels, etc.) have important characteristic that is ‘well-formed written’ English. And words of formal documents have ‘limit number of words and alphabets’ that are listed in a dictionary. The ‘limit number of words and alphabets’ has predictable occurrence probability in real world’s documentations. We try to use the alphabet occurrence probability as first search condition. We analyze all the words in the dictionaries (dictionary of free dictionary project, scrabblehelper–Revision 20, Winedit dictionary) and calculate each alphabet occurrence probability of repeated vowels, repeated consonants, not-repeated vowels and not-repeated consonants. In this paper, we define and propose the search rules and string searching algorithm, based on occurrence frequency and patterns of vowels and consonants. We use only the occurrence patterns and repeated positions of vowel and consonant in a text. Therefore, in the real world, proposed string searching algorithm (OFRP algorithm) is based on occurrence frequency and repetition pattern of vowels and consonants and is usefully and effectively applied to string search service and web search engine.

KW - Occurrence frequency of consonants

KW - Occurrence frequency of vowels

KW - Repetition pattern of consonants

KW - Repetition pattern of vowels

KW - String search

KW - Vowel and consonant-based string search

UR - http://www.scopus.com/inward/record.url?scp=84945948004&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-23862-3_27

DO - 10.1007/978-3-319-23862-3_27

M3 - Conference contribution

AN - SCOPUS:84945948004

SN - 9783319238616

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 277

EP - 286

BT - Intelligence Science and Big Data Engineering

A2 - Zhou, Zhi-Hua

A2 - Fu, Baochuan

A2 - Hu, Fuyuan

A2 - Zhang, Zhancheng

A2 - Liu, Zhi-Yong

A2 - Zhang, Yanning

A2 - He, Xiaofei

A2 - Gao, Xinbo

PB - Springer Verlag

T2 - 5th International Conference on Intelligence Science and Big Data Engineering, IScIDE 2015

Y2 - 14 June 2015 through 16 June 2015

ER -

An efficient string searching algorithm based on occurrence frequency and pattern of vowels and consonants in a pattern

Abstract

Publication series

Other

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this