Word ordering as a graph rewriting process

DOI10.1007/978-3-662-53042-9_13MaRDI QIDQ2835057zbMATH OpenOpenAlexFDO

Authors Sylvain Kahane, François Lareau

Publication date 1 December 2016

Published in Formal Grammar (Search for Journal in Brave)

Full work available at URL https://halshs.archives-ouvertes.fr/halshs-01740481/file/gup-linearization-fg2016.pdf

zbMATH Keywords

dependency grammarlinearizationpolarized unification grammarsyntax

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Linguistics (91F20)

Recommendations

• scientific article; zbMATH DE number 5060902
• Lexicalized Syntax and Topology for Non-projective Dependency Grammar
• A simple CF formalism and free word order
• scientific article; zbMATH DE number 569754
• Syntactic polygraphs. A formalism extending both constituency and dependency

Cites work

• scientific article; zbMATH DE number 1690086 (Why is no real title available?)
• scientific article; zbMATH DE number 3159100 (Why is no real title available?)
• scientific article; zbMATH DE number 777478 (Why is no real title available?)
• Movement-Generalized Minimalist Grammars
• Syntactic polygraphs. A formalism extending both constituency and dependency

Cited in

(8)

• Algorithm for converting dependency tree to the control space of syntactic structure of the sentence
• A Note on Structural Homonymy and Word Order
• LINEAR ORDER AS A PREDICTOR OF WORD ORDER REGULARITIES
• A simple CF formalism and free word order
• scientific article; zbMATH DE number 569754 (Why is no real title available?)
• Syntactic polygraphs. A formalism extending both constituency and dependency
• Tree wrapping for role and reference grammar
• An external knowledge enhanced graph-based neural network for sentence ordering

This page was built for publication: Word ordering as a graph rewriting process

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