Sciweavers

1136 search results - page 5 / 228
» Learning with Weighted Transducers
Sort
View
NAACL
2010
13 years 5 months ago
Formatting Time-Aligned ASR Transcripts for Readability
We address the problem of formatting the output of an automatic speech recognition (ASR) system for readability, while preserving wordlevel timing information of the transcript. O...
Maria Shugrina
ICGI
2004
Springer
14 years 1 months ago
Learning Node Selecting Tree Transducer from Completely Annotated Examples
Abstract. A base problem in Web information extraction is to find appropriate queries for informative nodes in trees. We propose to learn queries for nodes in trees automatically ...
Julien Carme, Aurélien Lemay, Joachim Niehr...
ML
2007
ACM
130views Machine Learning» more  ML 2007»
13 years 7 months ago
Interactive learning of node selecting tree transducer
We develop new algorithms for learning monadic node selection queries in unranked trees from annotated examples, and apply them to visually interactive Web information extraction. ...
Julien Carme, Rémi Gilleron, Aurélie...
NAACL
2003
13 years 9 months ago
Simpler and More General Minimization for Weighted Finite-State Automata
Previous work on minimizing weighted finite-state automata (including transducers) is limited to particular types of weights. We present efficient new minimization algorithms th...
Jason Eisner