Dependency structures and lexicalized grammars. An algebraic approach

DOI10.1007/978-3-642-14568-1zbMath1194.68241OpenAlexW4234352621MaRDI QIDQ983734

Marco Kuhlmann

Publication date: 24 July 2010

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

Full work available at URL: https://doi.org/10.1007/978-3-642-14568-1

zbMATH Keywords

computational linguisticsformal languagetree-adjoining grammardependencies in natural languagedependency language hierarchyfree word orderlong-distance dependenciesnon-projective dependency grammarphrase-structure grammarpolynomial parsing algorithm

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to game theory, economics, and finance (91-02) Algebraic theory of languages and automata (68Q70) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Grammars and rewriting systems (68Q42) Natural language processing (68T50) Linguistics (91F20)

Related Items (3)

The Generative Power of Probabilistic and Weighted Context-Free Grammars ⋮ Uniform \textit{vs.} nonuniform membership for mildly context-sensitive languages: a brief survey ⋮ Multiple context-free tree grammars: lexicalization and characterization

This page was built for publication: Dependency structures and lexicalized grammars. An algebraic approach