612 search results - page 22 / 123 » A Computational Grammar for Georgian |
106
click to vote
SPAA
1993
ACM
15 years 5 months ago
1993
ACM
This paper concerns the problem of how to exploit parallelism during the phases of compilation involving syntaxdirected analysis and translation. In particular, we address the pro...
111
click to vote
CSR
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. Deterministic graph grammars are finite devices which generate the transition graphs of pushdown automata. We define the notion of synchronization by grammars, generalizi...
MFCS
2009
Springer
15 years 8 months ago
2009
Springer
Functional graph grammars are finite devices which generate the class of regular automata. We recall the notion of synchronization by grammars, and for any given grammar we consid...
130
click to vote
NAACL
2010
14 years 11 months ago
2010
In this paper, we present an innovative chart mining technique for improving parse coverage based on partial parse outputs from precision grammars. The general approach of mining ...
101
click to vote
ACL
2009
14 years 11 months ago
2009
Binarization of n-ary rules is critical for the efficiency of syntactic machine translation decoding. Because the target side of a rule will generally reorder the source side, it ...