245 search results - page 14 / 49 » Using Finite State Automata for Sequence Mining |
FGR
2000
IEEE
14 years 8 days ago
2000
IEEE
This paper proposes a state based approach to gesture learning and recognition. Using spatial clustering and temporal alignment, each gesture is defined to be an ordered sequence ...
FCT
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We investigate bottom-up and top-down deterministic automata on unranked trees. We show that for an appropriate definition of bottom-up deterministic automata it is poss...
WIA
2009
Springer
14 years 2 months ago
2009
Springer
We continue our work [H. Gruber, M. Holzer: Provably shorter regular expressions from deterministic finite automata (extended ). In Proc. DLT, LNCS 5257, 2008] on the problem of ...
WIA
2001
Springer
14 years 8 days ago
2001
Springer
This article describes a finite-state cascade for the extraction of person names in texts in French. We extract these proper names in order to categorize and to cluster texts with...
ACL
1998
13 years 9 months ago
1998
In wide-coverage lexicalized grammars many of the elementary structures have substructures in common. This means that in conventional parsing algorithms some of the computation as...