Word-level Semantic Analysis Algorithm: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - "<U>See</U>" to "See") |
m (Text replacement - " an [[W" to " a [[W") |
||
| Line 2: | Line 2: | ||
* <B>Context</U>:</B> | * <B>Context</U>:</B> | ||
** It can be an [[Entity Mention Resolution Algorithm]]. | ** It can be an [[Entity Mention Resolution Algorithm]]. | ||
** It can be | ** It can be a [[Word-Sense Disambiguation Algorithm]]. | ||
** It can be an [[Named Entity Recognition Algorithm]]. | ** It can be an [[Named Entity Recognition Algorithm]]. | ||
* <B>See:</B> [[Entity Mention Resolution]]. | * <B>See:</B> [[Entity Mention Resolution]]. | ||
Revision as of 14:42, 15 April 2016
A Word-level Semantic Analysis Algorithm is a Semantic Analysis Algorithm that can solve a Word-level Semantic Analysis Task.
- Context:
- It can be an Entity Mention Resolution Algorithm.
- It can be a Word-Sense Disambiguation Algorithm.
- It can be an Named Entity Recognition Algorithm.
- See: Entity Mention Resolution.