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

Kwang Sik Chung, Soo Young Kim, Heonchang Yu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages277-286
Number of pages10
Volume9243
ISBN (Print)9783319238616
DOIs
Publication statusPublished - 2015
Event5th International Conference on Intelligence Science and Big Data Engineering, IScIDE 2015 - Suzhou, China
Duration: 2015 Jun 142015 Jun 16

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9243
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other5th International Conference on Intelligence Science and Big Data Engineering, IScIDE 2015
CountryChina
CitySuzhou
Period15/6/1415/6/16

Fingerprint

String searching algorithms
Glossaries
Strings
Internet
Search engines
Information and Communication Technology
Web Search
Search Engine
Dictionary
Communication
Calculate
Costs

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

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Chung, K. S., Kim, S. Y., & Yu, H. (2015). An efficient string searching algorithm based on occurrence frequency and pattern of vowels and consonants in a pattern. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9243, 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, Heonchang.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 9243 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 proceedingConference contribution

Chung, KS, Kim, SY & Yu, H 2015, An efficient string searching algorithm based on occurrence frequency and pattern of vowels and consonants in a pattern. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 9243, 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 H. An efficient string searching algorithm based on occurrence frequency and pattern of vowels and consonants in a pattern. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 9243. Springer Verlag. 2015. p. 277-286. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-23862-3_27
Chung, Kwang Sik ; Kim, Soo Young ; Yu, Heonchang. / An efficient string searching algorithm based on occurrence frequency and pattern of vowels and consonants in a pattern. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 9243 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’ 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.",
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 Heonchang Yu",
year = "2015",
doi = "10.1007/978-3-319-23862-3_27",
language = "English",
isbn = "9783319238616",
volume = "9243",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "277--286",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

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, Heonchang

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

UR - http://www.scopus.com/inward/citedby.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

VL - 9243

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

SP - 277

EP - 286

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

PB - Springer Verlag

ER -