It's rare to find a complex concept explained so clearly. Fantastic work. Hope your voice is better now :)

I'm pretty sure you forgot to mention that starting terminal (S in this case) needs to be in the top row cell, otherwise the string is not part of the grammar.

@dofkaw

3 жыл бұрын

@Gazi Mashrur I have no idea what this video is at the moment. But I will check tomorrow or the day after and will let you know, if I find out.

@sammas3179

3 жыл бұрын

@@dofkaw It has been 2 years since you first saw it, probably because of uni, do you actually use this?:p

@marcuschiu8615

3 жыл бұрын

@Gazi Mashrurif you are talking about 𝐴,𝑆 and 𝑆,𝐴 which are written in the grid they mean the same thing because the comma denotes OR and order doesn't matter. HOWEVER, if you are talking about 𝐴𝑆 and 𝑆𝐴 which are produced by the cartesian product then they are not the same, order matters in this case.

@funnyreddit4600

3 жыл бұрын

@Gazi Mashrur yes it is . idk f im too late but it is for anyone concerned

@husseinyoussef6998

3 жыл бұрын

It's called start variable tho, not terminal

You sound truly miserable in this video but now I understand the CYK algorithm, so thanks!

@XxwookiedancerxX

4 жыл бұрын

lmao

@user-ym4yt9bo2u

3 жыл бұрын

he sounds like he's being held at gunpoint to explain this

@noahross3642

3 жыл бұрын

Lol

absolutely the best, I watched three videos before this one but none of them explained this clearly as you did

thank you so much, I appreciate it! It was the best video that I've found, it explains easily the CYK algorithm!

Probably one of the best explanations for beginners to the algorithm. Thanks!

You are a legend. I tried to figure this out for hour and a half. You managed to basicaly explain it in 4 minutes. The rest was just you showing it for better understanding. i love it.

Finally ! a very well explained example. Thank you very much !

Not even my teacher explained it this clearly. Thank you very much sir. Helped a lot.

That was a legitimately awesome explanation! Thanks a ton!

I searched for a good explanation in the last 3 days and none of them was good, but your explanation is great! Finally understood this thing :D

Thank you so much. Was studying for finals and you explained the concept better than the PhD professor.

Thank you so much, dude!!!! you totally nailed it with your explination. I know it's a little bit late but I hope you got well quickly!!!

After many years, still a gold to watch. Your video is better than all free AI explanations.

And I was trying to avoid this question from Unit 4 of my Pattern Recognition Course. Now I'm gonna attempt this specifically. Thanks for clarifying so well!

Great Work Out There Buddy. I gonna have a 'formal language and autamata ' exam in university and this video really helped me..

Best explanation. Couldn't have figured this out without it. You're doing the lord's work man. 10/10

THE BEST TUTORIAL! THANK YOU FROM ROMANIA!

Thank you soooooo much!!!!! This is the best video I've ever seen on this topic. It's a lot better than the lecture conducted by my professor.

This was helpful and, surprisingly, intuitive as promised.

In a Foundations of CS masters course right now. This video is so much better than the explanation my professor gave. Thank you!

The best one simply because you showed the different substring combinations you could get and why we could represent those with the values we derived before. Also easier to connect this with why it has to be in Chomsky-normal-form because we need binary derivations for the cartesian products. Not sure everyone who made a video on this understands that. Thank you!

thank you so so much. I was stuck and resourced to KZread. I wish there are more people like you

very good explanation saved me a lot of time!! Cheers!!

Tnx a lot man... Best video about CYK algorithm so far

This was really useful. Thank you!

this video was better than lecture, office hours, textbook, websites, other solutions. Thanks so much!

Awesome tutorial! Crisp and clear.

Thank you so much!

WoW you just saved my life, I have a test on this in 2hours and 15 min were enough to understand thanks to you

Thank you man, i really appreciate the explanation

Only after this video I finally got it! Thank you so much!

Thank you very much! It is very clear and helpful!

Woah.. Beautifully explained.. This ones simple as hell .. Thanks a ton

You helped me a lot , thanks

Thank you bro now I also get how the index works in the pseudo code!

How can we read the parse tree from the table? Great video btw!

Great explanation, Thanks!

Great video, thanks a lot!

thank you so much it's for my finals and i got everything so clear

Great video, very easily explained.

Very good explanation. Thank you!

Really appreciate your explanation , it’s really helpful for me , I was very frustrated with the textbook.

Hey do you know how can I have a sentences in the Chomsky normal form or something like that? btw thank you so much!

Loved Your explanation of this video on this topic

Bro explained this so well. Such a hard concept

Very helpful video! Thanks :D

The useful video ever about this algorithm! Thanks.

Explained very well. Thanks

You are an actual life saver :)))) thank you very much for this tutorial

great explanation! huge thanks

ty for nice explanation!

Superb explanation! Thank you lots.

The best ever easy and clear, wish you will get well and you can speak loud :)

Finally someone did a clear explanation. Thanks.

could you explain how you make a parse tree or derivation tree from this table?

Qué grande capo!! Barrilete cósmico, crack! Saludos desde Argentina.

Very cool, thank you

You explained it quite nice. Thank you...

Very helpful! Thank you!

Very good explanation thank you sir!

I finally get it, cheers mate !

Thank you 🙏🏻

best video out there on CYK example

thank you so much!

This video was amazing!

Thank you, very clear explanation _:)

Thanks for the clear explanation. Need it for my exam at the university

You are amazing brother u have a great mind , one of a kind

Thank you!

Thanks alot watched many videos but none of them explained so clearly..

With this method, how would I be able to find in what position an entry appears in the table? I have a problem like this and I know what the correct answer is, but I don't know how to find that answer.

Important note: After you finish this CYK algorithm, if the starting symbol of the grammar (in this case S) is in the top-row (last row) of our procedure, then the given input string is part of the grammar, otherwise it is not. In this case S is part of {S, A, C} which means that the given input string "baaba" is part of the grammar defined by the production rules. The time complexity of the CYK algorithm is O(n^3) where n is the length of the input string (in this case "baaba", so n=5).

fantastic

Awesome explanation.. Thank you

I know this video is old, but I have a question: If the string is longer than 5, what happens? or do we have to have a string of that length to use the algorithm?

Best. My paid online tutor cannot explain this good.Awesome explanation.

Thank you, sir!

very good tutorial! thank you

awesome , thank u

Thanks a lot, you saved my homework.

Great explanation

Very good, thanks

Thank you

thank you!

thank you very much sir.

So in the end we showed that w=baaba can be made starting from S or A or C?

Thanks !!!

Thanks man

Very well explanned i completly get it now, ill get better result on the exam because of this haha

Very nice.

starting fromt he second row, you did not explain where you get those combinations.

absolute legend

How many substrings of baaba are members of the given grammar ?

awesome explanation..thanks

thank you broski

good work

awesome

Thanks Mate

Also note that the algorithm works on grammars in Chomsky normal form