Paper Info
Title
A Compression Method for Natural Language Automata
Abstract
This paper deals with Finite State Automata used in Natural Language Processing to represent very large dictionaries. We present a method for an important operation applied to these automata, the compression with quick access. Our proposal is to factorize subautomata other than those representing common prefixes or suffixes. Our algorithm uses a DAWG of subautomata to iteratively choose the best substructure to factorize. The linear time accepting complexity is kept in the resulting compact automaton. Experiments performed on ten automata are reported.
Year
DOI
Venue
2008
10.3233/978-1-58603-975-2-146
FSMNLP
Keywords
Field
DocType
large dictionary,best substructure,important operation,common prefix,quick access,paper deal,compact automaton,compression method,linear time,natural language automata,natural language processing,finite state automata,compression,automaton,greedy algorithm,natural language
Quantum finite automata,Computer science,Theoretical computer science,Timed automaton,Artificial intelligence,Natural language processing,Time complexity,Mobile automaton,Automaton,Algorithm,Finite-state machine,Natural language,ω-automaton
Conference
Volume
ISSN
Citations 
191
0922-6389
2
PageRank 
References 
Authors
0.39
9
3
Name
Order
Citations
PageRank
Lamia Tounsi116710.46
beatrice bouchou29110.71
Denis Maurel38420.72