643 search results - page 34 / 129 » Parsing And Derivational Equivalence |
MFCS
2004
Springer
14 years 27 days ago
2004
Springer
A binary language-theoretic operation is proposed, which is dual to the concatenation of languages in the same sense as the universal quantifier in logic is dual to the existenti...
ACL
2004
13 years 9 months ago
2004
Generalized Multitext Grammar (GMTG) is a synchronous grammar formalism that is weakly equivalent to Linear Context-Free Rewriting Systems (LCFRS), but retains much of the notatio...
ACL
2006
13 years 9 months ago
2006
Synchronous Context-Free Grammars (SCFGs) have been successfully exploited as translation models in machine translation applications. When parsing with an SCFG, computational comp...
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...
ECOWS
2006
Springer
13 years 11 months ago
2006
Springer
In this paper, author proposes a solution to make URI Resolver class available in different programming languages. The Semantic Resolver derived from a corresponding .NET or Java ...