Constraint Grammar ESSLLI

Slides:



Advertisements
Similar presentations
Day 1 Punctuation and Capitalization
Advertisements

Day 1 Punctuation and Capitalization
 Christel Kemke 2007/08 COMP 4060 Natural Language Processing Feature Structures and Unification.
Augmented Transition Networks
Lexical Functional Grammar History: –Joan Bresnan (linguist, MIT and Stanford) –Ron Kaplan (computational psycholinguist, Xerox PARC) –Around 1978.
Grammatical Relations and Lexical Functional Grammar Grammar Formalisms Spring Term 2004.
For Monday Read Chapter 23, sections 3-4 Homework –Chapter 23, exercises 1, 6, 14, 19 –Do them in order. Do NOT read ahead.
Natural Language Processing - Feature Structures - Feature Structures and Unification.
Matakuliah: G0922/Introduction to Linguistics Tahun: 2008 Session 11 Syntax 2.
 Christel Kemke 2007/08 COMP 4060 Natural Language Processing Feature Structures and Unification.
Features and Unification
CS 4705 Lecture 11 Feature Structures and Unification Parsing.
March 1, 2009 Dr. Muhammed Al-Mulhem 1 ICS 482 Natural Language Processing INTRODUCTION Muhammed Al-Mulhem March 1, 2009.
Artificial Intelligence Research Centre Program Systems Institute Russian Academy of Science Pereslavl-Zalessky Russia.
11 CS 388: Natural Language Processing: Syntactic Parsing Raymond J. Mooney University of Texas at Austin.
Chapter 4 Syntax Part II.
Empirical Methods in Information Extraction Claire Cardie Appeared in AI Magazine, 18:4, Summarized by Seong-Bae Park.
Processing of large document collections Part 10 (Information extraction: multilingual IE, IE from web, IE from semi-structured data) Helena Ahonen-Myka.
1.Syntax: the rules of sentence formation; the component of the mental grammar that represent speakers’ knowledge of the structure of phrase and sentence.
For Friday Finish chapter 23 Homework: –Chapter 22, exercise 9.
Parsing Estonian with Constraint Grammar Kaili Müürisep Institute of Cybernetics at Tallinn Technical University.
Ideas for 100K Word Data Set for Human and Machine Learning Lori Levin Alon Lavie Jaime Carbonell Language Technologies Institute Carnegie Mellon University.
Applying Constraint Grammar to Tibetan NLP Edward Garrett & Nathan Hill Project website:
Artificial Intelligence: Natural Language
PARSING 2 David Kauchak CS159 – Spring 2011 some slides adapted from Ray Mooney.
For Monday Read chapter 24, sections 1-3 Homework: –Chapter 23, exercise 8.
For Friday Finish chapter 24 No written homework.
For Monday Read chapter 26 Last Homework –Chapter 23, exercise 7.
Auckland 2012Kilgarriff: NLP and Corpus Processing1 The contribution of NLP: corpus processing.
For Friday Finish chapter 23 Homework –Chapter 23, exercise 15.
Human Language Technology Part of Speech (POS) Tagging II Rule-based Tagging.
◦ Process of describing the structure of phrases and sentences Chapter 8 - Phrases and sentences: grammar1.
AUTONOMOUS REQUIREMENTS SPECIFICATION PROCESSING USING NATURAL LANGUAGE PROCESSING - Vivek Punjabi.
Natural Language Processing Group Computer Sc. & Engg. Department JADAVPUR UNIVERSITY KOLKATA – , INDIA. Professor Sivaji Bandyopadhyay
3.3 A More Detailed Look At Transformations Inversion (revised): Move Infl to C. Do Insertion: Insert interrogative do into an empty.
October 10, 2003BLTS Kickoff Meeting1 Transfer with Strong Decoding Learning Module Transfer Rules {PP,4894} ;;Score: PP::PP [NP POSTP] -> [PREP.
For Monday Read chapter 26 Homework: –Chapter 23, exercises 8 and 9.
Word classes and part of speech tagging Chapter 5.
Constraint Grammar ESSLLI
A Dependency Constraint Grammar for Esperanto Eckhard Bick University of Southern Denmark / GrammarSoft.
Constraint Grammar ESSLLI Tuesday: Lexicon, PoS, Morphology.
DeepDict A Graphical Corpus-based Dictionary of Word Relations Eckhard Bick University of Southern Denmark & GrammarSoft ApS.
Constraint Grammar ESSLLI Thursday: Dependency. CG Input ➢ remember CG is modular! output from one module becomes input to the next module pre- process.
A Bare-bones Constraint Grammar
Generate text from CG (p.3)
On how to write rules in Constraint Grammar (CG-3)
Beginning Syntax Linda Thomas
Lecture – VIII Monojit Choudhury RS, CSE, IIT Kharagpur
Basic Parsing with Context Free Grammars Chapter 13
Jason Ji Computer Systems Laboratory
Descriptive Grammar – 2S, 2016 Mrs. Belén Berríos Droguett
SYNTAX.
Day 1: Punctuation & Capitalization
Chapter Eight Syntax.
DGP: Daily Grammar Practice
Day 1: Punctuation & Capitalization
Translation Problems.
Universal Dependencies
Initial Considerations
CS 388: Natural Language Processing: Syntactic Parsing
Writing Analytics Clayton Clemens Vive Kumar.
The Difference Between Revision and Editing
Natural Language - General
Parsing and More Parsing
The CoNLL-2014 Shared Task on Grammatical Error Correction
CSA2050 Introduction to Computational Linguistics
Day 1 Punctuation and Capitalization
Semantics Going beyond syntax.
Day 1: Punctuation & Capitalization
David Kauchak CS159 – Spring 2019
Presentation transcript:

Constraint Grammar ESSLLI Friday: What you can do with Constraint Grammar

CG Input remember CG is modular! output from one module becomes input to the next module pre- processor analyzer nomorph CG your CG text output cat file | preprocessor | analyzer | vislcg3 -g engcg.nomorph.cg | vislcg3 -g yourcgfile ... echo ”text” | preprocessor | analyzer | vislcg3 -g engcg.nomorph.cg | vislcg3 -g yourcgfile ...

CG Applications Corpus enrichment adding ”searchables”, i.e. markup of implicit information for explicit searches definite/indefinite noun phrases complex tenses, aspect secondary nexus relations ###### definite np ### LIST DEF-EDGE = "the" ("each" DET) ("every" DET) ("all" DET) GEN <poss> (<dem> DET) NUM ; # SUBSTITUTE (N) (<def> N) TARGET (N NOM) (*-1 DEF-EDGE BARRIER NON-PRE-N/ADV) ; SUBSTITUTE (N) (<def> N) TARGET (N NOM) (c DEF-EDGE) ; ###### complex tense ### SUBSTITUTE (V) (<fut> V) TARGET (INF @ICL-AUX<) (p VV LINK 0 ("will") OR ("shall")) ;

CG Applications Text markup for Information Extraction / Retrieval Named Entity Recognition (NER) for news feed filtering Time & Place contextualisation of events Sentiment marking Sect members won political control of the nearby community of Antelope, renaming it City of Rajneesh, and attempted to control voting in Wasco County by busing thousands of homeless people to the commune in 1984. ADD (%LOC) TARGET (<Proper> @P<) (*-1 PRP LINK 0 ("in") LINK 0 (@<ADVL) OR (@ADL>)) ; # Place: in ADD (%LOC-TMP) TARGET (NUM @P<) (-1 ("in" PRP)) ; # time: in 1998

CG Applications Anaphora / referent resolution pronoun resolution for Machine Translation (MT) reflexive vs. non-reflexive NP anaphora: synonyms, variation (matching of semantic class) syntactic links: appositions etc.: @N<PRED, @APP, @FS- N< The Mediterraneans occupy the center of the stage. Alexander Militarev suggests that their homeland was in the Levant. Specifically, he identifies them with the Natufian culture. SETRELATION (ref) TARGET ("he") (0 (NOM) OR (ACC)) TO (**-1WA (@SUBJ>) + N-HUM LINK 0 (S) LINK NOT 0 <fem> LINK NEGATE *1 @FS-<FUNC BARRIER VFIN OR (@SUBJ>)) ;

CG Applications Grammar checking (ORDRET: Danish, LingvoHelpilo: Esperanto) better ordering of spelling correction alternatives, using contextual tests can be done by running an existing CG disambiguator grammar on the output of a spellchecker mapping of grammatical error types agreement errors, even long-distance (subject complements, relative clauses verb chain inflexion erros reordering of constituents (untried!) rules can be named --> pedagogical comments on error types I think he definitely prefer another day. ADD (§3S) TARGET (V -3S) OR (INF) OR (IMP) (*-1C (S NOM) OR (3S NOM) BARRIER NON-ADV LINK *-1 VV OR CLB OR >>> BARRIER (KC) LINK NOT 0 (<xt>)) ;

CG Applications Machine Translation (MT) Indirect: e.g. add person / number on English verbs for translations into Romance og Slavic language They shared a common vision. The board member shared a common vision. He and Peter shared a common vision. LIST PN = 1S 2S 3S 1P 2P 3P ; SUBSTITUTE (-3S) $$PN TARGET VFIN (c (@SUBJ>) LINK cS $$PN) ; # unification generalisation SUBSTITUTE (IMPF) (IMPF) + $$PN TARGET VFIN (c (@SUBJ>) LINK cS $$PN) ; # unificationgeneralisation

CG Applications Machine Translation (MT) Direct mapping translations handling polysemy or usage distinctions The new board members shared a common vision - promising that share holders would get their share of the year's earnings ADD (§DE-TRANSLATION:Aktien-) TARGET ("share" N NOM @>N) ; # share holder, share price or with dep-relations: ADD (§TRANSLATION:Aktien-) TARGET ("share" N NOM) (p N) ; ADD (§DE-TRANSLATION:Anteil) TARGET ("share" N S) (-1 (<poss>)) ; # get one's share

CG Applications Machine Translation (MT) Reordering: moving dependency tree sections SVO --> SOV ADJ N --> N ADJ SUB, S, ADV, V -> SUB, S, V, ADV The new board members shared a common vision MOVE WITHCHILD (*) TARGET (@<ACC) BEFORE NOCHILD (p &MV) ; The new board members a common vision shared

eckhard.bick@mail.dk tino@didriksen.cc trond.trosterud@uit.no