نتایج جستجو برای: الگوریتم levenshtein

تعداد نتایج: 22948  

Journal: :Speech Communication 2009
Wilbert Heeringa Keith Johnson Charlotte Gooskens

Computational dialectometry has been proven to be useful for finding dialect relationships and identifying dialect areas. The first to develop a method of measuring dialect distances was Jean Séguy, assisted and inspired by Henri Guiter (Chambers and Trudgill, 1998). Strongly related to the methodology of Séguy is the work of Goebl, although the basis of Goebl’s work was developed mainly in dep...

Journal: :Journal of Quantitative Linguistics 2011
Filippo Petroni Maurizio Serva

The idea of measuring distance between languages seems to have its roots in the work of the French explorer Dumont D’Urville (1832). He collected comparative word lists of various languages during his voyages aboard the Astrolabe from 1826 to1829 and, in his work about the geographical division of the Pacific, he proposed a method to measure the degree of relationship among languages. The metho...

Journal: :IEEE Trans. Information Theory 1991
Miodrag V. Zivkovic

An algorithm is given for the reconstruction of the initial state of a key–stream generator (KSG) consisting of a short linear feedback shift register (length ≤ 30), whose clock is controlled by an algebraically simple internal KSG. The algorithm is based on the fact that the expected number of possible LFSR initial states exponentially decreases with the length of the known part of the output ...

1999
John Nerbonne Wilbert Heeringa Peter Kleiweg

This project measures and classifies language variation. In contrast to earlier dialectology, we seek a comprehensive characterization of (potentially gradual) differences between dialects, rather than a geographic delineation of (discrete) features of individual words or pronunciations. More general characterizations of dialect differences then become available. We measure phonetic (un)related...

2010
Uwe D. Reichet Raphael Winkelmann

This paper deals with new methods for phoneme-to-phoneme (P2P) alignment and conversion. Alignment is carried out by dynamic programming for Levenshtein distance calculation. Cost functions based on phoneme co-occurrence statistics and on distinctive feature vector distances accounting for connected speech processes are comparatively evaluated. Given the aligned data, decision trees for P2P con...

2009
Anton Bogdanovych Mathias Bauer Simeon J. Simoff

This paper proposes a method to assess the cognitive state of a human embodied as an avatar inside a 3-dimensional virtual shop. In order to do so we analyze the trajectories of the avatar movements to classify them against the set of predefined prototypes. To perform the classification we use the trajectory comparison algorithm based on the combination of the Levenshtein Distance and the Eucli...

Journal: : 2023

صفحه‌­ی مینیاتوری LEU پرتودهی شده در رآکتور تحقیقاتی تهران که برای تولید رادیوایزوتوپ مولیبدن-99 استفاده می‌شود، منبع پرتوزایی متشکل از رادیوایزوتوپ‌های مختلف است. محاسبه و تخمین آهنگ دز تابش‌های گامای گسیلی این منبع، به منظور مقایسه با مقادیر مجاز توصیه حمل‌ونقل مواد پرتوزا حفاظت پرتویی کارکنان حین انجام تست‌های آزمایشگاهی داغ، پیش هر اقدام عملی، امری ضروری مقاله، اعتبار یک روش پیشنهادی جهت هد...

Journal: :Journal of Computer Science and Cybernetics 2022

Big data processing is attracting the interest of many researchers to process large-scale datasets and extract useful information for supporting providing decisions. One biggest challenges problem querying large datasets. It becomes even more complicated with similarity queries instead exact match queries. A fuzzy join operation a typical frequently used in big analysis. Currently, there very l...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید