Dependency Grammar
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Chapter 14: Dependency Parsing
Speech and Language Processing. Daniel Jurafsky & James H. Martin. Copyright © 2021. All rights reserved. Draft of September 21, 2021. CHAPTER 14 Dependency Parsing The focus of the two previous chapters has been on context-free grammars and constituent-based representations. Here we present another important family of dependency grammars grammar formalisms called dependency grammars. In dependency formalisms, phrasal constituents and phrase-structure rules do not play a direct role. Instead, the syntactic structure of a sentence is described solely in terms of directed binary grammatical relations between the words, as in the following dependency parse: root dobj det nmod (14.1) nsubj nmod case I prefer the morning flight through Denver Relations among the words are illustrated above the sentence with directed, labeled typed dependency arcs from heads to dependents. We call this a typed dependency structure because the labels are drawn from a fixed inventory of grammatical relations. A root node explicitly marks the root of the tree, the head of the entire structure. Figure 14.1 shows the same dependency analysis as a tree alongside its corre- sponding phrase-structure analysis of the kind given in Chapter 12. Note the ab- sence of nodes corresponding to phrasal constituents or lexical categories in the dependency parse; the internal structure of the dependency parse consists solely of directed relations between lexical items in the sentence. These head-dependent re- lationships directly encode important information that is often buried in the more complex phrase-structure parses. For example, the arguments to the verb prefer are directly linked to it in the dependency structure, while their connection to the main verb is more distant in the phrase-structure tree. -
The Structure of Reflexive Clauses in Michif: a Relational Grammar Approach
University of North Dakota UND Scholarly Commons Theses and Dissertations Theses, Dissertations, and Senior Projects 12-1984 The trS ucture of Reflexive Clauses in Michif: A Relational Grammar Approach Larry Lee Lovell Follow this and additional works at: https://commons.und.edu/theses Part of the Linguistics Commons Recommended Citation Lovell, Larry Lee, "The trS ucture of Reflexive Clauses in Michif: A Relational Grammar Approach" (1984). Theses and Dissertations. 903. https://commons.und.edu/theses/903 This Thesis is brought to you for free and open access by the Theses, Dissertations, and Senior Projects at UND Scholarly Commons. It has been accepted for inclusion in Theses and Dissertations by an authorized administrator of UND Scholarly Commons. For more information, please contact [email protected]. THE STRUCTURE OF REFLEXIVE CLAUSES IN MICHIF: . ' i ' A RELATIONAL GRAMMAR APPROACH ) I by Larry Lee Lovell Bachelor of icience, Middle Tennessee State University, 1982 A Thesis Submitted to the Graduate Faculty of the University of North Dakota in partial fulfillment of the requirements for the degree of Master of Arts Grand Forks, North Dakota December · 1984 This thesis submitted by Larry Lee Lovell in partial fulfillment of the requirements for the Degree of M.A. in Linguistics from the University of North Dakota is hereby approved by the Faculty Advisory Committee under whom the work has been done. 0. This thesis meets the standards for appearance and conforms to the style and format requirements of the Graduate School of the University of North Dakota, and is hereby approved. ; I ! i - ii - ' . Title THE STRUCTURE OF REFLEXIVE CLAUSES IN MICHIF: A RELATIONAL GRAMMAR APPROACH Department Linguistics Degree Master of Arts In presenting this thesis in ~artial fulfillment of the requirements for a graduate degree from the University of North Dakota, I agree that the Library of this University shall make it freely available for inspection. -
A Relational Grammar Approach to Kera Syntax Janet K
Work Papers of the Summer Institute of Linguistics, University of North Dakota Session Volume 28 Article 1 1984 A relational grammar approach to Kera syntax Janet K. Camburn SIL-UND Follow this and additional works at: https://commons.und.edu/sil-work-papers Recommended Citation Camburn, Janet K. (1984) "A relational grammar approach to Kera syntax," Work Papers of the Summer Institute of Linguistics, University of North Dakota Session: Vol. 28 , Article 1. DOI: 10.31356/silwp.vol28.01 Available at: https://commons.und.edu/sil-work-papers/vol28/iss1/1 This Thesis is brought to you for free and open access by UND Scholarly Commons. It has been accepted for inclusion in Work Papers of the Summer Institute of Linguistics, University of North Dakota Session by an authorized editor of UND Scholarly Commons. For more information, please contact [email protected]. A RELATIOIAL GRAMMAR APPROACH TO KERA SIITAX Janet K. Camburn 1 Introduction 2 Introduction to Relational Grammar 3 Kera syntax 3T1 Tone 3.2 Kera verbs 3.3 Terms and term marking 3~4 Oblique markings 4 Advancements 4.1 Passive 4~2 3 advancement 4~3 Ben-3 advancement 4.4 Summary 5 Multiple depencencies 5.1 Pro-Replacement 5.2 Equi-Erasure and Equi-Subject Union 5.3 Equi-Erasure 5~4 Equi-Subject Union 6 The proper formulation of the Stem Agreement Rule 6~1 Summary 7 Ascensions 7,1 Ascensions out of 2-host 7~2 Ascensions out of a 1-host 7.3 Ascensions and unaccusatives 8 Possessor ascension 8.1 The possessive construction in Kera 8.2 Possessor ascension to 2 8.3 Possessor ascension to 3 8.4 Summary 1 Introduction Kera is an Afroasiatic language belonging to the Chadic family of languages. -
Dependency Grammars and Parsers
Dependency Grammars and Parsers Deep Processing for NLP Ling571 January 30, 2017 Roadmap Dependency Grammars Definition Motivation: Limitations of Context-Free Grammars Dependency Parsing By conversion to CFG By Graph-based models By transition-based parsing Dependency Grammar CFGs: Phrase-structure grammars Focus on modeling constituent structure Dependency grammars: Syntactic structure described in terms of Words Syntactic/Semantic relations between words Dependency Parse A dependency parse is a tree, where Nodes correspond to words in utterance Edges between nodes represent dependency relations Relations may be labeled (or not) Dependency Relations Speech and Language Processing - 1/29/17 Jurafsky and Martin 5 Dependency Parse Example They hid the letter on the shelf Why Dependency Grammar? More natural representation for many tasks Clear encapsulation of predicate-argument structure Phrase structure may obscure, e.g. wh-movement Good match for question-answering, relation extraction Who did what to whom Build on parallelism of relations between question/relation specifications and answer sentences Why Dependency Grammar? Easier handling of flexible or free word order How does CFG handle variations in word order? Adds extra phrases structure rules for alternatives Minor issue in English, explosive in other langs What about dependency grammar? No difference: link represents relation Abstracts away from surface word order Why Dependency Grammar? Natural efficiencies: CFG: Must derive full trees of many -
Dependency Grammar and the Parsing of Chinese Sentences*
Dependency Grammar and the Parsing of Chinese Sentences* LAI Bong Yeung Tom Department of Chinese, Translation and Linguistics City University of Hong Kong Department of Computer Science and Technology Tsinghua University, Beijing E-mail: [email protected] HUANG Changning Department of Computer Science and Technology Tsinghua University, Beijing Abstract Dependency Grammar has been used by linguists as the basis of the syntactic components of their grammar formalisms. It has also been used in natural langauge parsing. In China, attempts have been made to use this grammar formalism to parse Chinese sentences using corpus-based techniques. This paper reviews the properties of Dependency Grammar as embodied in four axioms for the well-formedness conditions for dependency structures. It is shown that allowing multiple governors as done by some followers of this formalism is unnecessary. The practice of augmenting Dependency Grammar with functional labels is discussed in the light of building functional structures when the sentence is parsed. This will also facilitate semantic interpretion. 1 Introduction Dependency Grammar (DG) is a grammatical theory proposed by the French linguist Tesniere.[1] Its formal properties were then studied by Gaifman [2] and his results were brought to the attention of the linguistic community by Hayes.[3] Robinson [4] considered the possiblity of using this grammar within a transformation-generative framework and formulated four axioms for the well-formedness of dependency structures. Hudson [5] adopted Dependency Grammar as the basis of the syntactic component of his Word Grammar, though he allowed dependency relations outlawed by Robinson's axioms. Dependency Grammar is concerned directly with individual words. -
Chapter 30 HPSG and Lexical Functional Grammar Stephen Wechsler the University of Texas Ash Asudeh University of Rochester & Carleton University
Chapter 30 HPSG and Lexical Functional Grammar Stephen Wechsler The University of Texas Ash Asudeh University of Rochester & Carleton University This chapter compares two closely related grammatical frameworks, Head-Driven Phrase Structure Grammar (HPSG) and Lexical Functional Grammar (LFG). Among the similarities: both frameworks draw a lexicalist distinction between morphology and syntax, both associate certain words with lexical argument structures, both employ semantic theories based on underspecification, and both are fully explicit and computationally implemented. The two frameworks make available many of the same representational resources. Typical differences between the analyses proffered under the two frameworks can often be traced to concomitant differ- ences of emphasis in the design orientations of their founding formulations: while HPSG’s origins emphasized the formal representation of syntactic locality condi- tions, those of LFG emphasized the formal representation of functional equivalence classes across grammatical structures. Our comparison of the two theories includes a point by point syntactic comparison, after which we turn to an exposition ofGlue Semantics, a theory of semantic composition closely associated with LFG. 1 Introduction Head-Driven Phrase Structure Grammar is similar in many respects to its sister framework, Lexical Functional Grammar or LFG (Bresnan et al. 2016; Dalrymple et al. 2019). Both HPSG and LFG are lexicalist frameworks in the sense that they distinguish between the morphological system that creates words and the syn- tax proper that combines those fully inflected words into phrases and sentences. Stephen Wechsler & Ash Asudeh. 2021. HPSG and Lexical Functional Gram- mar. In Stefan Müller, Anne Abeillé, Robert D. Borsley & Jean- Pierre Koenig (eds.), Head-Driven Phrase Structure Grammar: The handbook. -
Dependency Grammar
Dependency Grammar Introduc)on Christopher Manning Dependency Grammar and Dependency Structure Dependency syntax postulates that syntac)c structure consists of relaons between lexical items, normally binary asymmetric relaons (“arrows”) called dependencies submitted Bills were by on Brownback ports Senator Republican and immigration of Kansas Christopher Manning Dependency Grammar and Dependency Structure Dependency syntax postulates that syntac)c structure consists of relaons between lexical items, normally binary asymmetric relaons (“arrows”) called dependencies submitted nsubjpass auxpass prep The arrows are Bills were by commonly typed prep pobj with the name of on Brownback pobj nn appos grammacal ports Senator Republican relaons (subject, cc conj prep preposi)onal object, and immigration of apposi)on, etc.) pobj Kansas Christopher Manning Dependency Grammar and Dependency Structure Dependency syntax postulates that syntac)c structure consists of relaons between lexical items, normally binary asymmetric relaons (“arrows”) called dependencies submitted The arrow connects a nsubjpass auxpass prep head (governor, Bills were by superior, regent) with a prep pobj dependent (modifier, on inferior, subordinate) Brownback pobj nn appos ports Senator Republican Usually, dependencies cc conj prep form a tree (connected, and immigration of acyclic, single-head) pobj Kansas Christopher Manning Dependency Grammar and Dependency Structure ROOT Discussion of the outstanding issues was completed . • Some people draw the arrows one way; some the other way! • Tesnière had them point from head to dependent… • Usually add a fake ROOT so every word is a dependent of precisely 1 other node Christopher Manning Dependency Grammar/Parsing History • The idea of dependency structure goes back a long way • To Pāṇini’s grammar (c. -
Can Participate in Syntactic Operations; the Law Means That Any Oblique Which Appears in a Sentence Must Bear That Oblique Relation in the Ini Tial Level
0SU WPL # 26 (1982) 93-101. A Note on the Oblique Law* Brian D. Joseph Perlmutter and Postal (1978a: 15) posit the following "law" within the framework of Relational Grammar : (1) We say that Bis a Ci arc if Bis an arc one of whose coordinates is Ci. Then: if A is an oblique arc , A is a C1 arc. This law is known as the Oblique Law because it constrains the extent to which oblique nominals, i.e. those bearing the nonterm core grammatical rel ations1 such as benefactive, temporal, circumstantial, locative, etc. can participate in syntactic operations; the law means that any oblique which appears in a sentence must bear that oblique relation in the ini tial level. The original intent of this law as indicated by Perlmutter and Postal ' s discussion (p. 15) of it, was to rule out advancements or demotions2 to any oblique grammatical relation. However, as it is currently formulated , it is more general than that and rules out ascensions (i. e . raisings) to an oblique relation as well. The purpose of this note is to show that at best, only the more restricted interpretation of the Oblique Law is valid, because there is a construction in Modern Greek which provides a counter- example to the broader interpretation, as well as other facts which might bear on even the more narrow version of the law. The Greek construction in question is the one called Raising-to-Oblique in Joseph (1979), and involves the circumstantial preposition me ' with' .3 Me can govern simple nominal complements, as in (2), or clausalcomplements, as in (3) : (2) me t6so 66rivo, aen borusa na aulepso with so-much noise/ACC not could/SG VBL PART work/1 SG ' With so much noise, I couldn't work.' (3) me to na stekete eki etsi with NOMINALIZER VBL PART stand/3 S~ there thus o Yanis, tlen borusa na dulepso John/NOM ' With John standing there like that, I couldn' t work.' The evidence against the Oblique Law comes from a construction which is a variant of (3), in which the subject of the clausal object of me is raised to become itself the object of me. -
Dependency Grammar Induction Via Bitext Projection Constraints
Dependency Grammar Induction via Bitext Projection Constraints Kuzman Ganchev and Jennifer Gillenwater and Ben Taskar Department of Computer and Information Science University of Pennsylvania, Philadelphia PA, USA {kuzman,jengi,taskar}@seas.upenn.edu Abstract ing recent interest in transferring linguistic re- sources from one language to another via parallel Broad-coverage annotated treebanks nec- text. For example, several early works (Yarowsky essary to train parsers do not exist for and Ngai, 2001; Yarowsky et al., 2001; Merlo many resource-poor languages. The wide et al., 2002) demonstrate transfer of shallow pro- availability of parallel text and accurate cessing tools such as part-of-speech taggers and parsers in English has opened up the pos- noun-phrase chunkers by using word-level align- sibility of grammar induction through par- ment models (Brown et al., 1994; Och and Ney, tial transfer across bitext. We consider 2000). generative and discriminative models for Alshawi et al. (2000) and Hwa et al. (2005) dependency grammar induction that use explore transfer of deeper syntactic structure: word-level alignments and a source lan- dependency grammars. Dependency and con- guage parser (English) to constrain the stituency grammar formalisms have long coex- space of possible target trees. Unlike isted and competed in linguistics, especially be- previous approaches, our framework does yond English (Mel’cuk,ˇ 1988). Recently, depen- not require full projected parses, allowing dency parsing has gained popularity as a simpler, partial, approximate transfer through lin- computationally more efficient alternative to con- ear expectation constraints on the space stituency parsing and has spurred several super- of distributions over trees. -
Three Dependency-And-Boundary Models for Grammar Induction
Three Dependency-and-Boundary Models for Grammar Induction Valentin I. Spitkovsky Hiyan Alshawi Stanford University and Google Inc. Google Inc., Mountain View, CA, 94043 [email protected] [email protected] Daniel Jurafsky Stanford University, Stanford, CA, 94305 [email protected] Abstract DT NN VBZ IN DT NN [The check] is in [the mail]. We present a new family of models for unsu- | {z } | {z } pervised parsing, Dependency and Boundary Subject Object models, that use cues at constituent bound- Figure 1: A partial analysis of our running example. aries to inform head-outward dependency tree generation. We build on three intuitions that Consider the example in Figure 1. Because the are explicit in phrase-structure grammars but determiner (DT) appears at the left edge of the sen- only implicit in standard dependency formu- tence, it should be possible to learn that determiners lations: (i) Distributions of words that oc- may generally be present at left edges of phrases. cur at sentence boundaries — such as English This information could then be used to correctly determiners — resemble constituent edges. parse the sentence-internal determiner in the mail. (ii) Punctuation at sentence boundaries fur- ther helps distinguish full sentences from Similarly, the fact that the noun head (NN) of the ob- fragments like headlines and titles, allow- ject the mail appears at the right edge of the sentence ing us to model grammatical differences be- could help identify the noun check as the right edge tween complete and incomplete sentences. of the subject NP. As with jigsaw puzzles, working (iii) Sentence-internal punctuation boundaries inwards from boundaries helps determine sentence- help with longer-distance dependencies, since internal structures of both noun phrases, neither of punctuation correlates with constituent edges. -
Towards an Implelnentable Dependency Grammar
Towards an implementable dependency grammar Timo JKrvinen and Pasi Tapanainen Research Unit for Multilingual Language Technology P.O. Box 4, FIN-00014 University of Helsinki, Finland Abstract such as a context-free phrase structure gram- mar. This leads us to a situation where the Syntactic models should be descriptively ade- parsing problem is extremely hard in the gen- I quate and parsable. A syntactic description is eral, theoretical case, but fortunately parsable autonomous in the sense that it has certain ex- in practise. Our result shows that, while in gen- plicit formal properties. Such a description re- eral we have an NP-hard parsing problem, there i lates to the semantic interpretation of the sen- is a specific solution for the given grammar that tences, and to the surface text. As the formal- can be run quickly. Currently, the speed of the ism is implemented in a broad-coverage syntac- parsing system I is several hundred words per tic parser, we concentrate on issues that must I second. be resolved by any practical system that uses In short, the grammar should be empirically such models. The correspondence between the motivated. We have all the reason to believe structure and linear order is discussed. ! that if a linguistic analysis rests on a solid de- scriptive basis, analysis tools based on the the- 1 Introduction ory would be more useful for practical purposes. i The aim of this paper is to define a dependency We are studying the possibilities of using com- grammar framework which is both linguistically putational implementation as a developing and motivated and computationally parsable. -
Dependency Parsing
Dependency Parsing Sandra Kubler¨ LSA Summer Institute 2017 Dependency Parsing 1(16) Dependency Syntax ◮ The basic idea: ◮ Syntactic structure consists of lexical items, linked by binary asymmetric relations called dependencies. ◮ In the words of Lucien Tesni`ere: ◮ La phrase est un ensemble organis´e dont les ´el´ements constituants sont les mots. [1.2] Tout mot qui fait partie d’une phrase cesse par lui-mˆeme d’ˆetre isol´ecomme dans le dictionnaire. Entre lui et ses voisins, l’esprit aper¸coit des connexions, dont l’ensemble forme la charpente de la phrase. [1.3] Les connexions structurales ´etablissent entre les mots des rapports de d´ependance. Chaque connexion unit en principe un terme sup´erieur `aun terme inf´erieur. [2.1] Le terme sup´erieur re¸coit le nom de r´egissant. Le terme inf´erieur re¸coit le nom de subordonn´e. Ainsi dans la phrase Alfred parle [. ], parle est le r´egissant et Alfred le subordonn´e. [2.2] Dependency Parsing 2(16) Dependency Syntax ◮ The basic idea: ◮ Syntactic structure consists of lexical items, linked by binary asymmetric relations called dependencies. ◮ In the words of Lucien Tesni`ere: ◮ The sentence is an organized whole, the constituent elements of which are words. [1.2] Every word that belongs to a sentence ceases by itself to be isolated as in the dictionary. Between the word and its neighbors, the mind perceives connections, the totality of which forms the structure of the sentence. [1.3] The structural connections establish dependency relations between the words. Each connection in principle unites a superior term and an inferior term.