DocumentCode
3318065
Title
Basic search of sub automata application to electronic dictionaries
Author
Tounsi, Lamia ; Maurel, Denis ; Beatrice, B.
Author_Institution
Lab. d´´Informatique, Univ. Francois-Rabelais de Tours, France
fYear
2005
fDate
30 Oct.-1 Nov. 2005
Firstpage
543
Lastpage
548
Abstract
This paper we present a new method to detect and compute a set of sub structures of an automaton. This method is applied through a search algorithm for sub automata recognition and used in natural language processing (NLP) applications such as dictionaries. This algorithm is based on the notion of height and cardinality of states; it visits the states of a minimal deterministic finite state automaton in a depth first order where each state is inspected once.
Keywords
dictionaries; finite automata; natural languages; search problems; electronic dictionaries; minimal deterministic finite state automaton; natural language processing; search algorithm; sub automata recognition; Automata; Dictionaries; Natural language processing; Resists; Search methods; Software tools; Speech; Electronic dictionary; Finite-state automata; Natural Language Processing; Sub automata;
fLanguage
English
Publisher
ieee
Conference_Titel
Natural Language Processing and Knowledge Engineering, 2005. IEEE NLP-KE '05. Proceedings of 2005 IEEE International Conference on
Print_ISBN
0-7803-9361-9
Type
conf
DOI
10.1109/NLPKE.2005.1598797
Filename
1598797
Link To Document