日本欧洲视频一区_国模极品一区二区三区_国产熟女一区二区三区五月婷_亚洲AV成人精品日韩一区18p

COM6511代寫、Python語言編程代做

時間:2024-05-09  來源:  作者: 我要糾錯



COM4511/COM6511 Speech Technology - Practical Exercise -
Keyword Search
Anton Ragni
Note that for any module assignment full marks will only be obtained for outstanding performance that
goes well beyond the questions asked. The marks allocated for each assignment are 20%. The marks will be
assigned according to the following general criteria. For every assignment handed in:
1. Fulfilling the basic requirements (5%)
Full marks will be given to fulfilling the work as described, in source code and results given.
2. Submitting high quality documentation (5%)
Full marks will be given to a write-up that is at the highest standard of technical writing and illustration.
3. Showing good reasoning (5%) Full marks will be given if the experiments and the outcomes are explained to the best standard.
4. Going beyond what was asked (5%)
Full marks will be given for interesting ideas on how to extend work that are well motivated and
described.
1 Background
The aim of this task is to build and investigate the simplest form of a keyword search (KWS) system allowing to find information
in large volumes of spoken data. Figure below shows an example of a typical KWS system which consists of an index and
a search module. The index provides a compact representation of spoken data. Given a set of keywords, the search module
Search Results
Index
Key− words
queries the index to retrieve all possible occurrences ranked according to likelihood. The quality of a KWS is assessed based
on how accurately it can retrieve all true occurrences of keywords.
A number of index representations have been proposed and examined for KWS. Most popular representations are derived
from the output of an automatic speech recognition (ASR) system. Various forms of output have been examined. These differ
in terms of the amount of information retained regarding the content of spoken data. The simplest form is the most likely word
sequence or 1-best. Additional information such as start and end times, and recognition confidence may also be provided for
each word. Given a collection of 1-best sequences, the following index can be constructed
w1 (f1,1, s1,1, e1,1) . . . (f1,n1 , s1,n1 , e1,n1 )
w2 (f1,1, s1,1, e1,1) . . . (f1,n1 , s1,n1 , e1,n1 )
.
.
.
wN (fN,1, sN,1, eN,1) . . . (fN,nN , sN,nN , eN,nN )
(1)
1
where wi is a word, ni is the number of times word wi occurs, fi,j is a file where word wi occurs for the j-th time, si,j and ei,j
is the start and end time. Searching such index for single word keywords can be as simple as finding the correct row (e.g. k)
and returning all possible tuples (fk,1, sk,1, ek,1), . . ., (fk,nk , sk,nk , ek,nk ).
The search module is expected to retrieve all possible keyword occurrences. If ASR makes no mistakes such module
can be created rather trivially. To account for possible retrieval errors, the search module provides each potential occurrence
with a relevance score. Relevance scores reflect confidence in a given occurrence being relevant. Occurrences with extremely
low relevance scores may be eliminated. If these scores are accurate each eliminated occurrence will decrease the number of
false alarms. If not then the number of misses will increase. What exactly an extremely low score is may not be very easy
to determine. Multiple factors may affect a relevance score: confidence score, duration, word confusability, word context,
keyword length. Therefore, simple relevance scores, such as those based on confidence scores, may have a wide dynamic range
and may be incomparable across different keywords. In order to ensure that relevance scores are comparable among different
keywords they need to be calibrated. A simple calibration scheme is called sum-to-one (STO) normalisation
rˆi,j = r
γ
 
i,j
ni
k=1 r
γ
i,k
(2)
where ri,j is an original relevance score for the j-th occurrence of the i-th keyword, γ is a scale enabling to either sharpen or
flatten the distribution of relevance scores. More complex schemes have also been examined. Given a set of occurrences with
associated relevance scores, there are several options available for eliminating spurious occurrences. One popular approach
is thresholding. Given a global or keyword specific threshold any occurrence falling under is eliminated. Simple calibration
schemes such as STO require thresholds to be estimated on a development set and adjusted to different collection sizes. More
complex approaches such as Keyword Specific Thresholding (KST) yield a fixed threshold across different keywords and
collection sizes.
Accuracy of KWS systems can be assessed in multiple ways. Standard approaches include precision (proportion of relevant retrieved occurrences among all retrieved occurrences) and recall (proportion of relevant retrieved occurrences among all
relevant occurrences), mean average precision and term weighted value. A collection of precision and recall values computed
for different thresholds yields a precision-recall (PR) curve. The area under PR curve (AUC) provides a threshold independent summative statistics for comparing different retrieval approaches. The mean average precision (mAP) is another popular,
threshold-independent, precision based metric. Consider a KWS system returning 3 correct and 4 incorrect occurrences arranged according to relevance score as follows: ✓ , ✗ , ✗ , ✓ , ✓ , ✗ , ✗ , where ✓ stands for correct occurrence and ✗ stands
for incorrect occurrence. The average precision at each rank (from 1 to 7) is 1
1 , 0
2 , 0
3 , 2
4 , 3
5 , 0
6 , 0
7 . If the number of true correct
occurrences is 3, the mean average precision for this keyword 0.7. A collection-level mAP can be computed by averaging
keyword specific mAPs. Once a KWS system operates at a reasonable AUC or mAP level it is possible to use term weighted
value (TWV) to assess accuracy of thresholding. The TWV is defined by
TWV(K, θ) = 1 −
 
