814 search results - page 51 / 163 » Machine Translation by Case Generalization |
CATS
2007
15 years 4 months ago
2007
The busy beaver problem is to find the maximum number of 1’s that can be printed by an n-state Turing machine of a particular type. A critical step in the evaluation of this va...
120
click to vote
KDD
2005
ACM
16 years 3 months ago
2005
ACM
We propose a simple yet potentially very effective way of visualizing trained support vector machines. Nomograms are an established model visualization technique that can graphica...
95
Voted
ACMSE
1990
ACM
15 years 6 months ago
1990
ACM
Current research in natural language processing is characterized by the development of theories of grammar which strongly depend on the lexicon to drive parsing systems (e.g. Lexi...
112
Voted
COLING
2010
14 years 9 months ago
2010
Plagiarism, the unacknowledged reuse of text, does not end at language boundaries. Cross-language plagiarism occurs if a text is translated from a fragment written in a different ...
170
Voted
ICML
2000
IEEE
16 years 3 months ago
2000
IEEE
Algorithms for feature selection fall into two broad categories: wrappers that use the learning algorithm itself to evaluate the usefulness of features and filters that evaluate f...