Find NPTEL Natural Language Processing Week 6 answers 2025 at nptel.answergpt.in. Our expert-verified solutions simplify complex topics, enhance your understanding of key concepts, and improve your assignment accuracy with confidence.
✅ Subject: Natural Language Processing
📅 Week: 6
🎯 Session: NPTEL 2025
🔗 Course Link: Click Here
🔍 Reliability: Verified and expert-reviewed answers
Use these answers as a reference to cross-check your solutions. For complete, step-by-step solutions across all weeks, explore [Week 1-12] NPTEL Natural Language Processing Assignment Answers 2025
🚀 Stay ahead in your NPTEL journey with fresh, updated solutions every week!
| Week-by-Week NPTEL Natural Language Processing Assignments Answers in One Place |
|---|
| Natural Language Processing Week 1 Answers |
| Natural Language Processing Week 2 Answers |
| Natural Language Processing Week 3 Answers |
| Natural Language Processing Week 4 Answers |
| Natural Language Processing Week 5 Answers |
| Natural Language Processing Week 6 Answers |
| Natural Language Processing Week 7 Answers |
| Natural Language Processing Week 8 Answers |
| Natural Language Processing Week 9 Answers |
| Natural Language Processing Week 10 Answers |
| Natural Language Processing Week 11 Answers |
| Natural Language Processing Week 12 Answers |
NPTEL Natural Language Processing Week 6 Assignment Answers 2025
1. 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?
- H determines the syntactic category of C
- The form of H depends on D.
- H selects D and determines whether D is obligatory.
- The linear position of D is specified with reference to H
Answer :- For Answers Click Here
2. Which of the following is False about formal conditions of dependency graph?
- Syntactic structure is hierarchical
- Some word can have more than one syntactic head
- There should not be any crossing of dependencies
- Syntactic structure is complete
Answer :-
3. Which of the following condition is false about directed spanning tree?
A directed spanning tree of a (multi-) digraph G = (V, A) is a subgraph G’ = (V’, A’) such
that:
- V’ = V
- A’ is subset of A
- |A’|= |V’|-1
- G’ is cyclic
Answer :- For Answers Click Here
Introduction to Database Systems Week 6 NPTEL Assignment Answers
4.
Answer :-
5. Suppose you write down the sequence of actions that generate the parse tree of the
sentence “I prefer NLP 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.
- [3, 0, 2, 1]
- [1, 2, 1, 3]
- [1, 2, 0, 3]
- [1, 2, 0, 2]
Answer :-
6. Correct sequence of actions that generates the parse tree of the sentence “I prefer NLP
course” using Arc-Eager Parsing is:
Note: Right Arc (RA), Left Arc(LA), Reduce(RE), Shift(SH)
- SH->LA->SH->SH->LA->RA
- SH->LA->SH->RE->LA->RA
- SH->LA->SH->SH->RA->LA
- SH->LA->RE->SH->SH->LA
Answer :-
7.
Answer :-
8.
Answer :- For Answers Click Here
Natural Language Processing Week 6 NPTEL Assignment Answers 2024
1. Which of the following is/are False about the criteria of head (H) and dependants (D) in a construction (C) in a dependency graph?
- His obligatory; D is mandatory
- H selects D and determines whether D is obligatory
- The form of D depends on H
- H specifies D
Answer :- a, d
2. Which of the following is/are True about formal conditions on Dependency graph G?
- G can be cyclic
- G is projective
- G is disconnected
- G obeys the rule: if i-j then not k-j, for any k not equal to i
Answer :- b, d
3. Which of the following is false?
- Deterministic parsing requires an oracle and an oracle can be approximated by a
classifier - Each vertex in the graph greedily selects the incoming edge with the highest weight in the Chu-Liu-Edmonds Algorithm
- During the iteration of Chu-Liu-Edmonds Algorithm it never produces cycle
- A multi-digraph is a digraph where multiple arcs between vertices are possible
Answer :- c
4.
Answer :- d
5.
Answer :- b
6.
Answer :- a
7.
Answer :- b
8.
Answer :- d
Conclusion:
In this article, we have uploaded the Natural Language Processing Week 6 NPTEL Assignment Answers. These expert-verified solutions are designed to help you understand key concepts, simplify complex topics, and enhance your assignment performance. Stay tuned for weekly updates and visit www.answergpt.in for the most accurate and detailed solutions.
