3270 search results - page 229 / 654 » Approximate String Processing |
152
click to vote
ICGI
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Left deteministic linear languages are a subclass of the context free languages that includes all the regular languages. Recently was proposed an algorithm to identify in...
164
click to vote
TSD
2004
Springer
15 years 12 months ago
2004
Springer
In this paper a speaker adaptation methodology is proposed, which first automatically determines a number of speaker clusters in the training material, then estimates the paramete...
158
click to vote
CICLING
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. This paper reports on the development of a finite state system for finding grammar errors without actually specifying the error. A corpus of Swedish text written by chi...
159
click to vote
EDBT
2010
ACM
15 years 10 months ago
2010
ACM
Suffix trees are indexing structures that enhance the performance of numerous string processing algorithms. In this paper, we propose cache-conscious suffix tree construction algo...
138
click to vote
LREC
2008
15 years 8 months ago
2008
The output of a speech recognition system is not always ideal for subsequent downstream processing, in part because speakers themselves often make mistakes. A system would accompl...