Computer Science · Natural Language Processing
What is the space complexity of the Cocke–Younger–Kasami (CYK) algorithm for parsing table P, where n is the number of words in the sentence and m is the number of non-terminal symbols in the grammar?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1O(n3)
- 2O(nm2)
- 3O(n2m)✓
- 4O(n2m2)
Correct answer
O(n2m)
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Natural Language Processing MCQs →Want more practice questions on Natural Language Processing?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Natural Language Processing