Natural Language Syntactic Parsing Algorithm: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - "]. * <B>Counter" to "]. ** ... * <B>Counter") |
m (Text replacement - "** ..." to "** …") |
||
| Line 6: | Line 6: | ||
*** a [[Deductive NL Parsing Algorithm]], such as an [[Earley Parser]]. | *** a [[Deductive NL Parsing Algorithm]], such as an [[Earley Parser]]. | ||
** It can be applied by a [[Natural Language Syntactic Parsing System]]. | ** It can be applied by a [[Natural Language Syntactic Parsing System]]. | ||
** | ** … | ||
* <B>Counter-Example(s):</B> | * <B>Counter-Example(s):</B> | ||
** a [[Part-of-Speech Tagging Algorithm]]. | ** a [[Part-of-Speech Tagging Algorithm]]. | ||
Revision as of 18:17, 13 March 2021
A Natural Language Syntactic Parsing Algorithm is a parsing algorithm that can solve a Natural Language Syntactic Parsing Task.
- AKA: NL Parsing Algorithm, Parsing Algorithm, Natural Language Parsing Algorithm, Natural Language Syntactic Parser.
- Context:
- It can be:
- a Statistical NL Parsing Algorithm, such as Charniak Parser.
- a Deductive NL Parsing Algorithm, such as an Earley Parser.
- It can be applied by a Natural Language Syntactic Parsing System.
- …
- It can be:
- Counter-Example(s):
- See: Michael Collins, Eugene Charniak.