213 search results - page 23 / 43 » Relating Word and Tree Automata |
NAACL
2001
13 years 9 months ago
2001
We present a simple architecture for parsing transcribed speech in which an edited-word detector first removes such words from the sentence string, and then a standard statistical...
ACL
2012
11 years 10 months ago
2012
We propose a new approach to characterizing the timeline of a text: temporal dependency structures, where all the events of a narrative are linked via partial ordering relations l...
RECOMB
2002
Springer
14 years 7 months ago
2002
Springer
The problem of characterizing and detecting recurrent sequence patterns such as substrings or motifs and related associations or rules is variously pursued in order to compress da...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
25
Voted
RSCTC
2000
Springer
13 years 11 months ago
2000
Springer
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...