วีดีโอ

Thank you so much, it's the first explanation of how to actually do composition that I've seen.

very nice explanation

Many thanks! I am going through hbka.pdf (WFST paper); found difficult to grasp just from notations without an example. The way of example always helps.

Thanks for the great content, can you leave the link to download Hori's book

It would be more great if it mentions Tropical is used for edit distance computation, and Log is used for probability and entropy computation.

2:42, the first string would not be accepted. This machine only checks the pattern "10" in the last 2 characters of the input.

Thank you!

Very well explained! Thank you!!

Thank you for the lecturers. They helped me greatly !

Thank you!

maybe there is a typo in Example 1 1 x 1 -> 1 + 1>

Thanks for such a good content

There is a bug on the fourth iteration slide, the table in the first column Input/Output/Weight of A should say 2_A and not 3_A

Nice lectures! Thanks

thanks a lot

Wonderful lectures! Thank you very much!

Amazing

Excellent videos!

Thank you very much for this lecture, very clear!

Thank you Sir, very nice lectures.

Really nice,your entire series helped me!

Thank you for the lectures ! Throughly enjoyed and learned from them all !

In the distributivity check at 7:00, why do you check the (z.x)+(z.y) = z.(x+y) , isn't that same as the first check?

Typo in the slide: "Stochastic WFST: ...the sum of all transition *weights* leaving...". What you *say* is correct.

I'm lost finally....

nice explanation of FSA thanks

Nice work! Thank you!

What does the red check mark mean?

Is the difference between a ring and a semiring that in the latter, the addition operator need not have the inverse property?

Do you have many colleagues from India?

Do you have many colleagues from India?

epsilon is not defined 1:43 . You have used uppercase A to denote the set of input labels in slide 1 but 1:43 uses Sigma.

The set of output labels Delta at 8:24 is not defined in your slides 4:06

There's an error at 1:52 。The first string is invalid as it ends at state x1

Why can the min for example be replaced with the addition operator? Could you please elaborate more?

Hi, your videos are very concise and helpful. Can you also post videos related to tree transducers ?

Very good video. Wouldn't a deterministic finite state transducer also need to not have any epsilon transitions as their presence would require a choice to be made to either follow a labelled transition and consume input or to follow the epsilon and consume nothing?

I have a question. Why probability does not satisfy multiplication commutativity?

a good entry video as the first step to understand FST (for people that understand states, transitions)

These are very well explained, thank you!

Good lectures!! THX!!!

nice explanation style

The worked example would be much easier to follow if states had alphabetical labels instead of numeric ones :( Everything is 0,1, 2

The semiring videos were very clear and interesting and came with the idea that "they would be used later", but here I feel that the motivation for doing a composition (or other operations) hasn't been explained: what could we use it for?

good job

Wonderful lectures! THANK YOU VERY MUCH!

感觉有点印度口音,但还是能听懂,哈哈,谢谢老师~

Clear explanation

a good help

Thanks for your introduction! I have a question, Why the V[1] should be calculated as the sum of 1.5 and the special 0? There is only one path from state 1 to final state, why should we do the sum operation?