Similarity and differences by finite automata

author: Tamás Gaál, XEROX Research Centre Europe, Xerox

You might be experiencing some problems with Your Video player.

*Slides*
0:00	Similarity and differences by finite automata in HMMs, kernels, morphological analysers, compilers and image compressors
2:34	Language, regular expression, automaton
6:59	Chomsky hierarchy
13:16	Formal languages in practice
19:31	Finite state notions
21:54	Some FS application areas...
25:29	...and applications (cont.)
26:35	Einstein’s puzzle
53:46	Einstein’s puzzle (cont.)
57:11	Weighted finite-state automata - 1
57:30	Weighted finite-state automata - 2
57:48	Finite-state transducer (FST)
58:33	Lexical FST
62:19	Finite-state transducers
62:58	Weighted transducer (WFST)
63:02	Weighted finite state transducers (WFST)
63:12	What are weights?
64:31	Semiring: Definition
65:19	Semiring: Definition (cont.)
65:58	Semiring: Examples
67:05	Semiring: Operations on weights
67:36	Weights and semiring (example 1)
69:24	Weights and semiring (example 2)
71:00	Lexical WFST (1)
71:03	Lexical WFST (2)
71:18	Weighted-finite state compiler
72:03	WMTA definitions and notations
74:12	Basic operations
75:50	Auto-intersection (definition)
78:49	Auto-intersection (if non-regular)

Lecture rating

People found this lecture:
Worth seeing
because it is:
Valuable and informative
Well presented
Easily understandable
Acceptably recorded
You need to login to cast your vote.

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.