612 search results - page 67 / 123 » A Computational Grammar for Georgian |
SAS
2001
Springer
15 years 5 months ago
2001
Springer
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The p...
104
click to vote
RSCTC
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. Classic parsing methods are based on complete search techniques to find the different interpretations of a sentence. However, the size of the search space increases expon...
ECEASST
2008
15 years 1 months ago
2008
: Graph parsing is known to be computationally expensive. For this reason the construction of special-purpose parsers may be beneficial for particular graph languages. In the domai...
130
click to vote
GPEM
2006
15 years 1 months ago
2006
Genetic programming (GP) extends traditional genetic algorithms to automatically induce computer programs. GP has been applied in a wide range of applications such as software ree...
SCAM
2007
IEEE
15 years 7 months ago
2007
IEEE
Collection attributes, as defined by Boyland, can be used as a mechanism for concisely specifying cross-referencelike properties such as callee sets, subclass sets, and sets of v...