Restricted Transposition Invariant Approximate String Matching Under Edit Distance

PEMBOBOTAN DINAMIS BERBASIS POSISI PADA APPROXIMATE STRING MATCHING

Jurnal Komputer dan Informatika ◽

10.35508/jicon.v9i2.5149 ◽

2021 ◽

Vol 9 (2) ◽

pp. 168-175

Author(s):

Sebastianus A S Mola ◽

Meiton Boru ◽

Emerensye Sofia Yublina Pandie

Keyword(s):

Edit Distance ◽

String Matching ◽

Approximate String Matching ◽

Standard Word

Komunikasi tertulis dalam media sosial yang menekankan pada kecepatan penyebaran informasi sering kali terjadi fenomena penggunaan bahasa yang tidak baku baik pada level kalimat, klausa, frasa maupun kata. Sebagai sebuah sumber data, media sosial dengan fenomena ini memberikan tantangan dalam proses ekstraksi informasi. Normalisasi bahasa yang tidak baku menjadi bahasa baku dimulai pada proses normalisasi kata di mana kata yang tidak baku (non-standard word (NSW)) dinormalisasikan ke bentuk baku (standard word (SW)). Proses normalisasi dengan menggunakan edit distance memiliki keterbatasan dalam proses pembobotan nilai mismatch, match, dan gap yang bersifat statis. Dalam perhitungan nilai mismatch, pembobotan statida tidak dapat memberikan pembedaan bobot akibat kesalahan penekanan tombol pada keyboard terutama tombol yang berdekatan. Karena keterbatasan pembobotan edit distance ini maka dalam penelitian ini diusulkan sebuah metode pembobotan dinamis untuk bobot mismatch. Hasil dari penelitian ini adalah adanya metode baru dalam pembobotan dinamis berbasis posisi tombol keyboard yang dapat digunakan dalam melakukan normalisasi NSW menggunakan metode approximate string matching.

Download Full-text

Understanding Cloud Data Using Approximate String Matching and Edit Distance

2012 SC Companion: High Performance Computing, Networking Storage and Analysis ◽

10.1109/sc.companion.2012.149 ◽

2012 ◽

Cited By ~ 2

Author(s):

Joseph Jupin ◽

Justin Y. Shi ◽

Zoran Obradovic

Keyword(s):

Edit Distance ◽

String Matching ◽

Approximate String Matching ◽

Cloud Data

Download Full-text

IMPLEMENTASI ALGORITMA APPROXIMATE STRING MATCHING PADA APLIKASI FILOSOFI BERBASIS ANDROID

KOMIK (Konferensi Nasional Teknologi Informasi dan Komputer) ◽

10.30865/komik.v2i1.977 ◽

2018 ◽

Vol 2 (1) ◽

Author(s):

Elvi Sahara Nasution ◽

Nelly Astuti Hasibuan ◽

Suginam Suginam

Keyword(s):

Critical Thinking ◽

Edit Distance ◽

String Matching ◽

Approximate Algorithm ◽

Search Pattern ◽

Approximate String Matching ◽

Greek Language ◽

Text Search ◽

Philosophical Thinking ◽

Minimum Number

Philosophy is a critical thinking framework to find solutions to all problems. The solution found to overcome a problem through critical thinking is the fruit of philosophical thinking. If the solution to a problem is not thought out carefully and critically, then it is not the fruit of philosophical thinking but only the sound. Philosophy is useful to achieve a better life, especially in a job so that you can understand the reason why the order in a job must be carried out. In understanding philosophical terms generally use foreign-language scholarship because the term philosophy is the absorption word from English, namely philosophy. While the word philosophy itself is an absorption word from the Greek language. In Greek the combination of the word philo means love and sophós, which means wisdom makes a special word, philosophia, which means love wisdom. To learn the term philosophy is very difficult, especially for ordinary people. Based on this research the author designed the Android-based Philosophy application using eclipse juno and sqlite as the database. To facilitate the search process the meaning of philosophical terms in the application the author applies the Approximate string matching algorithm. Approximate algorithm (Estimated string matching) is a problem in computer science that is applied in text search, pattern recognition and signal processing applications. For the text T [1..n] and the pattern P [1 ... m], we are expected to find all occurrences of the pattern in the text with the most edit distance is K. The edit distance between two strings is defined as the minimum number of character insertions, deletions and the replacement needed to make it the same. The results expected in this study is an application that implements the Approximate Algorithm so that the process of searching quickly in the application can help the user to more easily understand philosophical terms.Keywords: Application Philosophy, Android, String Matching, Approximate Algorithm.

Download Full-text