9886 search results - page 1745 / 1978 » Learning Compressible Models |
169
click to vote
FASE
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Existing algorithms for regular inference (aka automata learning) allows to infer a finite state machine by observing the output that the machine produces in response to ...
179
click to vote
ACL
2008
15 years 6 months ago
2008
This paper provides evidence that the use of more unlabeled data in semi-supervised learning can improve the performance of Natural Language Processing (NLP) tasks, such as part-o...
148
click to vote
AAAI
2010
15 years 6 months ago
2010
Many problems require repeated inference on probabilistic graphical models, with different values for evidence variables or other changes. Examples of such problems include utilit...
141
click to vote
COLING
2008
15 years 6 months ago
2008
Bracketing Transduction Grammar (BTG) is a natural choice for effective integration of desired linguistic knowledge into statistical machine translation (SMT). In this paper, we p...
130
click to vote
LREC
2010
15 years 6 months ago
2010
This paper presents the Multiword Expression Toolkit (mwetoolkit), an environment for type and language-independent MWE identification from corpora. The mwetoolkit provides a targ...