99爱在线视频这里只有精品_窝窝午夜看片成人精品_日韩精品久久久毛片一区二区_亚洲一区二区久久

合肥生活安徽新聞合肥交通合肥房產(chǎn)生活服務合肥教育合肥招聘合肥旅游文化藝術(shù)合肥美食合肥地圖合肥社保合肥醫(yī)院企業(yè)服務合肥法律

CISC3025代做、代寫Java,c++設(shè)計編程

時間:2024-02-07  來源:合肥網(wǎng)hfw.cc  作者:hfw.cc 我要糾錯



CISC3025 - Natural Language Processing
Project #1, 2023/2024
(Due date: 5th February, 2024)
Project Rule
This is an individual course project. You are strongly recommended to commence work on
each assignment task of the project soon after it is announced in class/UMMoodle. Students are
free to discuss the project, but they are not permitted to share any code and report.
Problem Description
This assignment asks you to implement a sequence comparison algorithm (e.g., Levenshtein
Distance). Given   = "AACGCA" and   = "GAGCTA", the objective is to match identical
subsequences as far as possible through alignment. It can be seen as a way to transforming one
sequence into the other with the substitution, insertion, and deletion of characters. The cost of
operations is considered as:
Ÿ    ( ,  ) = 0       ∈ ∑;
Ÿ    ( ,  ) = 2      ,   ∈ ∑       ≠  ;
Ÿ    ( ) =    ( ) = 1       ∈ ∑.
In the following example, three operations are applied for aligning the two sequences, i.e.,
   ( ,  ),    ( ), and    ( ). Hence, the minimum cost for such transformation is 4.
 M
The similarity of two sequences can be defined as the best score among possible alignment
between them, i.e. the minimum cost or minimum edit distance. The computation of such
alignment between two sequences can be efficiently solved by using dynamic programming
approach based on scoring matrix (Table 1):
DynamicProgramming(x, m, y, n)
1. T[-1,-1] ¬ 0
2. for j ¬ 0 to n - 1
3. do T[-1, j] ¬ T[-1, j - 1] + Ins(yj)
4. for i ¬ 0 to m - 1
5. do T[i, -1] ¬ T[i -1, - 1] + Del(xi)
6. for j ¬ 0 to n - 1
7. do T[i, j] ¬ min{ T[i-1, j - 1] + Sub(xi, yj),
8. T[i-1, j] + Del(xi),
9. T[i, j - 1] + Ins(yj)}
10. return T[m - 1, n - 1]
 ( , ) # G A G C T A
Table 1. Scoring matrix
More information regarding dynamic programming and scoring matrix can be found in Chapter
1 & Chapter 2 of [1] and [2].
Requirements
1. You are asked to implement the dynamic programming algorithm in Python. Input to the
program are two strings and the minimum cost is output as the comparison result, followed
by a possible alignment between the two strings.
The following shows a scenario of the input and outputs:
> AACGCA
> GAGCTA
The cost is: 4
An possible alignment is:
A A C G C - A
| | | | | | |
G A – G C T A
2. Extend your program to deal with sentence by taking words as the comparison units instead
of letters.
The following shows a scenario of the input and outputs:
> I love natural language processing
> I really like natural language processing course
The cost is: 4
An possible alignment is:
I love − natural language processing −
| | | | | | |
I really like natural language processing course
3
3. Write a function to compute the similarities between words in batch mode and store your
results in a file.
In the input file “word_corpus.txt”, each row contains a word and a symbol, ‘R’, or ‘H’,
indicating the correct Reference and the Hypothesis, respectively. Your program compares
each hypothesis to the reference, and appends the minimum edit distance to the
corresponding hypothesisin the output file, as shown in the following diagram. The number
of the hypotheses for each reference may be varied. The name of the output file should be
“word_edit_distance.txt”.
4. Write a similar function to compute the similarities between sentences in batch mode
“sentence_corpus.txt” and store your results in a file “sentence_edit_distance.txt”. The
References and Hypotheses are arranged in a similar way as in Requirement (3). Note, the
number of hypotheses for each reference is constant.
The Starter Code
The starter code is in the edit_distance.py. To make it easier for you to do this project, we
provide a starter code written in python. If you enter into the folder “Assignment#1” and
execute the following command:

