182 search results - page 7 / 37 » Context-Free Valence Grammars - Revisited |
IJCAI
2001
14 years 10 months ago
2001
We present a machine learning algorithm for refining the structure of a stochastic context
JALC
2006
14 years 9 months ago
2006
-- Let {a1, a2, . . . , an} be an alphabet of n symbols and let Cn be the language of circular shifts of the word a1a2
59
Voted
ANLP
2000
14 years 10 months ago
2000
A long-standing issue regarding algorithms that manipulate context-free grammars (CFGs) in a "top-down" leftto-right fashion is that left recursion can lead to nontermin...
ANLP
2000
14 years 10 months ago
2000
We compare the asymptotic time complexity of left-to-right and bidirectional parsing techniques for bilexical context-free grammars, a grammar formalis an abstraction of language ...
77
Voted
ACL
1996
14 years 10 months ago
1996
This paper proposes the use of "patternbased" context-free grammars as a basis for building machine translation (MT) systems, which are now being adopted as personal too...