Syntactic polygraphs. A formalism extending both constituency and dependency

zbMATH Open1376.68142MaRDI QIDQ4599207FDOQ4599207

Authors: Sylvain Kahane, Nicolas Mazziotta 

Publication date: 18 December 2017

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

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

Mathematics Subject Classification ID

Natural language processing (68T50)

Cited In (4)

• Faster shift-reduce constituent parsing with a non-binary, bottom-up strategy
• Word ordering as a graph rewriting process
• Title not available (Why is that?)
• Constituent structure sets. I

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)