Skip to main content
SpringerLink
Log in

Bi-directional Automata to Extract Complex Phrases from Texts

  • Conference paper
  • First Online:
Automata Implementation (WIA 1998)

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

Included in the following conference series:

  • 285 Accesses

Abstract

This paper presents an experiment to develop natural-language tools to improve the quality of documents. These softwares are using finite-state automata enriched with notions of proximity, optionality and contextual information. They are called bi-directional because they need to parse a sequence not only from the left to right-hand side of a sentence, but on both sides of a word. This method improves efficiency.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abeillé A.: Les nouvelles syntaxes. Ed. A. Colin (Paris), (1993)

    Google Scholar 

  2. Abrial J.-R.: The B-book: assigning programs to meanings. Cambridge University Press (Cambridge) (1996)

    MATH  Google Scholar 

  3. Aho A., Sethi R., and Ullman J.: Compilers Principles, Techniques, and Tools. Ed. Addison-Wesley, (1986)

    Google Scholar 

  4. ANSSC (1967).: Code of good practices for the documentation of digital computer programs. American Nuclear Society Standards Committee, (1967)

    Google Scholar 

  5. Chomsky N. and Miller G.: Introduction to the formal analysis of natural languages. in Luce R.D., Bush R. & Galanter E., Handbook of Mathematical Psychology Wiley (New York), (1963) 269–322

    Google Scholar 

  6. Grefenstette G. and Tapanainen P.: What is a word, what is a sentence ? Problems of tokenization. COMPLEX (Budapest), (1994)

    Google Scholar 

  7. Gross M.: Méthodes en syntaxe. Ed. Hermann (Paris), (1975)

    Google Scholar 

  8. Gross M. and Perrin D. Electronic dictionaries and automata in computational linguistics. Lecture Notes in Computer Science 377, Springer Verlag (Berlin) (1989)

    Google Scholar 

  9. Huot H.: Sur la notion de racine. TAL, vol bf 35num 2, (1994) 46–76

    Google Scholar 

  10. Karttunen L., Chanod J.-P., Grefenstette G. and Schiller A.: Regular expressions for language engineering. Natural Language Engineering, vol. 2num 4, (1996) 305–328

    Article  Google Scholar 

  11. Kozlowska-Heuchin R.: L’analyse de la notion d’exigence dans un document technique en vue d’une extraction de connaissance automatisée. Bulag (actes de FRAC-TAL’97, Besançon), (1997) 227–234

    Google Scholar 

  12. Lippold B., Pomian J., Henry J.Y. and Elsensohn O.: AVIS: une méthode d’analyse de la cohérence des documents. Proceedings of the European Safety and Reliability conference (La Baule), (1994) 888–899

    Google Scholar 

  13. Lippold B. and Pomian J.: AVIS: une méthode d’analyse de la cohérence des documents techniques. Proceedings of the Fifteenth International Conference IA 95-Language Engineering 95 (Montpellier), (1995) 301–312

    Google Scholar 

  14. Lippold B., Kozlowska-Heuchin R. and Poibeau T.: NTK.FOCUS: un outil d’aide á la rédaction des documents techniques. JST-FRANCIL’97 (Avignon), (1997) 369–374

    Google Scholar 

  15. Maurel D.: Reconnaissance de séquences de mots par automates, adverbes de date du français. Thése de doctorat en informatique, Université de Paris 7 (1989)

    Google Scholar 

  16. Poibeau T. and Maurel D.: A la fin de: preposition ou determinant complexe dans les adverbiaux de temps ? Cahiers de grammaire, num 20, (1995) 101–111

    Google Scholar 

  17. Pomian J.: Mémoire d’entreprise. Sapientia (Ivry), (1996).

    Google Scholar 

  18. Revuz D.: Dictionnaires et lexiques Méthodes et algorithmes. Thése de doctorat en informatique, Université de Paris 7, (1991)

    Google Scholar 

  19. Roche E. and Schabes Y.: Finite State Language Processing. MIT Press (Cambridge), (1997)

    Google Scholar 

  20. Silberztein M.: Dictionnaires électroniques et analyse automatique des textes. Ed. Masson (Paris), (1993)

    Google Scholar 

  21. Vogel C.: Génie cognitif. Ed. Masson (Paris), (1988)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. THOMSON-CSF/LCR Domaine de Corbeville, 91404, Orsay Cedex, France

    Thierry Poibeau

Authors
  1. Thierry Poibeau
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Laboratory, University of Rouen, F-76821, Mont-Saint-Aignan Cedex, France

    Jean-Marc Champarnaud  & Djelloul Ziadi  & 

  2. LI/E3i University of Tours, 64 avenue Jean Portalis, F-37200, Tours, France

    Denis Maurel

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Poibeau, T. (1999). Bi-directional Automata to Extract Complex Phrases from Texts. In: Champarnaud, JM., Ziadi, D., Maurel, D. (eds) Automata Implementation. WIA 1998. Lecture Notes in Computer Science, vol 1660. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48057-9_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-48057-9_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66652-3

  • Online ISBN: 978-3-540-48057-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation