Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/54802
Type: Artigo de periódico
Title: APPLICATIONS OF FINITE AUTOMATA REPRESENTING LARGE VOCABULARIES
Author: LUCCHESI, CL
KOWALTOWSKI, T
Abstract: The construction of minimal acyclic deterministic partial finite automata to represent large natural language vocabularies is described. Applications of such automata include spelling checkers and advisers, multilanguage dictionaries, thesauri, minimal perfect hashing and text compression.
Subject: FINITE ACYCLIC AUTOMATA
VOCABULARIES
DICTIONARIES
SPELLING CHECKERS
THESAURI
MINIMAL PERFECT HASHING
TEXT COMPRESSION
Country: Inglaterra
Editor: John Wiley & Sons Ltd
Rights: fechado
Identifier DOI: 10.1002/spe.4380230103
Date Issue: 1993
Appears in Collections:Artigos e Materiais de Revistas Científicas - Unicamp

Files in This Item:
File Description SizeFormat 
WOSA1993KH08100002.pdf912.83 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.