Multiplanarity - a model for dependency structures in treebanks
Helda (University of Helsinki)Published 1 January 2003Open access
Anssi Yli-Jyrä
Citations26
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A model for linguistically adequate classes of dependency structures in treebanks is given, using the Danish Dependency Treebank, and it is shown that projectivity does not lend itself to adequate treatment of certain non-local syntactic phenomena which are extensively studied in the literature of constituent-based theories.
Abstract
The number of treebanks available for different languages is growing steadily. A considerable portion of the recent treebanks use annotation schemes that are based on dependency syntax. In this paper, we give a model for linguistically adequate
Keywords
Computer Science
Mathematics and Computers in SimulationIntroduction to automata theory, languages and computation
10,827 Citations1981
Éléments de syntaxe structurale
1,067 Citations1959Lucien Tesnière
Cambridge University Press eBooksTree adjoining grammars: How much context-sensitivity is required to provide reasonable structural descriptions?
550 Citations1985Aravind K. Joshi
An efficient algorithm for projective dependency parsing
497 Citations2003Joakim Nivre
This paper presents a deterministic parsing algorithm for projective dependency grammar that has been experimentally evaluated in parsing unrestricted Swedish text, achieving an accuracy above 85% with a very simple grammar.
Information and ControlDependency systems and phrase-structure systems
390 Citations1965Haim Gaifman
The result above implies that there will be cases in which the second system based on phrase-structure rules will not be “naturally correlated≓ with the given one from a structural point of view.
Studies in linguistics and philosophyApplicability of Indexed Grammars to Natural Languages
160 Citations1988Gerald Gazdar
This chapter discusses the class of context-free phrase structure grammars, which has been alluded to a number of times in the recent linguistic literature: by Klein (1981) in connection with nested comparative constructions, by Dahl (1982) in connected with topicalised pronouns, by Engdahl ( 1982) and Gazdar (1982).
Language<b>The case for Lexicase:</b> An outline of Lexicase grammatical theory. By Stanley Starosta. London: Pinter, 1988. Pp. xii, 273.
99 Citations1989Barry J. Blake
Theoretical Computer ScienceA geometric hierarchy beyond context-free languages
62 Citations1992David Weir
This paper gives a progression of automata and shows that it corresponds exactly to the language hierarchy defined with control grammars, the first member of which is context-free languages.
An Earley-type recognizer for dependency grammar
31 Citations1996Vincenzo Lombardo, Leonardo Lesmo
The paper describes an improved Earley-type recognizer with a complexity O(IGI2n3) due to a precompilation of the dependency rules into parse tables, that determine the conditions of applicability of two primary actions used in recognition.
Dependency parsing with an extended finite state approach
17 Citations1999Kemal Oflazer
The parser augments input representation with "channels" so that links representing syntactic dependency relations among words can be accommodated, and iterates on the input a number of times to arrive at a fixed point.
On Parsing Binary Dependency Structures Deterministically in Linear Time
10 Citations1998Harri Arnola
Lecture notes in computer sciencePolarized Non-projective Dependency Grammars
8 Citations2001Alexander Dikovsky
Dependency tree grammars are proposed in which unbounded discontinuity is resolved through the first available valency saturation, and they are weakly equivalent to cf-grammars, parsable in cubic time, and are stronger than non-projective dependency Grammars without long dependencies.
SciDok (Saarland University and State Library)A meta-grammatical framework for dependency grammar
4 Citations2003Ralph Debusmann, Denys Duchier
An extended instantiation is described which adds support for semantic dependencies (thus also providing an account of control and raising constructions) and meaning assembly in a meta-grammatical framework for dependency grammar.
SerWisS (University of Applied Sciences and Arts Hannover)Extending Linear Indexed Grammars
2 Citations2021Christian Wartena
It is shown that the resulting formalisms give rise to a hierarchy of languages that is equivalent with a hierarchy defined by Weir, and the proposed extensions of LIGs become comparable with extensions of tree adjoining grammars and head grammars.