612 search results - page 80 / 123 » A Computational Grammar for Georgian |
147
click to vote
AIIA
1995
Springer
15 years 4 months ago
1995
Springer
Genetic Programming (GP) is a method of automatically inducing programs by representing them as parse trees. In theory, programs in any computer languages can be translated to par...
LREC
2010
15 years 2 months ago
2010
We describe a process for converting the Penn Arabic Treebank into the CCG formalism. Previous efforts have yielded CCGbanks in English, German, and Turkish, thus opening these la...
105
click to vote
UAI
2004
15 years 2 months ago
2004
We introduce a probabilistic formalism subsuming Markov random fields of bounded tree width and probabilistic context free grammars. Our models are based on a representation of Bo...
130
click to vote
FOSSACS
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Some decision problems related to balanced context-free languages are important for their application to the static analysis of programs generating XML strings. One such ...
117
click to vote
GECCO
2005
Springer
15 years 6 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 ...