Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-15T12:06:39.654Z Has data issue: false hasContentIssue false
  • English
  • Français

On some applications of finite-state automata theory to natural language processing

Published online by Cambridge University Press:  01 March 1996

MEHRYAR MOHRI
MEHRYAR MOHRI
Affiliation:
AT&T Bell Laboratories, 600 Mountain Avenue, Murray Hill, NJ 07974, USA. E-mail: mohri@research.att.com
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We describe new applications of the theory of automata to natural language processing: the representation of very large scale dictionaries and the indexation of natural language texts. They are based on new algorithms that we introduce and describe in detail. In particular, we give pseudocodes for the determinisation of string to string transducers, the deterministic union of p-subsequential string to string transducers, and the indexation by automata. We report on several experiments illustrating the applications.

Information

Type
Research Article
Information
Natural Language Engineering , Volume 2 , Issue 1 , March 1996, pp. 61 - 80
Copyright
© 1996 Cambridge University Press

Footnotes

This work was done while the author was an associate professor of computer science and computational linguistics at the Institut Gaspard Monge-LADL in Paris, France.