109 search results - page 1 / 22 » Are Very Large N-Best Lists Useful for SMT |
NAACL
2007
13 years 6 months ago
2007
This paper describes an efficient method to extract large n-best lists from a word graph produced by a statistical machine translation system. The extraction is based on the k sh...
NFM
2011
12 years 11 months ago
2011
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...
ECAI
2000
Springer
13 years 9 months ago
2000
Springer
This paper explores the possibility to exploit text on the world wide web in order to enrich the concepts in existing ontologies. First, a method to retrieve documents from the WWW...
ISPASS
2005
IEEE
13 years 10 months ago
2005
IEEE
Today’s general-purpose processors are increasingly using multithreading in order to better leverage the additional on-chip real estate available with each technology generation...
EDBT
2009
ACM
13 years 9 months ago
2009
ACM
We consider a near future scenario in which users of a Web 2.0 application, such as a social network, contribute to the application not only data, but also rules which automatical...