Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 3

PERBANDINGAN ALGORITMA HORSPOOL DAN ALGORITMA RAITA PADA APLIKASI ISTILAH PSIKOLOGI BERBASIS ANDROID

SemanTIK: Teknik Informasi · Vol. 5 No. 1 (2019) · pp. 131–142

DOI
10.55679/semantik.v5i1.5996
ISSN
2502-8928, 2460-1446
Published
2019-06-30
Publisher
Informatics Engineering Department of Halu Oleo University
Language
eng
License
creativecommons.org/licenses/by-sa/4.0

Abstract

The lack of professional health personnel in Indonesia has resulted in many people with mental disorders who have not been treated medically. To make it easier for the mental health workers, especially psychology students to study the term in psychology. It is necessary to have a digital dictionary because a tick printed book dictionary makes it difficult to carry around and the search term desired requires a long time. Based on this, a dictionary application for the psychology term based on Android was made.To make this application implemented the string matching method on the codeword search. String matching has several algorithms, some of which are Horspool algorithm and Raita algorithm.In this research study an analysis of the comparison between the Horspool algorithm and Raita algorithm, to determine the most useful algorithms in the dictionary of psychological terms. The parameter used to compare the two algorithms search time (ms) and complexity algorithms (Big-O).The results of this study show that Raita Algorithm has a faster search than Horspool Algorithm and the complexity of Raita algorithm has faster than Horspool algorithm. The average total velocity of time for Raita algorithm is 13,60 ms and Horspool algorithm are 14,79 ms. The complexity of Raita algorithm is T(n) = Ɵ(MN) and the complexity of Horspool algorithm is T(n) = Ɵ(M(N-2)).Keywords—Dictionary, Psychology, String Matching, Horspool Algorithm, Raita AlgorithmDOI: 10.5281/zenodo.3242287

Keywords

Collaboration network of the authors

40 authors · 123 co-authorship links · 2 across different organisations · showing the 40 most connected

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Universitas Halu Oleo
  • Institut Teknologi Sepuluh Nopember
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Natalis RansiUniversitas Halu Oleo13
Bambang PramonoUniversitas Halu Oleo9
La SurimiUniversitas Halu Oleo9
LM. Fid AksaraUniversitas Halu Oleo6
Sutardi SutardiUniversitas Halu Oleo5
Ika Purwanti NingrumUniversitas Halu Oleo4
ARMAN FASLIHAffiliation unknown4
Rahmat RamadhanUniversitas Halu Oleo4
L.M. Fid AksaraUniversitas Halu Oleo4
Arman ArmanUniversitas Halu Oleo3
Isnawaty IsnawatyAffiliation unknown2
Muhammad Ihsan SaritaUniversitas Halu Oleo2
Halim HalimUniversitas Halu Oleo2
Muhammad Zakaria UmarAffiliation unknown2
Nurul Hajra Hadijah HajraUniversitas Halu Oleo2
Feri FadlinAffiliation unknown2
Suparjo SuparjoAffiliation unknown2
Edi CahyonoUniversitas Halu Oleo2
Jayanti Yusmah SariUniversitas Halu Oleo2
Andi TenriawaruUniversitas Halu Oleo1
Wa Ode IrmayadaniUniversitas Halu Oleo1
Asri SamsudinUniversitas Halu Oleo1
Umar RamdaniUniversitas Halu Oleo1
LM Bahtiar AksaraAffiliation unknown1
Restu Hadi SaputraAffiliation unknown1
Ayu Septiana SariAffiliation unknown1
Uun Amalia RamadhaniUniversitas Halu Oleo1
Wahyuddin AluddinUniversitas Halu Oleo1
Dewi Dessy SupraptiAffiliation unknown1
Adnan HidayatUniversitas Halu Oleo1
La Ode Muh. Golok JayaUniversitas Halu Oleo1
Rahma Surya AlamAffiliation unknown1
Yuwanda Purnamasari PasrunInstitut Teknologi Sepuluh Nopember1
Ilayani IlayaniAffiliation unknown1
Muh.Muchsin Al-As'Ad MirsyahAffiliation unknown1
Nurfanny La BennyAffiliation unknown1
Wa Ode Wahyuni MakmunUniversitas Halu Oleo1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

Metadata source: OAI-PMH (metadata jurnal) https://ojs.uho.ac.id/index.php/semantik/oai, first harvested 29 Okt 2026, last seen 29 Okt 2026.
Original metadata (oai_dc) 
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PERBANDINGAN ALGORITMA HORSPOOL DAN ALGORITMA RAITA PADA APLIKASI ISTILAH PSIKOLOGI BERBASIS ANDROID</dc:title>
	<dc:creator>Puding, Mamta Culkari</dc:creator>
	<dc:creator>Nangi, Jumadil</dc:creator>
	<dc:creator>Sajiah, Adha Mashur</dc:creator>
	<dc:subject xml:lang="en-US">Software Engineering</dc:subject>
	<dc:description xml:lang="en-US">The lack of professional health personnel in Indonesia has resulted in many people with mental disorders who have not been treated medically. To make it easier for the mental health workers, especially psychology students to study the term in psychology. It is necessary to have a digital dictionary because a tick printed book dictionary makes it difficult to carry around and the search term desired requires a long time. Based on this, a dictionary application for the psychology term based on Android was made.To make this application implemented the string matching method on the codeword search. String matching has several algorithms, some of which are Horspool algorithm and Raita algorithm.In this research study an analysis of the comparison between the Horspool algorithm and Raita algorithm, to determine the most useful algorithms in the dictionary of psychological terms. The parameter used to compare the two algorithms search time (ms) and complexity algorithms (Big-O).The results of this study show that Raita Algorithm has a faster search than Horspool Algorithm and the complexity of Raita algorithm has faster than  Horspool algorithm. The average total velocity of time for Raita algorithm is 13,60 ms and Horspool algorithm are 14,79 ms.  The complexity of Raita algorithm is T(n) = Ɵ(MN) and the complexity of Horspool algorithm is T(n) = Ɵ(M(N-2)).Keywords—Dictionary, Psychology, String Matching, Horspool Algorithm, Raita AlgorithmDOI : 10.5281/zenodo.3242287</dc:description>
	<dc:publisher xml:lang="en-US">Informatics Engineering Department of Halu Oleo University</dc:publisher>
	<dc:contributor xml:lang="en-US">ASTRI YUNITA, S.Psi.,M.Psi.,Psikolog</dc:contributor>
	<dc:date>2019-06-30</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ojs.uho.ac.id/index.php/semantik/article/view/5996</dc:identifier>
	<dc:identifier>10.55679/semantik.v5i1.5996</dc:identifier>
	<dc:source xml:lang="en-US">SemanTIK : Teknik Informasi; Vol 5, No 1 (2019): semanTIK; 131-142</dc:source>
	<dc:source>2502-8928</dc:source>
	<dc:source>2460-1446</dc:source>
	<dc:source>10.55679/semantik.v5i1</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs.uho.ac.id/index.php/semantik/article/view/5996/pdf</dc:relation>
	<dc:relation>https://ojs.uho.ac.id/index.php/semantik/article/downloadSuppFile/5996/402</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2019 semanTIK</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>