12.2 Context-Free Grammars
12.2.1 Formal definition of Context-Free Grammar
12.3 Some Grammar Rules for English ...
These context-free grammar generating algorithms first read the whole given symbol-sequence and then start to make decisions:
Byte pair encoding and its optimizations.
[edit] Applications ...
Stochastic context-free grammar A joint statistical model for an arbitrarily-long sequence of variables which generalizes a Markov chain.
The use of context-free grammars for describing fragments of languages led to important advances in uniformity, both in specification and in implementation.
It has been evaluated on artificial context-free grammars with thousands of rules, on natural languages as diverse as English and Chinese, on coding regions in DNA sequences, and on protein data correlating sequence with function.
A formal language used to define context-free grammars where a formal grammer consists of a set of rules with a left and right side separated by the symbol '::='.
the Cocke-Younger-Kasami (CYK) algorithm which determines whether and how a given string can be generated by a given context-free grammar;
the use of transposition tables and refutation tables in computer chess;
the Viterbi algorithm; ...
Nondeterministic bottom-up parsing algorithm for context-free grammars. It picks one parse to return. Each node in a parse tree has two fields: CATEGORY and CHILDREN.
parse tree a tree structure describing the derivation of a sentence in a language according to the rules of a context-free grammar.
 See also: Knowledge, Inference, Demon, Natural language processing, Parsing
  
|
RSS
