LEXICAL FUNCTIONAL GRAMMAR (LFG) Anca-Diana BIBIRI 1 st semester 2012-2013.

Slides:



Advertisements
Similar presentations
 Christel Kemke 2007/08 COMP 4060 Natural Language Processing Feature Structures and Unification.
Advertisements

Lexical Functional Grammar : Grammar Formalisms Spring Term 2004.
Lexical Functional Grammar History: –Joan Bresnan (linguist, MIT and Stanford) –Ron Kaplan (computational psycholinguist, Xerox PARC) –Around 1978.
Chapter 4 Syntax.
Grammar Development Platform Miriam Butt October 2002.
Introduction to LFG Kersti Börjars & Nigel Vincent {k.borjars, University of Manchester Winter school in LFG July University.
Grammatical Relations and Lexical Functional Grammar Grammar Formalisms Spring Term 2004.
Statistical NLP: Lecture 3
Chapter Chapter Summary Languages and Grammars Finite-State Machines with Output Finite-State Machines with No Output Language Recognition Turing.
LFG Slides based on slides by: Kersti Börjars & Nigel Vincent {k.borjars, University of Manchester Winter school in LFG July
Kakia Chatsiou GreekGram: Building a parallel grammar for Modern Greek LAC day GreekGram Building a parallel grammar for Modern Greek Kakia.
Kakia Chatsiou Modern Greek Grammar fragment Implementation using XLE FLATLANDS GreekGram Reporting on the progress of the implementation.
1 Words and the Lexicon September 10th 2009 Lecture #3.
Issues in Computational Linguistics: Parsing and Generation Dick Crouch and Tracy King.
Features and Unification
1 Kakia Chatsiou Department of Language and Linguistics University of Essex XLE Tutorial & Demo LG517. Introduction to LFG Introduction.
Models of Generative Grammar Smriti Singh. Generative Grammar  A Generative Grammar is a set of formal rules that can generate an infinite set of sentences.
1. Introduction Which rules to describe Form and Function Type versus Token 2 Discourse Grammar Appreciation.
Creation of a Russian-English Translation Program Karen Shiells.
Generative Grammar(Part ii)
Introduction to Cognitive Science Linguistics Component Syntax and Semantics Date: 19th October 2000 Lecturer: Dr Bodomo Department of Linguistics.
Three Generative grammars
Feature structures and unification Attributes and values.
Computational Linguistics INTroduction
Tree-adjoining grammar (TAG) is a grammar formalism defined by Aravind Joshi and introduced in Tree-adjoining grammars are somewhat similar to context-free.
Kakia Chatsiou A brief introduction to XLE LG617 - XLE Lab1 LG617 A brief introduction to XLE Kakia Chatsiou Dept of Language.
IV. SYNTAX. 1.1 What is syntax? Syntax is the study of how sentences are structured, or in other words, it tries to state what words can be combined with.
THE BIG PICTURE Basic Assumptions Linguistics is the empirical science that studies language (or linguistic behavior) Linguistics proposes theories (models)
SYNTAX Lecture -1 SMRITI SINGH.
1 Chapter 4 Syntax The sentence patterns of language Part I.
Postgraduate Diploma in Translation Lecture 1 Computers and Language.
Grammar Engineering: What is it good for? Miriam Butt (University of Konstanz) and Martin Forst (NetBase Solutions) Colombo 2014.
Kakia Chatsiou A brief introduction to XLE LG617 - XLE Lab1 LG617 A brief introduction to XLE Kakia Chatsiou Dept of Language.
A Cascaded Finite-State Parser for German Michael Schiehlen Institut für Maschinelle Sprachverarbeitung Universität Stuttgart
1 Introduction to Computational Linguistics Eleni Miltsakaki AUTH Fall 2005-Lecture 4.
Head-driven Phrase Structure Grammar (HPSG)
CSA2050 Introduction to Computational Linguistics Lecture 1 Overview.
Semantic Construction lecture 2. Semantic Construction Is there a systematic way of constructing semantic representation from a sentence of English? This.
CPE 480 Natural Language Processing Lecture 4: Syntax Adapted from Owen Rambow’s slides for CSc Fall 2006.
CSA2050 Introduction to Computational Linguistics Lecture 1 What is Computational Linguistics?
Introduction to Computational Linguistics (LIN3060) Lecture 1 Computers and Language.
Programming Languages and Design Lecture 3 Semantic Specifications of Programming Languages Instructor: Li Ma Department of Computer Science Texas Southern.
Rules, Movement, Ambiguity
1 Context Free Grammars October Syntactic Grammaticality Doesn’t depend on Having heard the sentence before The sentence being true –I saw a unicorn.
Section 11.3 Features structures in the Grammar ─ Jin Wang.
The Minimalist Program
October 25, : Grammars and Lexicons Lori Levin.
November 16, 2004 Lexicon (An Interacting Subsystem in UG) Part-II Rajat Kumar Mohanty IIT Bombay.
1 Syntax 1. 2 In your free time Look at the diagram again, and try to understand it. Phonetics Phonology Sounds of language Linguistics Grammar MorphologySyntax.
ACTL 2008 Syntax: Introduction to LFG Peter Austin, Linguistics Department, SOAS with thanks to Kersti Börjars & Nigel Vincent.
SYNTAX.
Levels of Linguistic Analysis
◦ Process of describing the structure of phrases and sentences Chapter 8 - Phrases and sentences: grammar1.
Lexical-Functional Grammar A Formal System for Grammatical Representation Kaplan and Bresnan, 1982 Erin Fitzgerald NLP Reading Group October 18, 2006.
Language and Cognition Colombo, June 2011 Day 2 Introduction to Linguistic Theory, Part 3.
MENTAL GRAMMAR Language and mind. First half of 20 th cent. – What the main goal of linguistics should be? Behaviorism – Bloomfield: goal of linguistics.
Chapter 3 Language Acquisition: A Linguistic Treatment Jang, HaYoung Biointelligence Laborotary Seoul National University.
SYNTAX.
King Faisal University جامعة الملك فيصل Deanship of E-Learning and Distance Education عمادة التعلم الإلكتروني والتعليم عن بعد [ ] 1 King Faisal University.
10/31/00 1 Introduction to Cognitive Science Linguistics Component Topic: Formal Grammars: Generating and Parsing Lecturer: Dr Bodomo.
An Introduction to the Government and Binding Theory
Lecture – VIII Monojit Choudhury RS, CSE, IIT Kharagpur
Statistical NLP: Lecture 3
BBI 3212 ENGLISH SYNTAX AND MORPHOLOGY
Introduction to Computational Linguistics
Levels of Linguistic Analysis
Traditional Grammar VS. Generative Grammar
Structure of a Lexicon Debasri Chakrabarti 13-May-19.
Presentation transcript:

LEXICAL FUNCTIONAL GRAMMAR (LFG) Anca-Diana BIBIRI 1 st semester

CONTENT:  Definition  Specific/different elements with/vs another grammars  Structure  Examples  Applications  Constraints  Mono-/multi-lingual implementations  Conclusions  Bibliography 2 Anca Bibiri

 Key words: constituent structure (c-structure) functional structure (f-structure) lexikon constituency grammar 3Anca Bibiri

 LFG is a formalism for representing the native speaker’s syntactic knowledge;  LFG is a grammar framework in theoretical linguistics, a variety of generative grammar;  It has been designed to serve as a medium for expressing and explaining important generalizations about the syntax of human languages and thus to serve as a vehicle for independent linguistic research;  It is a restricted, mathematically tractable notation for which simple, psychologically plausible processing mechanisms can be defined.  LFG was developed by Joan Bresnan and Roland Kaplan in the early 80s. 4 Anca Bibiri

 LFG is opposed to a dependency grammar (DGs);  The dependency relation views the (finite) verb as the structural center of all clause structure. All other syntactic units (e.g. words) are either directly or indirectly dependent on the verb;  DGs are distinct from phrase structure grammar since DGs lack phrasal nodes. Structure is determined by the relation between a word (a head) and its dependents. Dependency structures are flatter than constituency structures in part because they lack a finite verb phrase constituent and they are thus well suited for the analysis of languages with free word order (as Czech and Turkish). 5 Anca Bibiri

 Phrase structure rules as they are commonly employed result in a view of sentence structure that is constituency-based. Thus grammars that employ phrase structure rules are constituency grammar, as opposed to dependency grammars, which view sentence structure as dependency-based. What this means is that for phrase structure rules to be applicable at all, one has to pursue a constituency-based understanding of sentence structure. The constituency relation is a one-to-one- or-more correspondence. For every word in a sentence, there is at least one node in the syntactic structure that corresponds to that word. The dependency relation, in contrast, is a one-to- one relation; for every word in the sentence, there is exactly one node in the syntactic structure that corresponds to that word. 6 Anca Bibiri

 LFG views language as being made up of multiple dimensions of structure. Each of these dimensions is represented as a distinct structure with its own rules, concepts, and form.  LFG assigns 2 levels of syntactic description to every sentence of a language (primary structures):  constituent structure or ‘c-structure’ and  functional structure or ‘f-structure’. Both of them are related in terms of a functional projection, or correspondence function. 7 Anca Bibiri

There are other structures which are hypothesized in LFG work:  argument structure (a-structure) – a level which represents the number of arguments for a predicate and some aspects of the lexical semantics of these arguments;  semantic structure (s-structure) – a level which represents the meaning of phrases and sentences;  information structure (i-structure);  morphological structure (m-structure);  phonological structure (p-structure). 8 Anca Bibiri

 c-structure is a phrase structure configuration = a conventional phrase structure tree, a well-formed labeled bracketing that indicates the superficial arrangements of words and phrases in the sentence;  f-structure = provides a precise characterization of traditional syntactic notions as subject, ‘understood’ subject, object, complement and adjunct. The f-structure is a hierarchical attribute-value matrix that represents underlying grammatical relations. 9 Anca Bibiri

 An f-structure is a finite set of pairs of attributes and values. (is an abstract description of a sentence).  Attributes are features such as number, person, case etc., or name of grammatical functions, such as subject, object.  Values can be: simple symbols; semantic forms that govern the process of semantic interpretation; subsidiary f-structures, sets of ordered pairs representing complex of internal functions; another type it refers to a set of symbols, semantic forms or f- structures. 10 Anca Bibiri

 (1) Rules: S→NP VP NP → Det N VP → V NP NP  (2) Sentence: A girl handed the baby a toy.  (3) c-structure 11 Anca Bibiri

S NP VP Det N V NP NP Det NDet N A girl handed the baby a toy 12 Anca Bibiri

 SPECA ◦ SUBJNUMSG PRED ’girl’ ◦ TENSEPAST ◦ PRED‘hand ‹ (↑SUBJ), (↑OBJ), (↑OBJ2) › ’ SPECTHE ◦ OBJNUMSG PRED‘baby’ SPECA ◦ OBJ2NUMSG PRED‘toy’ 13 Anca Bibiri

14 Anca Bibiri

 A central goal in LFG research is to create a model of grammar with a depth which appeals to linguists while at the same time being efficiently parsable and having the rigidity of formalism which computational linguists require. Because of this, LFG has been used as the theoretical basis of various machine translations tools: AppTek’s TranSphere and the Julietta Research Group's Lekta. 15Anca Bibiri

 LFG is a unification and constraint based theory. There are different kinds of constraints.  For example, a functional annotation like (↑Attribute): Symbol-Value (e.g. (↑NR) = SG) assign a value to the number- feature of an f-structure. Sometimes we do not want to assign a value but to only verify that a feature has a certain value. A functional annotations of this kind establishes a constraint that has to be met by the final f-structure and reads: 'The feature has to have value V and it has to get to somewhere else for I do not assign it.’ 16 Anca Bibiri

 ParGram, a parallel grammar project involving Xerox PARC (English), XRCE (French), IMS Stuttgart (German), and University of Bergen (Norwegian). The basic goal of the ParGram project is to write large-scale LFG grammars with parallel analyses.  The basic idea behind parallel analysis is that, when linguistically justifiable, similar analyses are given to similar phenomena across languages. As such, a linguistically unjustified analysis is never forced on a language. However, if more than one analysis is possible, then the one that can be used in all the languages is chosen. 17 Anca Bibiri

 For example, the representation of tense in English, French, and German: Maria will see Hans./ Maria verra Hans./Maria wird Hans sehen.  Although the basic meaning of the three sentences in is identical, their morphosyntactic manifestation is different in all three languages: French uses just one word verra to represent the future tense; English and German use two: an auxiliary and a main verb. Difference – the auxiliary will is adjacent to the main verb see in English, whereas in German the auxiliary wird is in second position while the main verb sehen is in final position. 18 Anca Bibiri

 Along with the ParGram project, Xerox PARC has developed the XLE (Xerox Linguistic Environment) system, a platform for large-scale LFG grammar development.  XLE as a grammar development platform comes with an interface to finite-state transducers for tokenization and morphological analysis. 19 Anca Bibiri

 A cascade of tokenizers and normalizers segments the input string into tokens, which are then ‘looked up’ in finite-state morphological transducers. The integration of morphological analysis allows to automatically generate large LFG lexica for open class categories like nouns, adjectives, adverbs, etc. They are created by generic LFG lexicon entries which specify f- structure annotations for morphological and lexical information provided by the morphology. While each grammar comes with hand-coded core LFG lexica for closed class ‘syntactic’ lexical items, XLE supports integration and processing of large-size subcategorization lexica, which are extracted and converted from machine-readable dictionaries, or obtained by use of corpus analysis tools. Anca Bibiri20

 LFG is particularly well suited for high-level syntactic analysis in multilingual NLP tasks (as Machine Translation).  The formal mode of external structure in LFG, the c- structure varies across languages;  Internal structures, the f-structure, are largely invariant across languages.  Output: tree – c-structure avm (attribute-value matrix) – f-structure. 21Anca Bibiri

 Bresnan, Joan and Ronald M. Kaplan (1982). Introduction: grammars as mental representations of language. Cambridge, MA: The MIT Press  Bresnan, Joan (2001). Lexical Functional Syntax.Oxford: Blackwell.  Miriam Butt, Stefanie Dipper, Anette Frank, Tracy Holloway King (1999). Writing Large-Scale Parallel Grammars for English, French, and German. The University of Manchester. CSLI Publications.  Chomsky, Noam (1965). Aspects of the theory of syntax. Cambridge, MA: MIT Press.  Dalrymple, Mary (2001). Lexical Functional Grammar. No. 42 in Syntax and Semantics Series. New York: Academic Press.  Falk, Yehuda N. (2001). Lexical-Functional Grammar: An Introduction to Par  Ash Asudeh & Ida Toivonen (2009). Lexical-Functional Grammar in Bernd Heine and Heiko Narrog, eds., The Oxford Handbook of Linguistic Analysis. Oxford: Oxford University. 22Anca Bibiri

23 Thank you! Anca Bibiri