446 search results - page 13 / 90 » Learning discrete categorial grammars from structures |
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
In the classical binary genetic algorithm, although crossover within a building block (BB) does not always cause a decrease in fitness, any decrease in fitness results from the ...
EMNLP
2008
13 years 9 months ago
2008
Syntactic word reordering is essential for translations across different grammar structures between syntactically distant languagepairs. In this paper, we propose to embed local a...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The problem of learning forest-structured discrete graphical models from i.i.d. samples is considered. An algorithm based on pruning of the Chow-Liu tree through adaptive threshol...
ACL
2006
13 years 9 months ago
2006
This paper introduces a method for the semi-automatic generation of grammar test items by applying Natural Language Processing (NLP) techniques. Based on manually-designed pattern...
LATA
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. Learnability is a vital property of formal grammars: representation classes should be defined in such a way that they are learnable. One way to build learnable represent...