Extensible Dependency Grammar Extensible Dependency Grammar: A Modular Grammar Formalism Based On Multigraph Description Ralph Debusmann Programming Systems Lab, Saarbrücken, Germany Promotionskolloquium, November 3, 2006
Extensible Dependency Grammar What the thesis is about Extensible Dependency Grammar (XDG) new grammar formalism for natural language explores the combination of: dependency grammar 1 model theory 2 parallel architecture 3 results: modularity: grammars can be extended by any linguistic 1 aspect, each modeled independently emergence: complex linguistic phenomena emerge as the 2 intersection of the linguistic aspects
Extensible Dependency Grammar Overview Introduction 1 Formalization 2 Implementation 3 Application 4 Conclusions 5
Extensible Dependency Grammar Introduction Overview Introduction 1 Formalization 2 Implementation 3 Application 4 Conclusions 5
Extensible Dependency Grammar Introduction Dependency Grammar Dependency Grammar traditional (Chomsky 1957): syntax of natural language analyzed in terms of phrase structure grammar: hierarchically arranges substrings called phrases nodes labeled by syntactic categories S NP VP Det N V VP Every baby wants Part V to eat
Extensible Dependency Grammar Introduction Dependency Grammar Dependency Grammar dependency grammar (Tesnière 1959): hierarchically arranges words edges labeled by grammatical functions mothers: heads, daughters: dependents b j u vinf s t r t a e p d Every baby wants to eat
Extensible Dependency Grammar Introduction Dependency Grammar Advantages flexibility: dependency analyses need not be trees but can be arbitrary graphs need not be ordered perfectly suited for modeling linguistic aspects other than syntax, e.g. predicate-argument structure, where the models are unordered DAGs
Extensible Dependency Grammar Introduction Model Theory Model Theory traditional: generative perspective on grammar (Chomsky 1957): start with the empty set 1 use production rules to generate the well-formed models 2
Extensible Dependency Grammar Introduction Model Theory Model Theory traditional: generative perspective on grammar (Chomsky 1957): start with the empty set 1 use production rules to generate the well-formed models 2 b u s j vinf det part Every baby wants to eat
Extensible Dependency Grammar Introduction Model Theory Model Theory traditional: generative perspective on grammar (Chomsky 1957): start with the empty set 1 use production rules to generate the well-formed models 2 s b u j vinf det part Every baby wants to eat b u s j vinf det part Every baby wants to eat
Extensible Dependency Grammar Introduction Model Theory Model Theory traditional: generative perspective on grammar (Chomsky 1957): start with the empty set 1 use production rules to generate the well-formed models 2 s j b u vinf det part Every baby wants to eat b u s j vinf det part Every baby wants to eat b u s j vinf det part Every baby wants to eat
Extensible Dependency Grammar Introduction Model Theory Model Theory traditional: generative perspective on grammar (Chomsky 1957): start with the empty set 1 use production rules to generate the well-formed models 2 s j b u vinf det part Every baby wants to eat b u s j vinf det part Every baby wants to eat s u b j vinf det part Every baby wants to eat u b j vinf s det part Every baby wants to eat
Extensible Dependency Grammar Introduction Model Theory Model Theory model theory: eliminative perspective (Rogers 1996): start with the set of all possible models 1 use well-formedness conditions to eliminate all 2 non-well-formed models s j u b vinf part det b j Every baby wants to eat u s vinf det part Every baby wants to eat u s b j vinf det part Every baby wants to eat u s j b vinf det part Every baby wants to eat u b j vinf s det part j s u b vinf det part Every baby wants to eat b u s j vinf Every baby wants to eat part det u s b j vinf Every baby wants to eat det part Every baby wants to eat b s u j vinf det part u b s j vinf part u j b vinf det s Every baby wants to eat det part Every baby wants to eat Every baby wants to eat u s j b vinf det part b s u j vinf Every baby wants to eat det part j u b vinf s Every baby wants to eat det part Every baby wants to eat u j b vinf s det part s j b u vinf Every baby wants to eat det part Every baby wants to eat
Extensible Dependency Grammar Introduction Model Theory Model Theory model theory: eliminative perspective (Rogers 1996): start with the set of all possible models 1 use well-formedness conditions to eliminate all 2 non-well-formed models s u b j vinf part det Every baby wants to eat s u b j vinf det part Every baby wants to eat s u b j vinf det part Every baby wants to eat u b j vinf s det part j u s b vinf det part Every baby wants to eat u s b j vinf Every baby wants to eat part det s u j b vinf Every baby wants to eat det part Every baby wants to eat b s u j vinf part u j b vinf det s det part Every baby wants to eat Every baby wants to eat s u b j vinf det part s b u j vinf Every baby wants to eat det part Every baby wants to eat u b j vinf s det part s j b u vinf Every baby wants to eat det part Every baby wants to eat
Extensible Dependency Grammar Introduction Model Theory Model Theory model theory: eliminative perspective (Rogers 1996): start with the set of all possible models 1 use well-formedness conditions to eliminate all 2 non-well-formed models s j b u vinf part det Every baby wants to eat u s b j vinf det part Every baby wants to eat s u j b vinf det part Every baby wants to eat u b j vinf s det part j u s b vinf det part Every baby wants to eat b u s j vinf Every baby wants to eat part det Every baby wants to eat b s u j vinf part u j b vinf det s det part Every baby wants to eat Every baby wants to eat s b u j vinf det part Every baby wants to eat s j b u vinf det part Every baby wants to eat
Extensible Dependency Grammar Introduction Model Theory Model Theory model theory: eliminative perspective (Rogers 1996): start with the set of all possible models 1 use well-formedness conditions to eliminate all 2 non-well-formed models s j b u vinf part det Every baby wants to eat u s b j vinf det part Every baby wants to eat u s j b vinf det part Every baby wants to eat j u s b vinf det part s b u j vinf Every baby wants to eat part det Every baby wants to eat u s b j vinf part det Every baby wants to eat s u b j vinf det part Every baby wants to eat
Extensible Dependency Grammar Introduction Model Theory Model Theory model theory: eliminative perspective (Rogers 1996): start with the set of all possible models 1 use well-formedness conditions to eliminate all 2 non-well-formed models s j b u vinf part det Every baby wants to eat b u s j vinf part det Every baby wants to eat s u b j vinf part det Every baby wants to eat s u b j vinf det part Every baby wants to eat
Extensible Dependency Grammar Introduction Model Theory Advantage declarativity: constraints describe the well-formed models independently of any underlying mechanisms
Extensible Dependency Grammar Introduction Parallel Architecture Parallel Architecture traditional: syntacto-centric architecture (Chomsky 1965): only syntax modeled independently other linguistic aspects obtained by functional interfaces Phonology interface syntactic well−formedness Syntax interface Semantics
Extensible Dependency Grammar Introduction Parallel Architecture Parallel Architecture parallel architecture (Jackendoff 2002), (Sadock 1991): all linguistic aspects modeled independently relational interfaces phonological well−formedness Phonology interface syntactic well−formedness Syntax interface interface semantic well−formedness Semantics
Extensible Dependency Grammar Introduction Parallel Architecture Advantages modularity: linguistic aspects can be modeled largely independently of each other emergence: complex phenomena emerge as the intersection of the linguistic aspects
Extensible Dependency Grammar Introduction Extensible Dependency Grammar (XDG) Extensible Dependency Grammar (XDG) combines: flexibility from dependency grammar 1 declarativity from model theory 2 modularity and emergence from the parallel architecture 3 models: dependency multigraphs, i.e. tuples of dependency graphs share the same set of nodes arbitrary many components called dimensions
Recommend
More recommend
