21. Calculate P(they play in a big garden) assuming a bi-gram language model.
None of the above
You must be logged in to post a comment.
22. Assume that you are using a bi-gram language model with add one smoothing. Calculate P(they play in a beautiful garden).
4.472 x 10-6
2.236 x 10-6
3.135 x 10-6
23. Which of the following are true?
1. Given a CFG and its corresponding CNF, they both produce the same language.
2. For a given grammar, there can be more than one CNF
3. It requires '2n+1' productions or steps in CNF to generate a string w of length 'n'
4. None of the above
1 and 2
2 and 3
3 and 4
1 and 4
24. Consider the CFG given below:
S -> ASA | aB
A -> B | s
B -> b | ε
How many non-terminals need to be added to convert the above grammar into CNF?
25. Which of the following are true with respect to a Top-Down and Bottom-Up Parser?
1. A Top-Down Parser never explores options that will not lead to a full parse.
2. A Bottom-Up Parser never explores options that will not lead to a full parse.
3. A Top-Down Parser never explores options that do not connect to the actual sentence.
4. A Bottom-Up Parser never explores options that do not connect to the actual sentence.
UGC NET PAPER 1
UGC NET Management
UGC NET COMPUTER SCIENCE
UGC NET COMMERCE
GATE COMPUTER SCIENCE
CFA Level 1
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login