Syntactic polygraphs. A formalism extending both constituency and dependency

MaRDI QIDQ4599207zbMATH OpenFDO

Authors Sylvain Kahane, Nicolas Mazziotta

Publication date 18 December 2017

Full work available at URL https://aclweb.org/anthology/W/W15/W15-2313.pdf

Mathematics Subject Classification ID

Natural language processing (68T50)

Recommendations

• On relations of constituency and dependency grammars
• Defining dependencies (and constituents)
• Lexicalized Syntax and Topology for Non-projective Dependency Grammar
• Preface
• Word ordering as a graph rewriting process

Cited in

(4)

• Faster shift-reduce constituent parsing with a non-binary, bottom-up strategy
• Constituent structure sets. I
• Word ordering as a graph rewriting process
• scientific article; zbMATH DE number 2230907 (Why is no real title available?)

This page was built for publication: Syntactic polygraphs. A formalism extending both constituency and dependency

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4599207)