Approximating dependency grammars through intersection of regular languages

DOI10.1007/978-3-540-30500-2_26MaRDI QIDQ5463988zbMATH OpenOpenAlexDBLPFDO

Authors Anssi Yli-Jyrä

Publication date 17 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b105090

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• APPROXIMATING DEPENDENCY GRAMMARS THROUGH INTERSECTION OF STAR-FREE REGULAR LANGUAGES
• Polarized non-projective dependency grammars
• Dependency structure grammars
• Regular Approximation of Weighted Linear Context-Free Tree Languages
• Lexicalized Syntax and Topology for Non-projective Dependency Grammar

Cited in

(4)

• Dependency structure analysis as combinatorial optimization
• A finite state intersection approach to propositional satisfiability
• Projectivity property in NLP
• APPROXIMATING DEPENDENCY GRAMMARS THROUGH INTERSECTION OF STAR-FREE REGULAR LANGUAGES

This page was built for publication: Approximating dependency grammars through intersection of regular languages

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