Sciweavers

54 search results - page 2 / 11
» Efficient Context-Free Grammar Constraints
Sort
View
ICGI
2010
Springer
13 years 2 months ago
Learning Context Free Grammars with the Syntactic Concept Lattice
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...
Alexander Clark
ACL
2008
13 years 7 months ago
Efficient Multi-Pass Decoding for Synchronous Context Free Grammars
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...
Hao Zhang, Daniel Gildea
ACL
1996
13 years 7 months ago
Pattern-Based Context-Free Grammars for Machine Translation
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...
Koichi Takeda
ICGI
2000
Springer
13 years 9 months ago
Constructive Learning of Context-Free Languages with a Subpansive Tree
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...
Noriko Sugimoto, Takashi Toyoshima, Shinichi Shimo...
NAACL
2010
13 years 3 months ago
Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems
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...
Carlos Gómez-Rodríguez, Marco Kuhlma...