The program will execute the function word_edit_distance( ) to calculate the edit distance
and the alignment, then output the result to the command line using the output_alignment
function( ).
Similarly, you can use the following command to test your implemented
sentence_edit_distance( ) function:
For Requirements (3) and (4), you can run the following command to specify the name of
input and output files:
Input file:
R satisfaction
H satisfacion
H satesfaction
H satisfation
H satiusfacson
.
.
.
Output file:
R satisfaction
H satisfacion 1
H satesfaction 2
H satisfation 1
H satiusfacson 4
.
.
.
$python edit_distance.py -w ‘word1’ ‘word2’
$python edit_distance.py -s ‘sentence1’ ‘sentence2’
4
The output_alignment( ) function has been already implemented to show the alignments in
a proper format.
Submissions
You need to submit the following materials:
1. Runnable program and source code;
2. A brief report containing the following contents:
• Introduction: Clearly state the goal of your project. Explain why the project is both
important and interesting in the context of NLP.
• Background: Briefly introduce one or two fundamental NLP concepts that are central
to your project.
• Approach & Challenges: Summarize your methodological approach in one concise
paragraph. Identify one significant challenge you encountered and describe how you
addressed it.
• Results: Summarize the outcomes of your project, highlighting the main findings.
• Conclusion: Reflect briefly on what you learned from the project and what was
accomplished.
3. The output files.
References
[1] C. Charras and T. Lecroq, Sequence Comparison. Université de Rouen.
(https://www.researchgate.net/profile/Thierry_Lecroq/publication/2783**5_Sequence_Com
parison/links/09e41**d23e64eb7000000.pdf)
[2] http://ultrastudio.org/en/Dynamic%20programming%20table
$python edit_distance.py -bw ‘inputfile’ ‘outputfile’
$python edit_distance.py -bs ‘inputfile’ ‘outputfile’

如有需要,請加QQ:99515681 或WX:codehelp

