Pattern-based Semantic Relation Mention Recognition Algorithm: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
m (Text replacement - "]]↵↵----↵" to "]]. ---- ") |
||
| (18 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
A [[Pattern-based Semantic Relation Mention Recognition Algorithm]] is a [[Semantic Relation Mention Recognition Algorithm]] that uses [[Pattern]]s to [[Recognize]] [[Semantic Relation Mention]]s in a [[Sentence]]. | A [[Pattern-based Semantic Relation Mention Recognition Algorithm]] is a [[Semantic Relation Mention Recognition Algorithm]] that uses [[Pattern]]s to [[Recognize]] [[Semantic Relation Mention]]s in a [[Sentence]]. | ||
* <B | * <B>Context</U>:</B> | ||
** It can use an [[NL Pattern]]. | ** It can use an [[NL Pattern]]. | ||
** It can be a [[Simple Semantic Relation Recognition Algorithm]], but unlikely a [[Complex Semantic Relation Recognition Algorithm]]. | ** It can be a [[Simple Semantic Relation Recognition Algorithm]], but unlikely a [[Complex Semantic Relation Recognition Algorithm]]. | ||
* <B | * <B>See</U>:</B> [[Information Extraction Algorithm]]. | ||
---- | ---- | ||
---- | ---- | ||
===2004=== | == References == | ||
* ([[2004_InfExtrForQASyntacticPatterns|Jijkoun | |||
=== 2004 === | |||
* ([[2004_InfExtrForQASyntacticPatterns|Jijkoun et al., 2004]]) ⇒ [[Valentin Jijkoun]], Jori Mur, and [[Maarten de Rijke]]\n. ([[2004]]). “[http://acl.ldc.upenn.edu/C/C04/C04-1188.pdf Information extraction for question answering: Improving recall through syntactic patterns].” In: Proceedings of COLING-2004. | |||
===2002=== | === 2002 === | ||
* ([[2002_LearningSurfaceTextPatternsForAQASystem|Ravichandran and Hovy, 2002]]) | * ([[2002_LearningSurfaceTextPatternsForAQASystem|Ravichandran and Hovy, 2002]]) ⇒ Deepak Ravichandran, and [[Eduard Hovy]]. ([[2002]]). “[http://dx.doi.org/10.3115/1073083.1073092 Learning surface text patterns for a Question Answering system.]/ In: Proceedings of the 40th Annual Meeting on Association for Computational Linguistics, July 07-12, 2002, Philadelphia, Pennsylvania. | ||
===2000=== | === 2000 === | ||
* [[Snowball Algorithm]] | * [[Snowball Algorithm]]. | ||
---- | ---- | ||
Latest revision as of 03:51, 8 May 2024
A Pattern-based Semantic Relation Mention Recognition Algorithm is a Semantic Relation Mention Recognition Algorithm that uses Patterns to Recognize Semantic Relation Mentions in a Sentence.
- Context:
- It can use an NL Pattern.
- It can be a Simple Semantic Relation Recognition Algorithm, but unlikely a Complex Semantic Relation Recognition Algorithm.
- See: Information Extraction Algorithm.
References
2004
- (Jijkoun et al., 2004) ⇒ Valentin Jijkoun, Jori Mur, and Maarten de Rijke\n. (2004). “Information extraction for question answering: Improving recall through syntactic patterns.” In: Proceedings of COLING-2004.
2002
- (Ravichandran and Hovy, 2002) ⇒ Deepak Ravichandran, and Eduard Hovy. (2002). “Learning surface text patterns for a Question Answering system./ In: Proceedings of the 40th Annual Meeting on Association for Computational Linguistics, July 07-12, 2002, Philadelphia, Pennsylvania.