Rule-based Natural Language Processing Algorithm: Difference between revisions
Jump to navigation
Jump to search
(Created page with "A Rule-based Natural Language Processing Algorithm is a natural language processing algorithm that is a rule-based algorithm. * <B>Context</U>:</B> ** It can be im...") |
m (Text replacement - "** It can be implemented into a " to "** It can be applied by a ") |
||
Line 1: | Line 1: | ||
A [[Rule-based Natural Language Processing Algorithm]] is a [[natural language processing algorithm]] that is a [[rule-based algorithm]]. | A [[Rule-based Natural Language Processing Algorithm]] is a [[natural language processing algorithm]] that is a [[rule-based algorithm]]. | ||
* <B>Context</U>:</B> | * <B>Context</U>:</B> | ||
** It can be | ** It can be applied by a [[Rule-based Natural Language Processing System]]. | ||
** It can range from being a [[First-Principles NLP Algorithm]] to being a [[Heuristic NLP Algorithm]] (such as a [[Lesk Algorithm]]). | ** It can range from being a [[First-Principles NLP Algorithm]] to being a [[Heuristic NLP Algorithm]] (such as a [[Lesk Algorithm]]). | ||
* <B>Example(s):</B> | * <B>Example(s):</B> |
Revision as of 19:42, 18 November 2015
A Rule-based Natural Language Processing Algorithm is a natural language processing algorithm that is a rule-based algorithm.
- Context:
- It can be applied by a Rule-based Natural Language Processing System.
- It can range from being a First-Principles NLP Algorithm to being a Heuristic NLP Algorithm (such as a Lesk Algorithm).
- Example(s):
- Counter-Example(s):
- See: Language Model, n-Gram Model.