A Finite-State Super-Chunker

Blanc, Olivier;Constant, M.;Watrin, Patrick
(2008) International Conference on Implementation and Application of Automata

Files

No attached file found for this publication.

Details

Authors
Abstract
Language is full of multiword unit expressions that form basic semantic units. The identification of these structures limits the combinatorial complexity induced by lexical ambiguity. In this paper, we detail an experiment that largely integrates these notions in a finite-state procedure of segmentation into super-chunks, preliminary to a parser. We show that the chunker, developped for French, reaches 92.9% precision and 98.7% recall.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Blanc, O., Constant, M., & Watrin, P. (2008). A Finite-State Super-Chunker. Implementation and Application of Automata : Lecture Notes in Computer Science, p. 306-308. https://hdl.handle.net/2078.5/224007