Electronic dictionaries and automata in computational linguistics : LITP Spring School on Theoretical Computer Science, Saint-Pierre d'Oléron, France, May 25-29, 1987 : proceedings
Author(s)
Bibliographic Information
Electronic dictionaries and automata in computational linguistics : LITP Spring School on Theoretical Computer Science, Saint-Pierre d'Oléron, France, May 25-29, 1987 : proceedings
（Lecture notes in computer science, 377）
Springer-Verlag, c1989
- : gw
- : us
Available at / 54 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
L/N||LNCS||37789034187
-
Research Institute for Economics & Business Administration (RIEB) Library , Kobe University図書
: gw621.34-446-377s081000081169*
-
University of Tsukuba Library, Library on Library and Information Science
: gw007.08:L-49:377891017080
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references
Description and Table of Contents
Description
This volume contains the proceedings of the 15th Spring School of the LITP (Laboratoire d'Informatique Theorique et de Programmation, Universite Paris VI-VII, CNRS) held from May 25 to 29, 1987 in Saint-Pierre d'Oleron. 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 Schutzenberger 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.
Table of Contents
Data compression with substitution.- Some pronominalization issues in generation of texts in romance languages.- The use of finite automata in the lexical representation of natural language.- Estimation of the entropy by the lempel-ziv method.- Applications of phonetic description.- Sequence comparison: Some theory and some practice.- The lexical analysis of French.
by "Nielsen BookData"