Text Chunking Algorithm

A Text Chunking Algorithm is a chunking algorithm that can solve a text chunking task.

• Context:
  • It can be applied by a Text Chunking System.
  • It can be supported by a Text Segmentation Algorithm.
  • It can be supported by a Text Segment Classification Algorithm.
  • It can support an Information Extraction Algorithm.
  • It can range from being a Heuristic Text Chunking Algorithm to being a Statistical Text Chunking Algorithm (such as a supervised text chunking algorithm).
• Example(s):
  • a Phrase Chunking Algorithm, if the Text Chunks are restricted to Syntactic Phrases (such as a Base Noun Phrases).
  • a Prosodic Chunking Algorithm, if the Text Chunks are restricted to Prosodic Chunks (see Abney, 1989)
  • a Word Mention Segmentation Algorithm.
  • …
• Counter-Example(s):
  • a Sentence Boundary Detection Algorithm.
  • a DNA Segmentation Algorithm.
  • a Syntactic Parsing Algorithm.
• See: CRFpp System.

---

---

References

2003

• (Sha & Pereira, 2003a) ⇒ Fei Sha, and Fernando Pereira. (2003). “Shallow Parsing with Conditional Random Fields.” In: Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology (HLT-NAACL 2003). doi:10.3115/1073445.1073473

2001

• (Kudo & Matsumoto, 2001) ⇒ Taku Kudo, and Yuji Matsumoto. (2001). “Chunking with Support Vector Machines.” In: Proceedings of NAACL Conference (NAACL 2001).

1989

• (Abney, 1989) ⇒ Steven P. Abney. (1989). “Parsing By Chunks." The MIT Parsing Volume, 1988-89. Center for Cognitive Science, MIT.

---