Results 41 to 50 of about 266 (115)

ALGORITMA COCKE YOUNGER KASAMI UNTUK DETEKSI STRUKTUR KALIMAT DAN MEREKOMENDASIKANYA MENGGUNAKAN ALGORITMA DAMERAU LEVENSHTEIN DISTANCE

open access: yesTelematika, 2020
Penggunaan kata baku dan struktur kalimat merupakan salah satu syarat dalam penulisan laporan penelitian, tanpa disadari kesalahan penulisan dapat terjadi baik berupa kesalahan pengetikan maupun pada struktur kalimat, beberapa penyebabnya ialah kebiasaan saat menulis pesan pendek, berkembangnya bahasa yang digunakan sehari-hari dan susunan keyboard ...
Budi Prabowo   +2 more
openaire   +2 more sources

Action Selection in Everyday Activities: The Opportunistic Planning Model

open access: yesCognitive Science, Volume 48, Issue 4, April 2024.
Abstract While action selection strategies in well‐defined domains have received considerable attention, little is yet known about how people choose what to do next in ill‐defined tasks. In this contribution, we shed light on this issue by considering everyday tasks, which in many cases have a multitude of possible solutions (e.g., it does not matter ...
Petra Wenzl, Holger Schultheis
wiley   +1 more source

PENDETEKSIAN KESALAHAN KETIK DENGAN DAMERAU-LEVENSHTEIN DISTANCE DAN TRIE

open access: yesJurnal Ilmu Komputer dan Sistem Informasi
Typographical errors are commonly found in text. Many applications implement a spell checking feature to detect and correct typographical errors. Spell checking requires an algorithm to calculate the similarity of two strings. This study compares Damerau-Levenshtein Distance and Trie in checking and correcting typographical errors in the names of ...
null James Tirta Halim   +2 more
openaire   +1 more source

Interpersonal aspects of creativity: indicating interactive level dynamics with biosignal synchrony

open access: yesDesign Science
Collaborative design (co-design) is a team effort fostered through the creative involvement of all participants in co-creative collaboration (co-creation).
Quentin Ehkirch   +3 more
doaj   +1 more source

Polish Word Recognition Based on n-Gram Methods

open access: yesIEEE Access
Word recognition of Slavic languages is not an easy task due to the complicated declension of words and a variety of diacritical signs. Polish is a representative of West Slavic languages, which are written in Latin characters. Automatic handwritten word
Piotr Wojcicki, Tomasz Zientarski
doaj   +1 more source

Penerapan Abstract Syntax Tree dan Algoritma Damerau-Levenshtein Distance untuk Mendeteksi Plagiarisme pada Berkas Source Code

open access: yesJurnal Telematika, 2019
Plagiarism source code is a program that is made up of other programs that have same syntax structure. In this research, the approach used to detect plagiarism is tree-based by building abstract syntax tree base on grammar on two predefined plagiarism files source code.
Stephanie Rusdianto, Ria Chaniago
openaire   +1 more source

SPELLING ERROR CORRECTION IN INDONESIAN USING DAMERAU-LEVENSHTEIN DISTANCE DAN N-GRAM

open access: yesJurnal Teknologi Informasi, Komputer, dan Aplikasinya (JTIKA )
Writing errors or spelling is a thing that needs to be considered because it can affect the calculations performed by some of the topics on Natural Language Processing that relies on the validity of the input data. Several studies have been conducted to correct writing errors that occur, one of which study by Fahma, A. I., et al using n-gram method and
Ramaditia Dwiyansaputra   +2 more
openaire   +1 more source

Implementation of Dictionary Lookup and Damerau-Levenshtein Distance for Correcting Non-Standard Indonesian and English Terms

open access: yesJurnal Ilmiah Merpati (Menara Penelitian Akademika Teknologi Informasi)
Indonesian, as the official language, follows the standards set by the Kamus Besar Bahasa Indonesia. Despite this, academic writing often contains errors such as non?standard word usage, typographical mistakes, and contextually inappropriate foreign terms.
Kadek Ayu Wirdiani   +2 more
openaire   +1 more source

An O(N) bit-parallel algorithm for the unrestricted Damerau-Levenshtein distance

open access: yes
A bit-parallel algorithm for computing the unrestricted Damerau-Levenshtein edit distance that runs in O(N) time for patterns of length M ≤ 64, where N is the length of the query string. The algorithm improves on the state-of-the-art O(M·N) time complexity by exploiting 64-bit CPU word-level parallelism to process all M pattern positions simultaneously.
openaire   +2 more sources

DNAsmart: Multiple attribute ranking tool for DNA data storage systems. [PDF]

open access: yesComput Struct Biotechnol J, 2023
Ezekannagha C   +3 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy