Artificial Intelligence - Natural Language Processing

Avatto > > UGC NET COMPUTER SCIENCE > > PRACTICE QUESTIONS > > Artificial Intelligence > > Natural Language Processing

21. Calculate P(they play in a big garden) assuming a bi-gram language model.

Answer
Comment
Array

Option : B
Explanation :

You must be logged in to post a comment.

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).

Answer
Comment
Array

Option : B
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

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

Answer
Comment
Array

Option : A
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

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?

Answer
Comment
Array

Option : D
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

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.

Answer
Comment
Array

Option : D
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

Related Quiz.
Natural Language Processing

Forgot your password?

I agree with the Terms.