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爱在线视频这里只有精品_窝窝午夜看片成人精品_日韩精品久久久毛片一区二区_亚洲一区二区久久

          久久精品国产2020观看福利| 一区二区免费在线播放| 国产精品一区二区a| 久久综合狠狠综合久久综青草 | 日韩一二在线观看| 一区在线观看| 国产精品大片wwwwww| 久久国产精品久久久久久电车| 欧美精品成人| 亚洲国产精品美女| 麻豆国产va免费精品高清在线| 欧美日韩在线视频首页| 国内精品久久久久久久影视麻豆| 性欧美xxxx视频在线观看| 欧美体内谢she精2性欧美| 在线视频欧美一区| 国产精品久久久久久久久借妻 | 久久本道综合色狠狠五月| 国产日产亚洲精品| 一区二区三区四区国产| 国产精品久久久久久久久久免费| 久久精品女人| 亚洲天堂免费在线观看视频| 欧美亚州韩日在线看免费版国语版| 国产欧美不卡| 亚洲欧美国产高清va在线播| 国产精品免费观看视频| 久久青草久久| 麻豆精品精华液| 欧美在线亚洲一区| 亚洲盗摄视频| 在线成人激情视频| 亚洲国产成人在线视频| 亚洲国产欧美日韩另类综合| 亚洲电影一级黄| 亚洲国产网站| 亚洲日韩视频| 一本色道久久综合狠狠躁篇怎么玩 | 国产欧美一区二区视频| 国产情人节一区| 国产午夜精品全部视频在线播放| 国产欧美日韩另类一区| 国产综合自拍| 亚洲电影av在线| 亚洲精品影院| 亚洲午夜免费福利视频| 亚洲女爱视频在线| 欧美中文在线视频| 免费国产一区二区| 欧美精品免费在线观看| 欧美性色视频在线| 国产精品美女久久久久久免费| 国产欧美大片| 在线免费观看日韩欧美| 日韩视频免费观看| 亚洲午夜影视影院在线观看| 欧美与黑人午夜性猛交久久久| 久久精品国产一区二区电影| 免费毛片一区二区三区久久久| 欧美精品一区二区三区蜜桃 | 香蕉久久一区二区不卡无毒影院| 欧美一区影院| 欧美成人精品福利| 国产精品免费aⅴ片在线观看| 国内自拍一区| 亚洲麻豆视频| 久久国产66| 欧美日韩亚洲一区二| 国产伦精品一区二区三区在线观看| 狠狠入ady亚洲精品| 亚洲精品综合精品自拍| 欧美亚洲三区| 欧美国产在线观看| 国产伦精品一区二区三区四区免费| 尤物九九久久国产精品的特点 | 国产综合第一页| 亚洲人成在线观看一区二区| 亚洲愉拍自拍另类高清精品| 久久综合久久美利坚合众国| 国产精品国产三级国产专区53 | 亚洲国产日本| 午夜精品久久久久久久99樱桃 | 美女图片一区二区| 国产精品一区一区| 9国产精品视频| 久久久久网址| 国产精品视频免费观看www| 亚洲第一搞黄网站| 欧美一级在线播放| 欧美午夜精品久久久| 亚洲国产精品ⅴa在线观看| 午夜精品久久久久久久99黑人| 欧美激情在线播放| 伊人久久综合| 欧美伊人久久| 国产精品欧美在线| 日韩一区二区高清| 久久深夜福利免费观看| 国产亚洲一区二区三区| 在线性视频日韩欧美| 欧美高清影院| 亚洲高清在线观看| 久热re这里精品视频在线6| 国产精品天美传媒入口| 99国产精品| 欧美精品九九99久久| 1024成人网色www| 欧美伊人久久久久久久久影院| 欧美日韩午夜激情| 日韩视频中午一区| 欧美99在线视频观看| 精品999在线观看| 久久精品国产亚洲一区二区| 国产精品推荐精品| 亚洲欧美一区二区三区久久 | 久久久久国产精品一区| 亚洲午夜久久久久久久久电影院 | 午夜精品久久久久久久久| 美女91精品| 在线日韩成人| 久久久久久久综合狠狠综合| 国产精品羞羞答答xxdd| 亚洲欧美视频一区| 国产精品免费在线| 在线视频免费在线观看一区二区| 欧美丰满少妇xxxbbb| 国产精品99久久久久久www| 欧美剧在线观看| 亚洲人屁股眼子交8| 欧美激情精品久久久久久蜜臀| 亚洲国产成人不卡| 欧美电影免费观看高清| 亚洲精品一区中文| 亚洲第一黄色| 欧美激情视频网站| 一本综合久久| 国产亚洲成人一区| 巨乳诱惑日韩免费av| 亚洲一区二区三区涩| 国产精品第三页| 久久精品免视看| 日韩午夜一区| 伊人久久综合97精品| 久久精品国产成人| 99精品热6080yy久久| 国内精品99| 欧美网站在线| 久色婷婷小香蕉久久| 一区二区高清视频| 一区二区三区在线免费视频| 欧美日韩在线观看一区二区三区| 欧美专区一区二区三区| 欧美在线在线| 亚洲午夜在线视频| 亚洲欧美日韩国产一区二区三区| 欧美一区二区三区四区夜夜大片 | 亚洲人成网站精品片在线观看 | 久久精品99| 欧美日韩久久| 欧美视频福利| 午夜精品免费视频| 在线看无码的免费网站| 欧美精品国产| 欧美一级网站| 亚洲激情网站| 国产精品区二区三区日本| 久久躁狠狠躁夜夜爽| 日韩一级片网址| 国内成+人亚洲| 欧美日韩亚洲一区二区三区在线观看 | 国产情侣久久| 国产欧美日韩综合| 国产亚洲精久久久久久| 欧美日韩三级视频| 欧美日韩国产不卡在线看| 久久久久国产一区二区| 午夜精品久久久久久久久久久| 亚洲网站视频福利| 亚洲一区二区精品| 蜜桃av噜噜一区| 亚洲高清在线| 欧美mv日韩mv亚洲| 国产女人18毛片水18精品| 欧美高清视频在线观看| 亚洲色图自拍| 亚洲高清不卡av| 国产亚洲精品久久久| 欧美日韩国语| 欧美成人免费小视频| 欧美一站二站| 亚洲综合国产| 一区二区三区四区国产| 亚洲精品美女91| 在线播放日韩| 国产亚洲一区二区三区在线观看 | 国内精品99| 国产精自产拍久久久久久| 欧美片在线观看| 美国十次了思思久久精品导航| 久久国内精品视频|