نتایج جستجو برای: الگوریتم levenshtein
تعداد نتایج: 22948 فیلتر نتایج به سال:
This paper presents an automated high-speed rolling mark recognition system for railroad rails utilizing image processing techniques. Rolling marks, which consist of numbers, letters, and special characters, were engraved into the rail web as 3D information. These marks provide crucial details regarding manufacturer, steel quality, year production, profile. As a result, they empower infrastruct...
Mesin pencarian artikel telah memudahkan akademisi melakukan studi literatur. Namun, mudah bukan berarti akurat. Untuk topik niche tertentu, hasil sering kali belum sesuai. Snowballing dapat dilakukan untuk mengatasi ini, tapi terbatas pada awal yang dimiliki, khususnya akses penulis ketika dibuat. Sebagai alternatif, database menyediakan rekomendasi relevan dari sebuah artikel, itu saja. Sebua...
Vladimir Levenshtein’s edit distance algorithm is used to reveal disparities between delimiter stripped texts of the Senate amended Treaty of Fort Laramie with Sioux, etc., 1851 as corrected in a previous study, and of other federal copies of this transaction. All of the latter deviated markedly from that newly created version, reflecting errors of exclusion, of the absence in some transcripts ...
This paper aims to predict mutual intelligibility (defined here as cross-dialectal word recognition) between 15 Chinese dialects from lexical and phonological distance measures. Distances were measured on the stimulus materials used in the experiment. Their predictive power was compared with earlier similar distance measures based on large word lists. Predictors based on just the stimulus mater...
Any cross-language processing application has to first tackle the problem of transliteration when facing a language using another script. The first solution consists of using existing transliteration tools, but these tools are not usually suitable for all purposes. For some specific script pairs they do not even exist. Our aim is to discriminate transliterations across different scripts in a un...
We consider the problem of identifying automatic translations from manual translations of the same sentence. Using two different similarity metrics (BLEU and Levenshtein edit distance), we found out that automatic translations are closer to each other than they are to manual translations. We also use phylogenetic trees to provide a visual representation of the distances between pairs of individ...
Transliteration is the general choice for handling named entities and out of vocabulary words in any MT application, particularly in machine translation. Transliteration (or forward transliteration) is the process of mapping source language phonemes or graphemes into target language approximations; the reverse process is called back transliteration. This paper presents a novel approach to impro...
This paper deals with the problem of estimating a transmitted string X, from the corresponding received string Y, which is a noisy version of X,. We assume that Y contains*any number of substitution, insertion, and deletion errors, and that no two consecutive symbols of X, were deleted in transmission. We have shown that for channels which cause independent errors, and whose error probabilities...
—Negotiation is a process between self-interested agents in ecommerce trying to reach an agreement on one or multi issues. The outcome of the negotiation depends on several parameters such as the agents' strategies and the knowledge one agent has about the opponents. One way for discovering opponent's strategy is to find the similarity between strategies. In this paper we present a simple model...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید