Results 61 to 70 of about 18,471 (230)

An Algorithm For Building Language Superfamilies Using Swadesh Lists [PDF]

, 2020
The main contributions of this thesis are the following: i. Developing an algorithm to generate language families and superfamilies given for each input language a Swadesh list represented using the international phonetic alphabet (IPA) notation. ii. The
Mutabazi, Bill
core   +1 more source

Metrics‐First, Language‐Aware Clone Type Recognition: Auditable Signals Across C, C#, Java, and Python

Journal of Software: Evolution and Process, Volume 38, Issue 5, May 2026.
ABSTRACT Modern clone research has largely converged on powerful end‐to‐end detectors, yet practitioners still lack auditable guidance on which concrete code characteristics best distinguish clone types and whether those signals transfer across languages.
Nikunj Panchal, Abdul Qayum, Abdul Shahid, Abdul Razzaq   +3 more
wiley   +1 more source

Improving Computational Efficiency and Accuracy of Damerau-Levenshtein Distance for Indonesian Spelling Correction using Cosine Similarity

Journal of Innovation Information Technology and Application
Spelling correction is an automatic correction feature useful in detecting spelling errors and providing word suggestions if necessary. Spelling correction is one of the crucial preprocessing phases in text mining. The Damerau-Levenshtein Distance method
husni husni, Yoga Dwitya Pramudita, Mohammad Syarief, Army Justitia, Ika Oktavia Suzanti   +4 more
doaj   +1 more source

Dissimilarity Measure Properties of Binary Test Patterns of Controlled Random Tests

Доклады Белорусского государственного университета информатики и радиоэлектроники, 2023
The problem of application of the dissimilarity measures for binary test sequences is investigated. Their relevance in generating controlled random tests is substantiated.
V. N. Yarmolik, V. V. Petrovskaya, A. A. Ivaniuk   +2 more
doaj   +1 more source

Measures of lexical distance between languages

, 2009
The idea of measuring distance between languages seems to have its roots in the work of the French explorer Dumont D'Urville \cite{Urv}. He collected comparative words lists of various languages during his voyages aboard the Astrolabe from 1826 to 1829 ...
Bakker, D’Urville, Filippo Petroni, Gray, Gray, Holman, Maurizio Serva, Petroni, Serva, Starostin, Swadesh   +10 more
core   +1 more source

DETEKSI PLAGIARISME MENGGUNAKAN ALGORITMA LEVENSHTEIN DISTANCE

Jurnal Teknologi Informasi Universitas Lambung Mangkurat (JTIULM), 2021
Deteksi kesamaan dokumen untuk sistem plagiarisme termasuk dalam riset Natural Language Processing dalam bidang kecerdasan buatan. Plagiarisme banyak terjadi pada dokumen di lingkungan akademisi, begitupun yang terjadi pada PSMTS ULM. Deteksi plagiarisme diperlukan agar menjaga orisinalitas dari hasil tesis mahasiswa.
null Yuslena, Husnul Khatimi, Rizky Aulia Fajrin   +2 more
openaire   +2 more sources

Unsupervised Work Behavior Pattern Extraction Based on Hierarchical Probabilistic Model

IEEJ Transactions on Electrical and Electronic Engineering, Volume 21, Issue 5, Page 693-703, May 2026.
In this study, we address the challenge of analyzing worker behaviors in high‐mix, low‐volume production environments, where traditional supervised learning methods struggle owing to the lack of labeled data and task variability among workers. To overcome these issues, we propose a novel hierarchical approach for unsupervised behavior pattern ...
Issei Saito, Tomoaki Nakamura, Toshiyuki Hatta, Wataru Fujita, Shintaro Watanabe, Shotaro Miwa   +5 more
wiley   +1 more source

Energy bounds for codes and designs in Hamming spaces

, 2016
We obtain universal bounds on the energy of codes and for designs in Hamming spaces. Our bounds hold for a large class of potential functions, allow unified treatment, and can be viewed as a generalization of the Levenshtein bounds for maximal codes ...
Boyvalenkov, Peter G., Dragnev, Peter D., Hardin, Douglas P., Saff, Edward B., Stoyanova, Maya M.   +4 more
core   +1 more source

Serial Computations of Levenshtein Distances [PDF]

, 1997
In the previous chapters, we discussed problems involving an exact match of string patterns. We now turn to problems involving similar but not necessarily exact pattern matches. There are a number of similarity or distance measures, and many of them are special cases or generalizations of the Levenshtein metric. The problem of evaluating the measure of
openaire   +1 more source

Overreliance on Orthographic Similarity in L2‐Japanese Conceptual Processing by L1‐Chinese Learners

International Journal of Applied Linguistics, Volume 36, Issue 2, Page 1807-1820, May 2026.
ABSTRACT Orthographic and phonological similarities between first (L1) and second (L2) languages can facilitate L2 processing. Particularly, L1‐Chinese learners of L2‐Japanese can benefit from the shared morphosyllabic Chinese characters (Japanese kanji/Chinese hanzi) because of their similar orthographies.
Xuehan Zhao, Kexin Xiong, Sachiko Kiyama
wiley   +1 more source