54 search results - page 2 / 11 » Efficient Context-Free Grammar Constraints |
129
click to vote
ICGI
2010
Springer
14 years 11 months ago
2010
Springer
The Syntactic Concept Lattice is a residuated lattice based on the distributional structure of a language; the natural representation based on this is a context sensitive formalism...
115
click to vote
ACL
2008
15 years 3 months ago
2008
We take a multi-pass approach to machine translation decoding when using synchronous context-free grammars as the translation model and n-gram language models: the first pass uses...
109
click to vote
ACL
1996
15 years 3 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...
131
click to vote
ICGI
2000
Springer
15 years 5 months ago
2000
Springer
A subpansive tree is a rooted tree that gives a partial order of nonterminal symbols of a context-free grammar. We formalize subpansive trees as background knowledge of CFGs, and i...
114
Voted
NAACL
2010
14 years 11 months ago
2010
The use of well-nested linear context-free rewriting systems has been empirically motivated for modeling of the syntax of languages with discontinuous constituents or relatively f...