Dependency structures and lexicalized grammars. An algebraic approach
formal languagecomputational linguisticstree-adjoining grammardependencies in natural languagedependency language hierarchyfree word orderlong-distance dependenciesnon-projective dependency grammarphrase-structure grammarpolynomial parsing algorithm
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to game theory, economics, and finance (91-02) Grammars and rewriting systems (68Q42) Algebraic theory of languages and automata (68Q70) Natural language processing (68T50) Linguistics (91F20)
- Computational dependency theory. Selected papers from the international conference on dependency linguistics (Depling 2011), Barcelona, Spain, September 5--7, 2011
- Automata for branching and layered temporal structures. An investigation into regularities of infinite transition systems
- Unification grammars.
- Parsing schemata for practical text analysis.
- Phrase structure composition and syntactic dependencies
- Inductive dependency parsing
- Uniform \textit{vs.} nonuniform membership for mildly context-sensitive languages: a brief survey
- Automata for branching and layered temporal structures. An investigation into regularities of infinite transition systems
- Multiple context-free tree grammars: lexicalization and characterization
- The generative power of probabilistic and weighted context-free grammars
- On relations of constituency and dependency grammars
- Algebraic governance and symmetry in dependency grammars
- Parsing schemata for practical text analysis.
- Anti-context-free languages
- Lexicalized Syntax and Topology for Non-projective Dependency Grammar
This page was built for publication: Dependency structures and lexicalized grammars. An algebraic approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q983734)
