Skip to main content
SpringerLink
Log in

A Finite-State Super-Chunker

  • Conference paper
Implementation and Application of Automata (CIAA 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4783))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Blanc, O., Constant, M.: Outilex, a linguistic platform for text processing. In: Proc. of the COLING/ACL 2006 Interactive Presentation Sessions, pp. 73–76 (2006)

    Google Scholar 

  2. Abney, S.: Partial parsing via finite-state cascades. Natural Language Engineering 2, 337–344 (1996)

    Article  Google Scholar 

  3. Courtois, B.: Un système de dictionnaires électroniques pour les mots simples du français. Langue Française 87, 11–22 (1990)

    Article  Google Scholar 

  4. Gross, M.: The construction of local grammars. In: Roche, E., Schabes, Y. (eds.) Finite State Language Processing, pp. 329–352. The MIT Press, Cambridge, Mass. (1997)

    Google Scholar 

  5. Watrin, P.: Une approche hybride de l’extraction d’information: sous-langages et lexique-grammaire. PhD thesis, Thèse de Doctorat de l’Université Catholique de Louvain-la-Neuve (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université de Marne-la-Vallée, Institut Gaspard Monge, France

    Olivier Blanc, Matthieu Constant & Patrick Watrin

Authors
  1. Olivier Blanc
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Matthieu Constant
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Patrick Watrin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan Holub Jan Žďárek

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Blanc, O., Constant, M., Watrin, P. (2007). A Finite-State Super-Chunker. In: Holub, J., Žďárek, J. (eds) Implementation and Application of Automata. CIAA 2007. Lecture Notes in Computer Science, vol 4783. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76336-9_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-76336-9_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-76335-2

  • Online ISBN: 978-3-540-76336-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation