Skip to main content
SpringerLink
Log in
Book cover

Electronic Dictionaries and Automata in Computational Linguistics

LITP Spring School in Theoretical Computer Science, Saint- Pierre d'Oleron, France, May 25-29, 1987. Proceedings

  • Conference proceedings
  • © 1989

Overview

Editors:
  1. Maurice Gross
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Dominique Perrin
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

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

Access this book

Log in via an institution
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

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (7 papers)

  1. Front Matter

    Download chapter PDF

  2. Data compression with substitution

    • Maxime Crochemore
    Pages 1-16

  3. Some pronominalization issues in generation of texts in romance languages

    • Laurence Danlos
    Pages 17-33

  4. The use of finite automata in the lexical representation of natural language

    • Maurice Gross
    Pages 34-50

  5. Estimation of the entropy by the lempel-ziv method

    • G. Hansel
    Pages 51-65

  6. Applications of phonetic description

    • Eric Laporte
    Pages 66-78

  7. Sequence comparison: Some theory and some practice

    • Imre Simon
    Pages 79-92

  8. The lexical analysis of French

    • Max Silberztein
    Pages 93-110
Back to top

Keywords

About this book

This volume contains the proceedings of the 15th Spring School of the LITP (Laboratoire d'Informatique Théorique et de Programmation, Université Paris VI-VII, CNRS) held from May 25 to 29, 1987 in Saint-Pierre d'Oléron. The meeting was organized by M. Borillo, M. Gross, M. Nivat and D. Perrin. The purpose of this yearly meeting is to present the state of the art in a specific topic which has gained considerable maturity. The proceedings of the last three Spring Schools have already been published in this series and deal with "Automata on Infinite Words" (LNCS 192), "Combinators and Functional Programming Languages " (LNCS 242) and "Automata Networks" (LNCS 316). The contributions gathered for the 1987 conference present a unique combination of automata theory on the one hand and natural language processing on the other hand. Both fields have strong historical links as exemplified by the works of Chomsky and Harris in Linguistics, the work of Backus and others in Computer Science and the work of Schützenberger in Algebra. The methods described and discussed in the field of string processing and automata cover the traditional algorithms for string matching, data compression, sequence comparison and lexical analysis. The papers that deal more directly with natural language processing treat automated text generation, lexical analysis and formal representation.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation