The terminal symbols is one of  the two symbol classes in the CFG, it corresponds to words in the language, like “the” and “flight”


Terminal Symbols


The non-terminal symbols are the symbols that express abstractions over the terminsals. For example, $$NP$$, $$Det$$, and $$Nominal$$ are non-terminal symbols.


Non-terminal Symbols


Some Grammar Rules

Sentences and their annotated parse trees in a treebank can form grammars representations. Hence, context-free grammar rules can be extracted, such as expanding VPs (4500 differenct rules for the Penn Treebank project) or NPs.

 CFG rules extractions in Treebanks

A context-free grammar G is described by four
parameters: N, Σ, R, S .


N a set of non-terminal symbols (or variables)

Σ a set of terminal symbols (disjoint from N)

R a set of rules or productions, each of the form A → β ,
   where A is a non-terminal,

β is a string of symbols from the infinite set of strings (Σ∪N)

S a designated start symbol and a member of N

Formal Description of Context-Free Grammar

Standard lexicalized grammar is a type of grammar rule where each non-terminal node in a  lexicalized parse tree is associated with a lexical head (the headword) and a head tag, and the head tag is the part-of-speech tag of grammar. Below is an example of a parse tree for the sentence "Workers dumped sacks into a bin.".

Standard Lexicalized Grammar 

A context-free grammar consists of a set of rules or productions and a lexicon of words and symbols.  Each of those rules expresses the ways that symbols of the language can be grouped and ordered together.
For example, one rule for noun phrase, like "the flight", is that a noun phrase can be composed of a determiner and a nominal.
$$ NP --> Det \quad Nominal$$



University of Colorado at Boulder

Parsing, syntax analysis, or syntactic analysis is the process of analyzing a string of symbols, either in natural language, computer languages or data structures, conforming to the rules of a formal grammar.



Within computational linguistics the term is used to refer to the formal analysis by a computer of a sentence or other string of words into its constituents, resulting in a parse tree showing their syntactic relation to each other, which may also contain semantic and other information (p-values). Some parsing algorithms may generate a parse forest or list of parse trees for a syntactically ambiguous input.



Simply speaking, parsing in NLP is the process of determining the syntactic structure of a text by analyzing its constituent words based on an underlying grammar (of the language).

Parsing

An on-going but a helpful book resource about NLP
https://web.stanford.edu/~jurafsky/slp3/

Speech and Language Processing (3rd ed. draft) 

Research papers, articles and examples about parsing in NLP

NLP Parsing References

Context-Free Grammars


A parse tree is one way to represent the syntactic structure of a string according to some context-free grammar. In parsing trees, each sentence starts with the start symbol $$S$$.


Parse Tree

The syntactic structure can also be expressed by bracketed notation, which is more compact than the parse tree.
$$ [\mathit{S}[NP [Pro\,\textrm{I}]] [VP [V \,\textrm{perfer}] [NP [Det \,\textrm{a}] [Nom [N \,\textrm{morning}] [Nom [N \,\textrm{flight}]]]]]]$$



Bracketed Notation


Categorical grammar is an early lexicalized grammar model which consists of three major elements: a set of categories, a lexicon that associates words with categories, and a set of rules that govern how categories combine in context.

Categorical Grammar

Unfortunately, the basic categorial approach does not give us any more expressive power than we had with traditional CFG rules; it just moves information from the grammar to the lexicon. To move beyond these limitations CCG is a modern extension of categorical grammar and includes operations that operate over functions.

Combinatory Categorical Grammar (CCG)

Constituency Parsing focuses on constituency structures, those assigned by context-free grammars. In order to know which parse tree is the right one, we need to augment CKY with scores for each possible constituent. 

Constituency Parsing

Dependency Parsing is fundamentally based on the dependency grammars in terms of grammar formalisms. In these formalisms, phrasal constituents and phrase-structure rules do not play a direct role as Constituent Parsing. Instead, the syntactic structure of a sentence is describe solely in terms of the words in a sentence and an associated set of directed binary grammatical relations that hold among the words.

Dependency Parsing

Given a sequence of sentences, automatically determine the coherence relations between them.

Discourse Structure Parsing

The Penn Discourse TreeBank (PDTB) is a second commonly used dataset that embodies model of coherence relations.

Learn Before

Related

Learn After