Linguistic Syntactic Parsing Task
(Redirected from Natural Language Syntax Parsing Task)
Jump to navigation
Jump to search
A linguistic syntactic parsing task is a syntactic parsing task that requires the creation of a linguistic syntactic structure that represents a linguistic expression.
- Context:
- Input:
- a Word String, typically a Linguistic Sentence.
- a Natural Language Syntax. (a Grammar)
- a Lexicon.
- output:
- Zero or more Parse Trees.
- optional: the Probability of the Parse Tree.
- It can range from being a Heuristic Linguistic Syntactic Parsing Task to being a Data-Driven Linguistic Syntactic Parsing Task, such as supervised linguistic syntactic parsing.
- It can be solved by a Linguistic Syntactic Parsing System (that implements a linguistic syntactic parsing algorithm)
- It can be supported by:
- a Natural Language Syntactic Acceptance Task (that classifies, true or false, whether the string is in the language).
- a Phrase Chunking Task, that identifies high-level linguistic phrases.
- ...
- Input:
- Example(s):
- NLSPT("Alexander went to the park.", English Syntax, English Lexicon) ⇒
(S (NP (NNP Alexander))(VP (VBD went)(PP (TO to) (NP (DT the) (NN park)))) (. .)))
Phrase-Structure Grammar. - Dependency Parsin.
- one based on Penn Treebank.
- …
- NLSPT("Alexander went to the park.", English Syntax, English Lexicon) ⇒
- Counter-Example(s):
- a NLSAT, such as [math]\displaystyle{ f }[/math]("saw I park in telescope with Alexander.”, English Syntax, English Lexicon) ⇒ False.
- a Morphological Parsing Task.
- a Linguistic Semantic Parsing Task, such as a shallow semantic parsing.
- a Computer Program Syntactic Parsing Task.
- See: Natural Language Parser, NLP Task.
References
2017
- https://spacy.io/usage/facts-figures#section-benchmarks
- QUOTE: Parse accuracy (Penn Treebank / Wall Street Journal)
This is the "classic" evaluation, so it's the number parsing researchers are most easily able to put in context. However, it's quite far removed from actual usage: it uses sentences with gold-standard segmentation and tokenization, from a pretty specific type of text (articles from a single newspaper, 1984-1989).
- QUOTE: Parse accuracy (Penn Treebank / Wall Street Journal)
2009
- http://www.cse.unsw.edu.au/~billw/nlpdict.html#parser
- A parser is an algorithm (or a program that implements that algorithm) that takes a grammar, a and a string of words, decides whether the string of words can be derived from the grammar and lexicon (i.e. is a sentence with respect to the grammar and lexicon.
If so, it produces as output some kind of representation of the way (or ways) in which the sentence can be derived from the grammar and lexicon. A common way of doing this is to output (a) parse tree(s).
- A parser is an algorithm (or a program that implements that algorithm) that takes a grammar, a and a string of words, decides whether the string of words can be derived from the grammar and lexicon (i.e. is a sentence with respect to the grammar and lexicon.