CONTEXT-FREE REWRITING: Related Papers in ACL Anthology

CONTEXT-FREE REWRITING can be found in the following ACL ARC 1.0 documents (click to explore):

• (ACL ID: E95-1013) literal movement grammars
• (ACL ID: H05-1101) some computational complexity results for synchronous context-free grammars
• (ACL ID: J05-2003) tree-local multicomponent tree-adjoining grammars with shared nodes
• (ACL ID: J91-3002) chinese number-names, tree adjoining languages, and mild context-sensitivity
• (ACL ID: J94-3001) regular models of phonological rule systems
• (ACL ID: N06-1033) synchronous binarization for machine translation
• (ACL ID: N06-1044) estimation of consistent probabilistic context-free grammars
• (ACL ID: P01-1018) constraints on strong generative power
• (ACL ID: P04-1084) generalized multitext grammars
• (ACL ID: P06-1018) polarized unification grammars
• (ACL ID: P06-2066) mildly non-projective dependency structures
• (ACL ID: P87-1015) characterizing structural descriptions produced by various grammatical formalisms
• (ACL ID: P88-1034) combinatory categorial grammars
• (ACL ID: P91-1015) head corner parsing for discontinuous constituency
• (ACL ID: P92-1012) recognition of linear context-free rewriting systems
• (ACL ID: P92-1018) linear context-free rewriting systems and deterministic tree-walking transducers
• (ACL ID: P93-1018) parallel multiple context-free grammars, finite-state translation systems, and polynomial-time recognizable subclasses of lexical-functional grammars
• (ACL ID: P99-1076) parsing preferences with lexicalized trey adjoining grammars exploiting the derivation tree
• (ACL ID: W04-1503) a simple string-rewriting formalism for dependency grammar
• (ACL ID: W04-1504) axiomatization of restricted non-projective dependency trees through finite-state constraints that analyse crossing bracketings
• (ACL ID: W05-1502) parsing linear context-free rewriting systems
• (ACL ID: W06-1508) stochastic multiple context-free grammar for rna pseudoknot modeling