Sciweavers

1220 search results - page 18 / 244
» Restricting grammatical complexity
Sort
View
COLING
1992
13 years 8 months ago
Processing Complex Noun Phrases In A Natural Language Interface To A Statistical Database
Analysisof a corpus of queries to a statistical database has shown considerable variation in the location and order of modifiers in complex noun phrases. Nevertheless, restriction...
Fred Popowich, Paul McFetridge, Dan Fass, Gary Hal...
CORR
2006
Springer
98views Education» more  CORR 2006»
13 years 7 months ago
Reversal Complexity Revisited
We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r(n), there are several furth...
André Hernich, Nicole Schweikardt
ECML
2007
Springer
14 years 1 months ago
Learning Balls of Strings with Correction Queries
When facing the question of learning languages in realistic settings, one has to tackle several problems that do not admit simple solutions. On the one hand, languages are usually...
Leonor Becerra-Bonache, Colin de la Higuera, Jean-...
GECCO
2009
Springer
128views Optimization» more  GECCO 2009»
14 years 5 days ago
Evolving stochastic processes using feature tests and genetic programming
The synthesis of stochastic processes using genetic programming is investigated. Stochastic process behaviours take the form of time series data, in which quantities of interest v...
Brian J. Ross, Janine H. Imada
AMFG
2007
IEEE
255views Biometrics» more  AMFG 2007»
13 years 11 months ago
A New Probabilistic Model for Recognizing Signs with Systematic Modulations
Abstract. This paper addresses an aspect of sign language (SL) recognition that has largely been overlooked in previous work and yet is integral to signed communication. It is the ...
Sylvie C. W. Ong, Surendra Ranganath