Skip to main content

Finite-State Transducer Cascade to Extract Proper Names in Texts

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2494))

Abstract

This article describes a finite-state cascade for the extraction of person names in texts in French. We extract these proper names in order to categorize and to cluster texts with them. After a finite-state pre-processing (division of the text in sentences, tagging with dictionaries, etc.), a series of finite-state transducers is applied one after the other to the text and locates left and right contexts that indicates the presence of a person name. An evaluation of the results of this extraction is presented.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abney, S. (1996). Partial parsing via finite-state cascades, In Workshop on Robust Parsing, 8th European Summer School in Logic, Language and Information, Prague, Czech Republic, pp. 8–15.

    Google Scholar 

  2. Ait-Mokhtar, S., Chanod, J. (1997) Incremental finite state parsing, in ANLP’97.

    Google Scholar 

  3. Coates-Stephens, S. (1993). The Analysis and Acquisition of Proper Names for the Understanding of Free Text, in Computers and the Humanities, 26(5–6), pp. 441–456.

    Google Scholar 

  4. Courtois, B., Silberztein, M. (1990). Dictionnaire électronique des mots simples du français, Paris, Larousse.

    Google Scholar 

  5. Dejong, G. (1982). An Overview of the frump System, in W.B. Lehnert et M. H. Ringle éd., Strategies for Natural Language Processing, ErlBaum, pp. 149–176.

    Google Scholar 

  6. Fairon, C. (2000). Structures non-connexes. Grammaire des incises en français: description linguistique et outils informatiques, Thése de doctorat en informatique, Université Paris 7.

    Google Scholar 

  7. Friburger, N., Dister, A., Maurel, D. (2000). Améliorer le découpage des phrases sous INTEX, in Actes des journées Intex 2000, RISSH, Liéges, Belgique, to appear.

    Google Scholar 

  8. Gala-Pavia, N. (1999). Using the Incremental Finite-State Architecture to create a Spanish Shallow Parser, in Proceedings of XV Congres of SEPLN, Lleida, Spain.

    Google Scholar 

  9. Hobbs, J. R., Appelt, D. E., Bear, J., Israel, D., Kameyama, M., Stickel, M., Tyson, M. (1996). FASTUS: A cascaded finite-state transducer for extracting information from natural-language text, in Finite-State Devices for Natural Language Processing. MIT Press, Cambridge, MA.

    Google Scholar 

  10. Kim, J.S., Evens, M.W. (1996). Efficient Coreference Resolution for Proper Names in the Wall Street Journal Text, in online proceedings of MAICS’96, Bloomington.

    Google Scholar 

  11. Kokkinakis, D. and Johansson-Kokkinakis, S. (1999). A Cascaded Finite-State Parser for Syntactic Analysis of Swedish. In Proceedings of the 9th EACL. Bergen, Norway.

    Google Scholar 

  12. Piton, O., Maurel, D. (1997). Le traitement informatique de la géographie politique internationale, in Colloque Franche-Comté Traitement automatique des langues (FRACTAL 97), Besançon, 10–12 décembre, Bulag, numéro spécial, pp. 321–328.

    Google Scholar 

  13. Roche, E., Schabes, Y. (1997). Finite-State Language Processing, Cambridge, Massachussets, MIT Press.

    Google Scholar 

  14. Silberztein, M. (1998). “INTEX: a Finite-State Transducer toolbox”, in Proceedings of the 2nd International Workshop on Implementing Automata (WIA’97), Springer Verlag.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Friburger, N., Maurel, 1. (2002). Finite-State Transducer Cascade to Extract Proper Names in Texts. In: Watson, B.W., Wood, D. (eds) Implementation and Application of Automata. CIAA 2001. Lecture Notes in Computer Science, vol 2494. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36390-4_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-36390-4_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00400-4

  • Online ISBN: 978-3-540-36390-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics