1242 search results - page 44 / 249 » The Theory of Grammar Constraints |
121
click to vote
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
This study examines the utility of meta-grammar constant generation on a series of benchmark problems. The performance of the meta-grammar approach is compared to a grammar which ...
137
click to vote
LICS
1991
IEEE
15 years 5 months ago
1991
IEEE
Baeten, Bergstra, and Klop (and later Caucal) have proved the remarkable result that bisimulation equivalence is decidable for irredundant context-free grammars. In this paper we ...
116
click to vote
LREC
2010
15 years 3 months ago
2010
Recently, categorical grammar has been focused as a powerful grammar. This paper aims to develop a framework for automatic CG tagging for Thai. We investigated two main algorithms...
127
click to vote
ACL
2003
15 years 3 months ago
2003
An investment of effort over the last two years has begun to produce a wealth of data concerning computational psycholinguistic models of syntax acquisition. The data is generated...
110
click to vote
ALT
2006
Springer
15 years 5 months ago
2006
Springer
A number of natural models for learning in the limit is introduced to deal with the situation when a learner is required to provide a grammar covering the input even if only a par...