방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 교차 문서 개체 추적× | 공동참조 해결× | |
|---|---|---|
| 분야 | 텍스트 마이닝 | 텍스트 마이닝 |
| 계열 | Process / pipeline | Process / pipeline |
| 기원 연도≠ | 1998 (scoring foundations); 2019 (neural joint model) | 1978 |
| 창시자≠ | — | Hobbs (1978); Lee et al. (2017, neural end-to-end) |
| 유형≠ | NLP pipeline — cross-document coreference resolution | NLP information-extraction task |
| 원전≠ | Bagga, A. & Baldwin, B. (1998). Algorithms for Scoring Coreference Chains. In Proceedings of the LREC 1998 Linguistic Coreference Workshop, pp. 563–566. link ↗ | Lee, K. et al. (2017). End-to-end Neural Coreference Resolution. EMNLP. link ↗ |
| 별칭 | cross-document coreference resolution, cross-doc entity linking, Belge Ötesi Varlık Takibi | coreference, anaphora resolution, Eşgönderim Çözümleme (Coreference Resolution) |
| 관련 | 4 | 4 |
| 요약≠ | Cross-document entity tracking, formally known as cross-document coreference resolution, identifies and merges all references to the same real-world entity scattered across a collection of documents. Rooted in the B3 evaluation framework introduced by Bagga and Baldwin (1998) and substantially advanced by the neural joint model of Barhom et al. (2019), the method builds entity clusters that span document boundaries — enabling multi-document understanding, knowledge-base population, and corpus-wide entity analysis. | Coreference resolution is a natural-language-processing task that detects when different expressions in a text refer to the same entity — for example a name, a later pronoun, and a descriptive phrase all pointing at one person. Rooted in early linguistic work by Hobbs (1978) and advanced by the end-to-end neural model of Lee et al. (2017), it improves the quality of information extraction and text understanding. |
| ScholarGate데이터셋 ↗ |
|
|