Search for tag: "languages"

PGHC11506 Ancient Egyptian Hieroglyphs: Week 1_1

Video by Dr Zsuzsanna Vegh for Ancient Egyptian Hieroglyphs Introduction: Week 1

From  Anna Raczynski on January 5th, 2021 0 likes 29 plays 0  

NLU+ Lecture 8: Evaluation of Machine Translation

Evaluation of Translation

From  Ruairi O'Hare on December 29th, 2020 0 likes 7 plays 0  

NLU+ Lecture 2: Machine translation

MT Excercise

From  Ruairi O'Hare on December 17th, 2020 0 likes 6 plays 0  

NLU+ Lecture 2: Machine translation

Introduction to MT

From  Ruairi O'Hare on December 17th, 2020 0 likes 7 plays 0  

MLP Interviews - Maximiliana Behnke

Machine Learning Practical interviews - Winter 2020 - Session 3/4. Maximiliana Behnke is a PhD student at the Univeristy of Edinburgh focussing on "Natural Language Processing" (NLP),…

From  Pavlos Andreadis on December 8th, 2020 1 likes 20 plays 0  

CL - 18 - rules

This is a raw video from 2019. I've not yet had time to edit it into chunks. If you have any questions, or find any errors, please let me know on Piazza.This lecture introduces a very important…

From  Haoran Peng on November 30th, 2020 0 likes 200 plays 0  

CL - 15d - Using ε-transitions

We present a first example of the use of ε-transitions to concstruct new mahines, and pose a problem to be answered in the following video.

From  Haoran Peng on November 23rd, 2020 0 likes 238 plays 0  

CL - 15b - Boolean operations on DFA-Regular Languages

Since DFA-regular languages are closed under complements and intersections, they are closed under all Boolean operations.

From  Haoran Peng on November 22nd, 2020 0 likes 303 plays 0  

CL - 14d - Regular Languages (II)

We give a second definition of regular language as the languages generated from the empty and singleton languages by the operations of, concatenation, alternation, and iteration.

From  Haoran Peng on November 20th, 2020 0 likes 156 plays 0  

CL - 14c - Regular Languages (I)

We give a first definition of regular language as a language that is accepted by some FSM.

From  Haoran Peng on November 18th, 2020 0 likes 253 plays 0  

CL - 13b - regex and FSM

We introduce some simple finite state machines, and three key ideas of the theory.The first idea is that of the language recognised by a machine. Given an alphabet of symbols, a language is a set…

From  Haoran Peng on November 17th, 2020 0 likes 362 plays 0  

CL - 11b - CNF by Boolean algebra

Description Pending

From  Haoran Peng on November 12th, 2020 0 likes 254 plays 0  

Options Fair - Bilingual Education - November 3rd 2020, 12:20:15 am

Options Fair 2020 - Bilingual Education

From  Charlotte Kemp on November 3rd, 2020 0 likes 352 plays 0  

INFD11016 Week 7: Computer Basics

Computer-Basics-Online

From  William Jackson on November 2nd, 2020 0 likes 49 plays 0  

eTandem Global Welcome Meeting Oct 2020

Recording of Welcome Meeting for eTandem Global. To introduce University of Edinburgh and partner university students to the project, the eTandem Global team, what to expect and how to get started…

From  Sarah Montgomery on October 21st, 2020 0 likes 54 plays

FP - Lecture 9 - Expression Trees as Algebraic Data Types

This is the video for the ninth FP lecture on Expression Trees as Algebraic Data Types.

From  Claudia-Elena Chirita on October 18th, 2020 0 likes 651 plays 0