Results 281 to 290 of about 86,272 (333)
Some of the next articles are maybe not open access.
2005
In this paper, we define Dependency Structure Grammars (DSG), which are rewriting rule grammars generating sentences together with their dependency structures, are more expressive than CF-grammars and non-equivalent to mildly context-sensitive grammars.
Béchet, Denis +2 more
openaire +2 more sources
In this paper, we define Dependency Structure Grammars (DSG), which are rewriting rule grammars generating sentences together with their dependency structures, are more expressive than CF-grammars and non-equivalent to mildly context-sensitive grammars.
Béchet, Denis +2 more
openaire +2 more sources
Do Grammars Minimize Dependency Length?
Cognitive Science, 2010AbstractA well‐established principle of language is that there is a preference for closely related words to be close together in the sentence. This can be expressed as a preference for dependency length minimization (DLM). In this study, we explore quantitatively the degree to which natural languages reflect DLM.
Daniel, Gildea, David, Temperley
openaire +2 more sources
Linguistics and Philosophy, 1994
1. INTRODUCTION Dynamics is the formal study of systems involving states and transitions between states. A natural application of dynamics is to the study of language processing, where words or morphemes can be thought of as actions which perform transitions between states of the language processor. The paper concentrates on sentence as opposed to text
openaire +1 more source
1. INTRODUCTION Dynamics is the formal study of systems involving states and transitions between states. A natural application of dynamics is to the study of language processing, where words or morphemes can be thought of as actions which perform transitions between states of the language processor. The paper concentrates on sentence as opposed to text
openaire +1 more source
1991
The paper deals with a parser for dependency grammars. An intuitive and clear representation of the grammar is introduced: the formalism, that originates from the ID/LP constituency grammar, expresses the constraints of well-formedness of the sentences via two tables of relations of immediate dominance and linear precedence for pairs of syntactic ...
openaire +2 more sources
The paper deals with a parser for dependency grammars. An intuitive and clear representation of the grammar is introduced: the formalism, that originates from the ID/LP constituency grammar, expresses the constraints of well-formedness of the sentences via two tables of relations of immediate dominance and linear precedence for pairs of syntactic ...
openaire +2 more sources
2010
Parser combinators are a popular tool for designing parsers in functional programming languages. If such combinators generate an abstract representation of the grammar as an intermediate step, it becomes easier to perform analyses and transformations that can improve the behaviour of the resulting parser.
Kasper Brink +2 more
openaire +1 more source
Parser combinators are a popular tool for designing parsers in functional programming languages. If such combinators generate an abstract representation of the grammar as an intermediate step, it becomes easier to perform analyses and transformations that can improve the behaviour of the resulting parser.
Kasper Brink +2 more
openaire +1 more source
2023
This chapter discusses Dependency Grammar from the perspective of LFG. I first introduce the key ideas behind Dependency Grammar and how they relate to LFG concepts. I then show how both LFGs and Dependency Grammars can be translated into Multiple Context-Free Grammars to study formal differences between the frameworks.
openaire +1 more source
This chapter discusses Dependency Grammar from the perspective of LFG. I first introduce the key ideas behind Dependency Grammar and how they relate to LFG concepts. I then show how both LFGs and Dependency Grammars can be translated into Multiple Context-Free Grammars to study formal differences between the frameworks.
openaire +1 more source
Constructions are catenae: Construction Grammar meets Dependency Grammar
cogl, 2012Abstract The paper demonstrates that dependency-based syntax is in a strong position to produce principled and economical accounts of the syntax of constructs. The difficulty that constituency-based syntax has in this regard is that very many constructs fail to qualify as constituents.
Timothy Osborne,, Thomas Gross,
openaire +1 more source
Adaptation of universal dependencies to specific grammars: The case of Persian dependency grammar
2016 Eighth International Conference on Information and Knowledge Technology (IKT), 2016Universal Dependencies is the latest standard annotation scheme available, aiming at cross-linguistically consistent treebank annotation. It has already been adapted to a large number of languages including Persian. The trend, however, has been to take into account the original principles of dependency grammar rather than a description of the specific ...
Navid Baradaran Hemmati +2 more
openaire +1 more source
Chapters of Dependency Grammar
2020Was Tesnière the founding father of dependency grammar or merely a culmination point in its long history? Leaving no doubt that the latter position is correct, Chapters of Dependency Grammar tells the story of how dependency-oriented grammatical description developed from Antiquity up to the early 20th century.
openaire +1 more source