1
|K|
 
k∈K
Pmiss(k, θ) + βPfa(k, θ)
 
(3)
where k ∈ K is a keyword, Pmiss and Pfa are probabilities of miss and false alarm, β is a penalty assigned to false alarms.
These probabilities can be computed by
Pmiss(k, θ) = Nmiss(k, θ)
Ncorrect(k) (4)
Pfa(k, θ) = Nfa(k, θ)
Ntrial(k) (5)
where N<event> is a number of events. The number of trials is given by
Ntrial(k) = T − Ncorrect(k) (6)
where T is the duration of speech in seconds.
2 Objective
Given a collection of 1-bests, write a code that retrieves all possible occurrences of keyword list provided. Describe the search
process including index format, handling of multi-word keywords, criterion for matching, relevance score calibration and
threshold setting methodology. Write a code to assess retrieval performance using reference transcriptions according to AUC,
mAP and TWV criteria using β = 20. Comment on the difference between these criteria including the impact of parameter β.
Start and end times of hypothesised occurrences must be within 0.5 seconds of true occurrences to be considered for matching.
2
3 Marking scheme
Two critical elements are assessed: retrieval (65%) and assessment (35%). Note: Even if you cannot complete this task as a
whole you can certainly provide a description of what you were planning to accomplish.
1. Retrieval
1.1 Index Write a code that can take provided CTM files (and any other file you deem relevant) and create indices in
your own format. For example, if Python language is used then the execution of your code may look like
python index.py dev.ctm dev.index
where dev.ctm is an CTM file and dev.index is an index.
Marks are distributed based on handling of multi-word keywords
• Efficient handling of single-word keywords
• No ability to handle multi-word keywords
• Inefficient ability to handle multi-word keywords
• Or efficient ability to handle multi-word keywords
1.2 Search Write a code that can take the provided keyword file and index file (and any other file you deem relevant)
and produce a list of occurrences for each provided keyword. For example, if Python language is used then the
execution of your code may look like
python search.py dev.index keywords dev.occ
where dev.index is an index, keywords is a list of keywords, dev.occ is a list of occurrences for each
keyword.
Marks are distributed based on handling of multi-word keywords
• Efficient handling of single-word keywords
• No ability to handle multi-word keywords
• Inefficient ability to handle multi-word keywords
• Or efficient ability to handle multi-word keywords
1.3 Description Provide a technical description of the following elements
• Index file format
• Handling multi-word keywords
• Criterion for matching keywords to possible occurrences
• Search process
• Score calibration
• Threshold setting
2. Assessment Write a code that can take the provided keyword file, the list of found keyword occurrences and the corresponding reference transcript file in STM format and compute the metrics described in the Background section. For
instance, if Python language is used then the execution of your code may look like
python <metric>.py keywords dev.occ dev.stm
where <metric> is one of precision-recall, mAP and TWV, keywords is the provided keyword file, dev.occ is the
list of found keyword occurrences and dev.stm is the reference transcript file.
Hint: In order to simplify assessment consider converting reference transcript from STM file format to CTM file format.
Using indexing and search code above obtain a list of true occurrences. The list of found keyword occurrences then can
be assessed more easily by comparing it with the list of true occurrences rather than the reference transcript file in STM
file format.
2.1 Implementation
• AUC Integrate an existing implementation of AUC computation into your code. For example, for Python
language such implementation is available in sklearn package.
• mAP Write your own implementation or integrate any freely available.
3
• TWV Write your own implementation or integrate any freely available.
2.2 Description
• AUC Plot precision-recall curve. Report AUC value . Discuss performance in the high precision and low
recall area. Discuss performance in the high recall and low precision area. Suggest which keyword search
applications might be interested in a good performance specifically in those two areas (either high precision
and low recall, or high recall and low precision).
• mAP Report mAP value. Report mAP value for each keyword length (1-word, 2-words, etc.). Compare and
discuss differences in mAP values.
• TWV Report TWV value. Report TWV value for each keyword length (1-word, 2-word, etc.). Compare and
discuss differences in TWV values. Plot TWV values for a range of threshold values. Report maximum TWV
value or MTWV. Report actual TWV value or ATWV obtained with a method used for threshold selection.
• Comparison Describe the use of AUC, mAP and TWV in the development of your KWS approach. Compare
these metrics and discuss their advantages and disadvantages.
4 Hand-in procedure
All outcomes, however complete, are to be submitted jointly in a form of a package file (zip/tar/gzip) that includes
directories for each task which contain the associated required files. Submission will be performed via MOLE.
5 Resources
Three resources are provided for this task:
• 1-best transcripts in NIST CTM file format (dev.ctm,eval.ctm). The CTM file format consists of multiple records
of the following form
<F> <H> <T> <D> <W> <C>
where <F> is an audio file name, <H> is a channel, <T> is a start time in seconds, <D> is a duration in seconds, <W> is a
word, <C> is a confidence score. Each record corresponds to one recognised word. Any blank lines or lines starting with
;; are ignored. An excerpt from a CTM file is shown below
7654 A 11.34 0.2 YES 0.5
7654 A 12.00 0.34 YOU 0.7
7654 A 13.30 0.5 CAN 0.1
• Reference transcript in NIST STM file format (dev.stm, eval.stm). The STM file format consists of multiple records
of the following form
<F> <H> <S> <T> <E> <L> <W>...<W>
where <S> is a speaker, <E> is an end time, <L> topic, <W>...<W> is a word sequence. Each record corresponds to
one manually transcribed segment of audio file. An excerpt from a STM file is shown below
2345 A 2345-a 0.10 2.03 <soap> uh huh yes i thought
2345 A 2345-b 2.10 3.04 <soap> dog walking is a very
2345 A 2345-a 3.50 4.59 <soap> yes but it’s worth it
Note that exact start and end times for each word are not available. Use uniform segmentation as an approximation. The
duration of speech in dev.stm and eval.stm is estimated to be 57474.2 and 25694.3 seconds.
• Keyword list keywords. Each keyword contains one or more words as shown below
請加QQ:99515681  郵箱:99515681@qq.com   WX:codinghelp




















 

