Coding With Fun
Home Docker Django Node.js Articles Python pip guide FAQ Policy

How is dependency parsing used in constituency parsing?


Asked by Jade Burton on Dec 15, 2021 FAQ



Dependency Parsing vs Constituency Parsing Constituency parsing can also be implemented using the Stanford parser. It essentially parses a given sentence as per the constituency parser and subsequently converts the constituency parse tree into a dependency tree.
Also,
Non-terminals in the tree are types of phrases, the terminals are the words in the sentence, and the edges are unlabeled. For a simple sentence "John sees Bill", a constituency parse would be: A dependency parse connects words according to their relationships.
Subsequently, Constituency parsing and dependency parsing are respectively based on Phrase Structure Grammar ( PSG) and Dependency Grammar ( DG ). Dependency parsing in particular is known to be useful in many NLP applications. PSG breaks a sentence into its constituents or phrases.
Thereof,
Dependency Parsing (DP) refers to examining the dependencies between the words of a sentence to analyze its grammatical structure. Based on this, a sentence is broken into several components. The mechanism is based on the concept that there is a direct link between every linguistic unit of a sentence. These links are termed dependencies.
Consequently,
A constituency parse tree always contains the words of the sentence as its terminal nodes. Usually, each word has a parent node containing its part-of-speech tag (noun, adjective, verb, etc…), although this may be omitted in other graphical representations.