179 search results - page 25 / 36 » Lambek Grammars Are Context Free |
DRMTICS
2005
Springer
14 years 1 months ago
2005
Springer
In this paper we propose a new scheme for software obfuscation and license protection that is based on an original transformation of the program’s call tree. The idea is based on...
JUCS
2006
13 years 7 months ago
2006
: Design patterns have been developed to cope with the vast space of possible different designs within object-oriented systems. One of those classic patterns is the Visitor Pattern...
ACL
2010
13 years 5 months ago
2010
Learning a tree substitution grammar is very challenging due to derivational ambiguity. Our recent approach used a Bayesian non-parametric model to induce good derivations from tr...
ACL
1993
13 years 9 months ago
1993
There is a need to develop a suitable computational grammar formalism for free word order languages for two reasons: First, a suitably designed formalism is likely to be more effi...
TCBB
2011
13 years 2 months ago
2011
Stochastic models such as hidden Markov models or stochastic context free grammars can fail to return the correct, maximum likelihood solution in the case of semantic ambiguity. T...