掃一掃在手機打開當前頁
  • 上一篇:代做Micro Language Compiler
  • 下一篇:CS 61程序代做、代寫C/C++編程設(shè)計
  • 無相關(guān)信息
    合肥生活資訊

    合肥圖文信息
    急尋熱仿真分析?代做熱仿真服務+熱設(shè)計優(yōu)化
    急尋熱仿真分析?代做熱仿真服務+熱設(shè)計優(yōu)化
    出評 開團工具
    出評 開團工具
    挖掘機濾芯提升發(fā)動機性能
    挖掘機濾芯提升發(fā)動機性能
    海信羅馬假日洗衣機亮相AWE  復古美學與現(xiàn)代科技完美結(jié)合
    海信羅馬假日洗衣機亮相AWE 復古美學與現(xiàn)代
    合肥機場巴士4號線
    合肥機場巴士4號線
    合肥機場巴士3號線
    合肥機場巴士3號線
    合肥機場巴士2號線
    合肥機場巴士2號線
    合肥機場巴士1號線
    合肥機場巴士1號線
  • 短信驗證碼 豆包 幣安下載 AI生圖 目錄網(wǎng)

    關(guān)于我們 | 打賞支持 | 廣告服務 | 聯(lián)系我們 | 網(wǎng)站地圖 | 免責聲明 | 幫助中心 | 友情鏈接 |

    Copyright © 2025 hfw.cc Inc. All Rights Reserved. 合肥網(wǎng) 版權(quán)所有
    ICP備06013414號-3 公安備 42010502001045

    99爱在线视频这里只有精品_窝窝午夜看片成人精品_日韩精品久久久毛片一区二区_亚洲一区二区久久

          亚洲精选成人| 91久久综合| 亚洲福利视频免费观看| 在线播放豆国产99亚洲| 亚洲精品日韩在线| 亚洲素人在线| 久久久久久穴| 欧美日韩综合在线| 国产亚洲欧洲| 99国产精品99久久久久久粉嫩| 正在播放亚洲| 久久综合图片| 国产精品人人做人人爽| 在线观看一区二区精品视频| 一区二区动漫| 欧美一区二区三区四区在线观看 | 在线精品高清中文字幕| 亚洲免费观看视频| 久久久久久久网| 欧美日韩精品一二三区| 国产一区二区三区无遮挡| 日韩视频不卡| 久久频这里精品99香蕉| 欧美小视频在线| 亚洲承认在线| 久久av在线看| 国产精品黄色在线观看| 在线免费一区三区| 香蕉久久一区二区不卡无毒影院| 欧美劲爆第一页| 黄色在线一区| 欧美一区二区三区久久精品| 欧美日韩久久| 亚洲国内精品在线| 欧美日韩国产123区| 黄色成人在线观看| 欧美大片在线影院| 亚洲午夜精品久久久久久app| 国产精品婷婷| 久久久xxx| 亚洲精品乱码久久久久久黑人 | 欧美亚洲日本国产| 国内综合精品午夜久久资源| 欧美在线观看一区二区| 国产精品免费视频xxxx| 一区二区三区欧美成人| 欧美日韩第一区日日骚| 亚洲人线精品午夜| 欧美成人精品| 91久久精品国产| 免费在线看一区| 在线欧美一区| 欧美成人精品1314www| 永久91嫩草亚洲精品人人| 欧美主播一区二区三区| 国产三级欧美三级日产三级99| 亚洲伊人伊色伊影伊综合网| 国产精品久久久久久久久果冻传媒| 99精品99久久久久久宅男| 欧美激情综合五月色丁香| 亚洲乱码久久| 国产精品www.| 亚洲一级片在线看| 国产精品日本一区二区| 欧美在线免费观看亚洲| 国内精品**久久毛片app| 久久一区欧美| 亚洲国产日韩欧美在线99| 欧美v国产在线一区二区三区| 亚洲激情第一页| 欧美成人有码| aa级大片欧美三级| 国产精品一区二区久久久| 午夜精品久久久久久久蜜桃app| 国产伦精品免费视频| 欧美在线一二三四区| 在线视频一区观看| 亚洲精品国产精品国产自| 一区二区三区在线视频播放| 国产欧美日本| 国产精品青草综合久久久久99| 欧美日韩精品免费观看视频完整| 美女在线一区二区| 久久久水蜜桃| 久久精品噜噜噜成人av农村| 亚洲午夜在线视频| 夜夜嗨一区二区| 日韩午夜在线电影| 亚洲免费福利视频| 亚洲高清一二三区| 伊人天天综合| 在线免费一区三区| 亚洲成在人线av| 亚洲福利在线观看| 91久久久久久久久久久久久| 亚洲黄色免费| 91久久午夜| av成人免费观看| 一区二区三区产品免费精品久久75 | 亚洲国产综合在线看不卡| 在线观看日韩专区| 亚洲国产日韩美| 亚洲精选一区| 一区二区三欧美| 亚洲一区视频在线观看视频| 亚洲欧美综合网| 久久动漫亚洲| 免费不卡亚洲欧美| 欧美精品激情在线| 欧美视频一区二区三区| 国产精品福利网| 国产日韩成人精品| 悠悠资源网亚洲青| 亚洲精品免费看| 亚洲视频第一页| 亚洲在线1234| 久久久久久久性| 欧美理论电影网| 国产精品老牛| 韩曰欧美视频免费观看| 亚洲国产天堂网精品网站| 亚洲人成网站在线观看播放| 中文在线资源观看网站视频免费不卡| 亚洲视频你懂的| 久久久不卡网国产精品一区| 欧美成人官网二区| 国产精品国产三级国产aⅴ入口| 国产婷婷色一区二区三区| 亚洲承认在线| 亚洲一区网站| 免费91麻豆精品国产自产在线观看| 欧美日韩不卡一区| 国产一区二区成人| 亚洲人成啪啪网站| 欧美亚洲在线视频| 欧美激情在线有限公司| 国产精品丝袜久久久久久app| 一色屋精品亚洲香蕉网站| 亚洲视频欧美视频| 国产精品久久9| 欧美高清免费| 欧美日韩久久久久久| 欧美亚洲不卡| 国产美女扒开尿口久久久| 国产一区二区三区久久久| 精品91免费| 亚洲精品美女| 一区二区欧美日韩| 欧美.www| 狠狠色丁香婷婷综合| 亚洲一区影音先锋| 欧美连裤袜在线视频| 激情五月***国产精品| 亚洲欧美一区在线| 欧美人与性禽动交情品| 在线电影一区| 久久精品盗摄| 国产精品夜色7777狼人| 一本大道av伊人久久综合| 久久午夜视频| 国产综合视频| 午夜欧美理论片| 国产精品成人一区二区艾草| 亚洲欧洲一区二区天堂久久 | 欧美久久综合| 亚洲国内欧美| 美女日韩欧美| 国内精品久久久久伊人av| 午夜精品久久久久久久久| 欧美日韩一区高清| 99热这里只有成人精品国产| 欧美激情女人20p| 亚洲三级视频在线观看| 欧美freesex8一10精品| 精品成人一区| 另类av一区二区| 亚洲丁香婷深爱综合| 免费亚洲一区二区| 亚洲第一黄色网| 欧美成人午夜剧场免费观看| 一区久久精品| 欧美成人首页| 亚洲七七久久综合桃花剧情介绍| 毛片基地黄久久久久久天堂 | 亚洲成人原创| 久久国产精品久久久| 国产女主播一区二区三区| 午夜精品久久久| 国产一区二区精品久久| 久久免费高清视频| 136国产福利精品导航网址应用| 牛牛影视久久网| 一区二区不卡在线视频 午夜欧美不卡在 | 国产乱码精品一区二区三区五月婷| 亚洲一区不卡| 国产真实乱子伦精品视频| 久久欧美中文字幕| 亚洲精品一区二区三区婷婷月| 欧美日韩亚洲免费| 香蕉尹人综合在线观看|