Comparative Analysis Scoring System Auto Essay (simple-o) Based Algoritma Generalized Latent Semantic Analysis (GLSA) Laplacian Eigenmaps Embedding (LEM) and Hybrid Indexing

This research discusses a comparison of two algorithms for an automatic essay assessment system (Simple-O), namely generalized latent semantic analysis (GLSA), Laplacian Eigenmaps embedding (LEM) and hybrid indexing. The two algorithms are compared to find out how the two algorithms work, processing speed, and assessment results. Comparison of how it works is done by comparing the pseudocode of each algorithm. The processing speed is calculated to find out a faster algorithm for assessing essays. The GLSA hybrid indexing algorithm is a development of the LEM algorithm. The fundamental difference between the two algorithms is in the treatment of nouns and words other than nouns. This research used a sample of eight questions completed by 48 students (384 data). From the research results, GLSA LEM has a total processing time of 46.51454 seconds, which is faster than GLSA hybrid indexing. Meanwhile, the average processing time for GLSA LEM and GLSA hybrid indexing to assess one answer is 6-6.6 seconds. The assessment results from GLSA LEM and GLSA hybrid indexing have the highest similarity level of 95.83% and the lowest 16.67%. Of the eight questions tested, five of them had a similarity level of more than 83.33%.

Authors

Institutions

Publication Details

Journal
Jurnal Media Informasi Teknologi
Published
2024-10-31
DOI
https://doi.org/10.69616/mit.v1i2.190
Primary Topic
Text and Document Classification Technologies
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Comparative Analysis Scoring System Auto Essay (simple-o) Based Algoritma Generalized Latent Semantic Analysis (GLSA) Laplacian Eigenmaps Embedding (LEM) and Hybrid Indexing

Dandun Kusuma Yudha, Anak Agung Putri Ratna
Jurnal Media Informasi Teknologi
Text and Document Classification Technologies
article

Comparative Analysis Scoring System Auto Essay (simple-o) Based Algoritma Generalized Latent Semantic Analysis (GLSA) Laplacian Eigenmaps Embedding (LEM) and Hybrid Indexing

Dandun Kusuma Yudha, Anak Agung Putri Ratna
article en

Abstract

This research discusses a comparison of two algorithms for an automatic essay assessment system (Simple-O), namely generalized latent semantic analysis (GLSA), Laplacian Eigenmaps embedding (LEM) and hybrid indexing. The two algorithms are compared to find out how the two algorithms work, processing speed, and assessment results. Comparison of how it works is done by comparing the pseudocode of each algorithm. The processing speed is calculated to find out a faster algorithm for assessing essays. The GLSA hybrid indexing algorithm is a development of the LEM algorithm. The fundamental difference between the two algorithms is in the treatment of nouns and words other than nouns. This research used a sample of eight questions completed by 48 students (384 data). From the research results, GLSA LEM has a total processing time of 46.51454 seconds, which is faster than GLSA hybrid indexing. Meanwhile, the average processing time for GLSA LEM and GLSA hybrid indexing to assess one answer is 6-6.6 seconds. The assessment results from GLSA LEM and GLSA hybrid indexing have the highest similarity level of 95.83% and the lowest 16.67%. Of the eight questions tested, five of them had a similarity level of more than 83.33%.

Jurnal Media Informasi TeknologiVol. 1(2)
University of Indonesia (ID)
Quality Education
Openalex Percentile: Top 83%
Text and Document Classification Technologies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Comparative Analysis Scoring System Auto Essay (simple-o) Based Algoritma Generalized Latent Semantic Analysis (GLSA) Laplacian Eigenmaps Embedding (LEM) and Hybrid Indexing — Dandun Kusuma Yudha, Anak Agung Putri Ratna · Jurnal Media Informasi Teknologi (2024) | TGRS Research Map | TGRS