612 search results - page 48 / 123 » A Computational Grammar for Georgian |
DCC
1994
IEEE
15 years 4 months ago
1994
IEEE
101
click to vote
ACL
2008
15 years 2 months ago
2008
We propose the use of regular tree grammars (RTGs) as a formalism for the underspecified processing of scope ambiguities. By applying standard results on RTGs, we obtain a novel a...
127
click to vote
ISMB
1994
15 years 2 months ago
1994
We describe and demonstrate the effectiveness of a method of predicting protein secondary structures, sheet regions in particular, using a class of stochastic tree grammars as rep...
FCT
2007
Springer
15 years 7 months ago
2007
Springer
We consider standard algorithms of finite graph theory, like for instance shortest path algorithms. We present two general methods to polynomially extend these algorithms to infi...
110
click to vote
ACL
2010
14 years 11 months ago
2010
Linear Context-Free Rewriting Systems (LCFRSs) are a grammar formalism capable of modeling discontinuous phrases. Many parsing applications use LCFRSs where the fan-out (a measure...