VBM668 - SPEECH RECOGNITION

Course Name Code Semester Theory
(hours/week)
Application
(hours/week)
Credit ECTS
SPEECH RECOGNITION VBM668 Any Semester/Year 3 0 3 6
PrequisitesNone
Course languageTurkish
Course typeElective 
Mode of DeliveryFace-to-Face 
Learning and teaching strategiesLecture
Preparing and/or Presenting Reports
Project Design/Management
 
Instructor (s)Assist. Prof. Dr. Harun Artuner 
Course objectiveLearning of Speech Recognition basic concepts and developed of implementation areas. 
Learning outcomes
  1. ? Basic consepts of Speech recognition
  2. ? Speech recognition methods
  3. ? Application of speech recognition
Course ContentBasic consepts of Speech recognition. Speech Recognition algorithms. Language models, Application of speech recognition. 
ReferencesLawrence Rabiner, Fundamentals of Speech Recognition, Prentice Hall, 1993.
Frederick Jelinek, Statistical Methods for Speech Recognition (Language, Speech, and Communication), A Bradford Book, 1998
 

Course outline weekly

WeeksTopics
Week 1Signal Processing and defining of speech data
Week 2Basic consepts of Speech Recognition
Week 3Speech Recognition techniques
Week 4Speech Recognition techniques (cont.)
Week 5Language definitions
Week 6Project I
Week 7Speech Recognition Implementations
Week 8Speech Recognition Implementations (cont.)
Week 9Case Study
Week 10Case Study (cont.)
Week 11Project II
Week 12Research presentations
Week 13Research presentations
Week 14Research presentations
Week 15Research presentations
Week 16Final exam

Assesment methods

Course activitiesNumberPercentage
Attendance1410
Laboratory00
Application00
Field activities00
Specific practical training00
Assignments00
Presentation00
Project240
Seminar115
Midterms00
Final exam135
Total100
Percentage of semester activities contributing grade succes065
Percentage of final exam contributing grade succes035
Total100

WORKLOAD AND ECTS CALCULATION

Activities Number Duration (hour) Total Work Load
Course Duration (x14) 14 3 42
Laboratory 0 0 0
Application000
Specific practical training000
Field activities000
Study Hours Out of Class (Preliminary work, reinforcement, ect)9545
Presentation / Seminar Preparation13030
Project000
Homework assignment24080
Midterms (Study duration)000
Final Exam (Study duration) 11010
Total Workload2788207

Matrix Of The Course Learning Outcomes Versus Program Outcomes

D.9. Key Learning OutcomesContrubition level*
12345
1. Has detailed knowledge about data and knowledge engineering (DKE).   X 
2. Has a good understanding of common concepts such as abstraction, complexity, security, concurrency, software lifecycle and applies their expertise to the effective design, development and management of IS.  X  
3. Understands the interaction of theory and practice and the links between them.  X  
4. Has the ability to think at different levels of abstraction and detail; understands that an IS can be considered in different contexts, going beyond narrowly identifying implementation issues.   X 
5. Solves any technical or scientific problem independently and presents the best possible solution; has the communication skills to clearly explain the completeness and assumptions of their solution.    X
6. Completes a project on a larger scale than an ordinary course project in order to acquire the skills necessary to work efficiently in a team.    X
7. Recognises that the field of DKE is rapidly evolving. Follows the latest developments, learns and develops skills throughout their career.  X  
8. Recognises the social, legal, ethical and cultural issues related to DKE practice and conduct professional activities in accordance with these issues. X   
9. Can make oral presentations in English and Turkish to different audiences face-to-face, in writing or electronically. X   
10. Recognises that DKE has a wide range of applications and opportunities.    X
11. Is aware that DKE interacts with different fields, can communicate with experts from different fields and can learn necessary field knowledge from them.    X
12. Define a research problem and use scientific methods to solve it.    X 

*1 Lowest, 2 Low, 3 Average, 4 High, 5 Highest