1220 search results - page 7 / 244 » Restricting grammatical complexity |
NIPS
2001
13 years 8 months ago
2001
Unsupervised learning algorithms have been derived for several statistical models of English grammar, but their computational complexity makes applying them to large data sets int...
PAAMS
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Regular expressions, or simply regex, have been widely used as a powerful pattern matching and text extractor tool through decades. Although they provide a powerful and f...
COLING
1990
13 years 8 months ago
1990
In this paper I describe how a significant class of cases that would involve (possibly complex) structural transfer in nmchine translation can be handled avoiding transfer. This i...
ICNC
2009
Springer
14 years 2 months ago
2009
Springer
The main purpose of this paper is to propose an incorporating a grammatical evolution (GE) into the genetic algorithm (GA), called GEGA, and apply it to estimate the compressive s...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
In this paper we present a generative, high resolution face representation which extends the well-known active appearance model (AAM)[5, 6, 7] with two additional layers. (i) One ...