Sciweavers

1053 search results - page 112 / 211
» Learning Rules to Improve a Machine Translation System
Sort
View
125
Voted
ACL
2010
15 years 1 months ago
Bitext Dependency Parsing with Bilingual Subtree Constraints
This paper proposes a dependency parsing method that uses bilingual constraints to improve the accuracy of parsing bilingual texts (bitexts). In our method, a targetside tree frag...
Wenliang Chen, Jun'ichi Kazama, Kentaro Torisawa
97
Voted
ANLP
2000
86views more  ANLP 2000»
15 years 5 months ago
A Finite State and Data-Oriented Method for Grapheme to Phoneme Conversion
A finite-state method, based on leftmost longestmatch replacement, is presented for segmenting words into graphemes, and for converting graphemes into phonemes. A small set of han...
Gosse Bouma
ICML
2004
IEEE
16 years 4 months ago
Boosting grammatical inference with confidence oracles
In this paper we focus on the adaptation of boosting to grammatical inference. We aim at improving the performances of state merging algorithms in the presence of noisy data by us...
Jean-Christophe Janodet, Richard Nock, Marc Sebban...
162
Voted
MIR
2010
ACM
207views Multimedia» more  MIR 2010»
15 years 2 months ago
Learning to rank for content-based image retrieval
In Content-based Image Retrieval (CBIR), accurately ranking the returned images is of paramount importance, since users consider mostly the topmost results. The typical ranking st...
Fabio F. Faria, Adriano Veloso, Humberto Mossri de...
142
Voted
ECML
1987
Springer
15 years 7 months ago
Induction in Noisy Domains
This paper examines the induction of classification rules from examples using real-world data. Real-world data is almost always characterized by two features, which are important ...
Peter Clark, Tim Niblett