標簽:

掃一掃在手機打開當前頁
  • 上一篇:EBU6304代寫、Java編程設計代做
  • 下一篇:COM4511代做、代寫Python設計編程
  • 無相關信息
    昆明生活資訊

    昆明圖文信息
    蝴蝶泉(4A)-大理旅游
    蝴蝶泉(4A)-大理旅游
    油炸竹蟲
    油炸竹蟲
    酸筍煮魚(雞)
    酸筍煮魚(雞)
    竹筒飯
    竹筒飯
    香茅草烤魚
    香茅草烤魚
    檸檬烤魚
    檸檬烤魚
    昆明西山國家級風景名勝區
    昆明西山國家級風景名勝區
    昆明旅游索道攻略
    昆明旅游索道攻略
  • NBA直播 短信驗證碼平臺 幣安官網下載 歐冠直播 WPS下載

    關于我們 | 打賞支持 | 廣告服務 | 聯系我們 | 網站地圖 | 免責聲明 | 幫助中心 | 友情鏈接 |

    Copyright © 2025 kmw.cc Inc. All Rights Reserved. 昆明網 版權所有
    ICP備06013414號-3 公安備 42010502001045

    日本欧洲视频一区_国模极品一区二区三区_国产熟女一区二区三区五月婷_亚洲AV成人精品日韩一区18p

              1024日韩| 欧美激情中文不卡| 亚洲三级视频| 国产伦精品一区二区三区高清版| 久久亚洲电影| 亚洲欧美日韩在线观看a三区| 亚洲国产精品久久人人爱蜜臀| 国产精品久久久久aaaa| 欧美精品入口| 免费成人av| 久久久99免费视频| 亚洲欧美综合精品久久成人| 亚洲美女性视频| 亚洲国产激情| 在线观看欧美精品| 激情久久综艺| 激情小说另类小说亚洲欧美| 国产精品视频xxxx| 国产精品一区免费视频| 国产精品久久精品日日| 欧美日韩高清在线播放| 日韩西西人体444www| 亚洲第一视频网站| 亚洲高清视频在线观看| 极品少妇一区二区三区精品视频| 国产一区二区三区成人欧美日韩在线观看 | 欧美成人自拍视频| 久久这里有精品视频| 久久精品免费电影| 久久久久国产精品人| 欧美在线高清视频| 久久精品国产视频| 久久一本综合频道| 欧美aⅴ一区二区三区视频| 毛片一区二区| 欧美激情亚洲| 国产精品99一区二区| 国产精品视频网址| 狠狠色综合一区二区| 在线成人欧美| 亚洲天堂av在线免费| 午夜久久久久久久久久一区二区| 欧美一区二区在线看| 久久蜜桃资源一区二区老牛| 欧美成人dvd在线视频| 欧美日韩视频在线| 国产日韩亚洲欧美精品| 狠狠综合久久| 一本色道久久综合亚洲精品不 | 国产欧美日韩在线| 亚洲成人自拍视频| 99精品国产在热久久婷婷| 亚洲一区二区三区国产| 久久成人精品一区二区三区| 欧美va天堂| 国产欧美综合一区二区三区| 在线观看三级视频欧美| 一区二区三区视频观看| 久久精品最新地址| 欧美视频一区在线| 一区二区三区我不卡| 宅男精品视频| 免费看亚洲片| 国产日韩欧美a| 日韩小视频在线观看| 久久久久综合| 国产精品美女| 日韩一级免费观看| 久久这里有精品视频| 国产精品高清在线| 亚洲欧洲一区二区天堂久久| 欧美亚洲一级| 国产精品成人一区二区网站软件 | 亚洲国产婷婷| 久久精品一级爱片| 国产精品亚洲网站| 亚洲天堂av在线免费观看| 暖暖成人免费视频| 国产在线拍揄自揄视频不卡99| 国产精品99久久久久久久久久久久| 麻豆av福利av久久av| 国产精品免费一区二区三区观看| 亚洲精品1区2区| 免费亚洲电影在线观看| 国内视频一区| 久久久久久综合| 国内精品久久久久影院色| 欧美亚洲一级| 国产午夜亚洲精品羞羞网站| 亚洲性夜色噜噜噜7777| 欧美色一级片| 一区二区三区欧美亚洲| 欧美日韩精品免费看| 日韩网站免费观看| 欧美男人的天堂| 99re热这里只有精品免费视频| 欧美激情久久久久| 99精品国产热久久91蜜凸| 欧美久久婷婷综合色| 日韩视频中文| 国产精品美女久久久久久免费| 亚洲深夜福利视频| 国产乱码精品一区二区三区不卡| 国产精品99久久99久久久二8| 欧美午夜一区二区| 午夜久久福利| 极品少妇一区二区| 欧美不卡视频一区发布| 亚洲精品一区中文| 欧美日韩国产91| 亚洲欧洲av一区二区三区久久| 国产精品一区久久久久| 欧美一区二区三区免费视频| 伊甸园精品99久久久久久| 欧美va天堂| 亚洲综合首页| 红桃av永久久久| 欧美精品日韩综合在线| 亚洲欧美日韩在线高清直播| 国产日本精品| 欧美人交a欧美精品| 亚洲欧美日韩国产中文| 极品av少妇一区二区| 欧美电影免费观看高清| 在线亚洲电影| 国内自拍亚洲| 国产精品wwwwww| 久久夜色精品国产欧美乱| 中文网丁香综合网| 狠狠久久综合婷婷不卡| 欧美日韩三级在线| 久久久91精品国产| 精品动漫av| 国产精品一区二区欧美| 欧美成人第一页| 欧美在线免费观看| 一本色道久久综合亚洲精品小说| 国产一区二区三区观看| 欧美久久久久免费| 香蕉久久夜色精品| 99综合精品| 亚洲国产日韩欧美在线动漫| 国产精品一区视频网站| 欧美日韩午夜在线| 牛人盗摄一区二区三区视频| 香港久久久电影| 亚洲视频碰碰| 99国产精品99久久久久久| 在线不卡中文字幕| 激情久久婷婷| 国产日韩欧美三区| 国产精品亚洲аv天堂网| 欧美日韩精品是欧美日韩精品| 噜噜噜噜噜久久久久久91| 久久国产免费| 久久成人免费视频| 欧美一级片在线播放| 一区二区三区视频在线| 亚洲欧洲在线免费| 亚洲激情另类| 亚洲欧洲日夜超级视频| 亚洲第一黄网| 亚洲经典自拍| 亚洲美女免费精品视频在线观看| 伊人夜夜躁av伊人久久| 激情欧美一区二区| 伊人久久大香线| 亚洲国产精品一区制服丝袜| 在线观看91精品国产入口| 极品少妇一区二区| 亚洲人成毛片在线播放| 亚洲激情在线播放| 日韩午夜在线播放| 亚洲字幕一区二区| 欧美在线视频日韩| 理论片一区二区在线| 欧美成人资源网| 欧美日韩国产成人在线观看| 欧美日韩免费高清| 国产精品视频xxx| 国产一区再线| 亚洲欧洲一区二区天堂久久| 亚洲精品久久久一区二区三区| 日韩视频中文| 午夜在线观看免费一区| 久久久久久婷| 欧美日韩91| 国产精品性做久久久久久| 国产综合色产在线精品| 亚洲欧洲另类| 欧美一级理论片| 欧美激情成人在线| 国产精品美女久久久免费| 国产日韩欧美一区在线 | 欧美成人精品在线播放| 欧美精品电影在线| 国产欧美成人| 99热在线精品观看| 久久久777| 国产精品扒开腿做爽爽爽视频|