# NPTEL Natural Language Processing Week 6 Assignment Answers 2023

NPTEL Natural Language Processing Week 6 Assignment Solutions

## NPTEL Natural Language Processing Week 6 Assignment Answers 2023

1. Which of the following is/are true about the Chu-Liu-Edmonds Algorithm?

1. Each vertex in the graph greedily selects the incoming edge with the highest weight
2. During the iteration of algorithm it always produce minimum spanning tree
3. During the iteration of algorithm it never produces cycle
4. The running time of the Algorithm is O(E) where V be the set of nodes and E be the set
of directed edges
`Answer :- For Answer Click Here `

2. With respect to a Dependency Structure, which of the following is not a valid criterion for a syntactic relation between a head H and a dependent D in a construction C?

1. The form of D depends on H.
2. The form of H depends on D.
3. H selects D and determines whether D is obligatory.
4. H specifies D.
`Answer :- For Answer Click Here `

3. Consider the sentence: “Ramesh scored a brilliant century”. What is the type of the following relation?
century -> brilliant

1. Endocentric
2. Exocentric
3. Both endocentric and exocentric
4. None of the above
`Answer :- For Answer Click Here `

4. Which of the following is /are false about data driven deterministic parsing?

1. Deterministic parsing requires an oracle
2. An oracle can be approximated by a classifier
3. A classifier can be trained using treebank data
4. None of the above
`Answer :- For Answer Click Here `

5. Suppose you write down the sequence of actions that generate the parse tree of the sentence “I prefer ChatGPT course” using Arc-Eager Parsing. The number of times you have to use Right Arc, Left Arc, Reduce, Shift is: Format of the answer is [a, b, c, d] corresponding to the 4 values in the order specified in the query.

1. [3, 0, 2, 1]
2. [1,2, 1, 3]
3. [1, 2, 0, 3]
4. [1, 2, 0, 2]
`Answer :- For Answer Click Here `

6. Correct sequence of actions that generates the parse tree of the sentence “I prefer ChatGPT course” using Arc-Eager Parsing is:
Note: Right Arc (RA), Left Arc(LA), Reduce(RE), Shift(SH)

1. SH->LA-> SH->SH->LA->RA
2. SH->LA->SH->RE->LA->RA
3. SH->LA-> SH->SH->RA->LA
4. SH->LA->RE–>SH->SH->LA
`Answer :- For Answer Click Here `

7.

`Answer :- For Answer Click Here `

8. Which of the following is true about the formal conditions on dependency graph?

1. Graph G is connected and projective
2. G is connected but not acyclic
3. G acyclic and obeys the single head constant
4. Both 1 and 3
`Answer :- For Answer Click Here `

9.

`Answer :- For Answer Click Here `

10.

`Answer :- For Answer Click Here `