6 search results - page 1 / 2 » Choosing Word Occurrences for the Smallest Grammar Problem |
LATA
2010
Springer
14 years 3 days ago
2010
Springer
The smallest grammar problem - namely, finding a smallest context-free grammar that generates exactly one sequence - is of practical and theoretical importance in fields such as ...
ACL
1997
13 years 6 months ago
1997
This paper presents a partial solution to a component of the problem of lexical choice: choosing the synonym most typical, or expected, in context. We apply a new statistical appr...
ACL
2007
13 years 6 months ago
2007
We examine the problem of choosing word order for a set of dependency trees so as to minimize total dependency length. We present an algorithm for computing the optimal layout of ...
CPM
1995
Springer
13 years 8 months ago
1995
Springer
We consider strings which are succinctly described. The description is in terms of straight-line programs in which the constants are symbols and the only operation is the concaten...
PKDD
2009
Springer
13 years 12 months ago
2009
Springer
A serious drawback of kernel methods, and Support Vector Machines (SVM) in particular, is the difficulty in choosing a suitable kernel function for a given dataset. One of the appr...