Parsing Algorithm
A Parsing Algorithm is an Information Processing Algorithm that can be implemented by Parsing System to solve a Parsing Task.
- AKA: Parser, Syntax Analysis Algorithm, Syntactic Analysis Algorithm.
- Context:
- It can range from being a Shallow Parsing Algorithm to being a Deep Parsing Algorithm.
- It can range from being a Syntactic Parsing Algorithm to being a Semantic Parsing Algorithm.
- It can range from being a Top-Down Parsing Algorithm to being a Bottom-Up Parsing Algorithm.
- It can range from being a Table-Driven Parsing Algorithm to being an Adaptive Parsing Algorithm.
- Example(s):
- a Bottom-Up Parsing Algorithm such as:
- a Data Structures Parsing Algorithm,
- a Discourse Parsing Algorithm,
- a Formal Language Parsing Algorithm such as:
- an Image Parsing Algorithm,
- a Linguistic Syntactic Parsing Algorithm,
- a Lookahead Parsing Algorithm,
- a Morphological Parsing Algorithm,
- a Natural Language Parsing Algorithm,
- a Speech Parsing Algorithm,
- a Text Parsing Algorithm,
- a Top-Down Parsing Algorithm as:
- …
- Counter-Example(s):
- an Automatic Summarization Algorithm,
- a Coreference Resolution Algorithm,
- a Chunking Algorithm,
- a Grammar Induction Algorithm,
- a Lemmatization Algorithm,
- a Linguistic Structural Disambiguation Algorithm,
- a Machine Translation Algorithm,
- a Morphological Segmentation Algorithm,
- a Named Entity Recognition (NER) Algorithm,
- a Part-Of-Speech (POS) Tagging Algorithm,
- a Question Answering Algorithm,
- a Relationship Extraction Algorithm,
- a Sentiment Analysis Algorithm,
- a Stemming Algorithm,
- a Text Segmentation Algorithm,
- a Textual Entailment Recognition Algorithm,
- a Terminology Extraction Algorithm.
- See: Natural Language Processing Algorithm, Natural Language Generation Algorithm, Natural Language Understanding Algorithm, Text Processing Algorithm, Text Error Correction Algorithm, Reverse Engineering Algorithm, Reading Algorithm, Optical Character Recognition (OCR) Algorithm, Topic Segmentation and Recognition Algorithm, Word Sense Disambiguation Algorithm, Accepter, Syntactic Acceptance Task, DNA Analysis.
References
2019
- (Wikipedia, 2019) ⇒ https://en.wikipedia.org/wiki/Parsing Retrieved:2019-7-7.
- Parsing, syntax analysis, or syntactic analysis is the process of analysing a string of symbols, either in natural language, computer languages or data structures, conforming to the rules of a formal grammar. The term parsing comes from Latin pars (orationis), meaning part (of speech).[1]
The term has slightly different meanings in different branches of linguistics and computer science. Traditional sentence parsing is often performed as a method of understanding the exact meaning of a sentence or word, sometimes with the aid of devices such as sentence diagrams. It usually emphasizes the importance of grammatical divisions such as subject and predicate.
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.
The term is also used in psycholinguistics when describing language comprehension. In this context, parsing refers to the way that human beings analyze a sentence or phrase (in spoken language or text) "in terms of grammatical constituents, identifying the parts of speech, syntactic relations, etc." This term is especially common when discussing what linguistic cues help speakers to interpret garden-path sentences.
Within computer science, the term is used in the analysis of computer languages, referring to the syntactic analysis of the input code into its component parts in order to facilitate the writing of compilers and interpreters. The term may also be used to describe a split or separation.
- Parsing, syntax analysis, or syntactic analysis is the process of analysing a string of symbols, either in natural language, computer languages or data structures, conforming to the rules of a formal grammar. The term parsing comes from Latin pars (orationis), meaning part (of speech).[1]
2017
- (WikiBooks, 2017) ⇒ https://en.wikibooks.org/wiki/Compiler_Construction/Syntax_Analysis
- QUOTE: This is alternatively known as parsing. It is roughly the equivalent of checking that some ordinary text written in a natural language (e.g. English) is grammatically correct (without worrying about meaning).
The purpose of syntax analysis or parsing is to check that we have a valid sequence of tokens. Tokens are valid sequence of symbols, keywords, identifiers etc. Note that this sequence need not be meaningful; as far as syntax goes, a phrase such as "true + 3" is valid but it doesn't make any sense in most programming languages.
The parser takes the tokens produced during the lexical analysis stage, and attempts to build some kind of in-memory structure to represent that input. Frequently, that structure is an 'abstract syntax tree' (AST).
The parser needs to be able to handle the infinite number of possible valid programs that may be presented to it. The usual way to define the language is to specify a grammar. A grammar is a set of rules (or productions) that specifies the syntax of the language (i.e. what is a valid sentence in the language).
- QUOTE: This is alternatively known as parsing. It is roughly the equivalent of checking that some ordinary text written in a natural language (e.g. English) is grammatically correct (without worrying about meaning).
2009
- (foldoc, 2009) ⇒ http://foldoc.org/index.cgi?grammar
- QUOTE: Parsing assigns a terminal syntactic category to each input token and a non-terminal category to each appropriate group of tokens, up to the level of the whole sentence. Parsing is usually preceded by lexical analysis.
- ----