Lexicalized Tree Adjoining Grammar

Size: px
Start display at page:

Download "Lexicalized Tree Adjoining Grammar"

Transcription

1 Lexicalized Tree Adjoining Grammar Petr Horáček, Eva Zámečníková and Ivana Burgetová Department of Information ystems Faculty of Information Technology Brno University of Technology Božetěchova 2, Brno, CZ FRVŠ MŠMT FR97/2011/G1

2 Outline Introduction Lexicalized Tree Adjoining Grammar 2 / 53

3 Outline Introduction Tree Adjoining Grammar Lexicalized Tree Adjoining Grammar 3 / 53

4 Outline Introduction Tree Adjoining Grammar ome Important TAG Properties Lexicalized Tree Adjoining Grammar 4 / 53

5 Outline Introduction Tree Adjoining Grammar ome Important TAG Properties Lexicalized Tree Adjoining Grammar Lexicalized Tree Adjoining Grammar 5 / 53

6 Topic Introduction Tree Adjoining Grammar ome Important TAG Properties Lexicalized Tree Adjoining Grammar Lexicalized Tree Adjoining Grammar 6 / 53

7 Tree-Adjoining Grammars (TAG) Motivation Motivation is of linguistic and formal nature. Elementary objects are trees - structured objects and not strings. tructured objects are related with strong generative capacity. More relevant to linguistic description. TAG allow factoring recursion from the statement of linguistic dependencies Lexicalization of grammar formalism. Lexicalized Tree Adjoining Grammar 7 / 53

8 Tree-Adjoining Grammars (TAG) Motivation Motivation is of linguistic and formal nature. Elementary objects are trees - structured objects and not strings. tructured objects are related with strong generative capacity. More relevant to linguistic description. TAG allow factoring recursion from the statement of linguistic dependencies Lexicalization of grammar formalism. TAG is tree-generating system the set of trees constitute the object language One well known normal form of grammars - Greibach Normal Form (GNF) is a kind of lexicalization. Lexicalized Tree Adjoining Grammar 8 / 53

9 Topic Introduction Tree Adjoining Grammar ome Important TAG Properties Lexicalized Tree Adjoining Grammar Lexicalized Tree Adjoining Grammar 9 / 53

10 Tree-Adjointing Grammars (TAG) Definition Tree Adjoining Grammar (TAG) is a quintuple (T, N, I, A, ). T... a finite set of terminal symbols N... a finite set of nonterminal symbols; T N = I... a finite set of initial trees An initial tree is a phrase structure tree A... a finite set of auxiliary trees An auxiliary tree is a phrase structure tree that has a leaf nonterminal node that is the same as its root symbol... start symbol, N Lexicalized Tree Adjoining Grammar 10 / 53

11 Tree-Adjointing Grammars (TAG) Definition Tree Adjoining Grammar (TAG) is a quintuple (T, N, I, A, ). T... a finite set of terminal symbols N... a finite set of nonterminal symbols; T N = I... a finite set of initial trees An initial tree is a phrase structure tree A... a finite set of auxiliary trees An auxiliary tree is a phrase structure tree that has a leaf nonterminal node that is the same as its root symbol... start symbol, N Trees in I and A are called elementary trees. Lexicalized Tree Adjoining Grammar 11 / 53

12 Tree-Adjointing Grammars (TAG) Definition Tree Adjoining Grammar (TAG) is a quintuple (T, N, I, A, ). T... a finite set of terminal symbols N... a finite set of nonterminal symbols; T N = I... a finite set of initial trees An initial tree is a phrase structure tree A... a finite set of auxiliary trees An auxiliary tree is a phrase structure tree that has a leaf nonterminal node that is the same as its root symbol... start symbol, N Trees in I and A are called elementary trees. Parsing is done by two operations: substitution and adjunction. Lexicalized Tree Adjoining Grammar 12 / 53

13 Tree-Adjointing grammars: Example An example of an initial and an auxiliary tree Example initial tree auxiliary tree V V likes knows A nonterminal symbol marked by * is the foot node of an auxiliary tree. A nonterminal symbol marked by is a nonterminal node for substitution. Lexicalized Tree Adjoining Grammar 13 / 53

14 ubstitution ubstitution of an initial tree T 1 into a tree T 2 is to replace a substitution node in T 2 with T 1. Lexicalized Tree Adjoining Grammar 14 / 53

15 ubstitution ubstitution of an initial tree T 1 into a tree T 2 is to replace a substitution node in T 2 with T 1. Example V John V John likes likes T 1 T 2 Lexicalized Tree Adjoining Grammar 15 / 53

16 ubstitution ubstitution of an initial tree T 1 into a tree T 2 is to replace a substitution node in T 2 with T 1. Example V John V John likes likes T 1 T 2 Lexicalized Tree Adjoining Grammar 16 / 53

17 Adjunction (Adjoining) Adjoining an auxiliary tree T 1 into a tree T 2 is to inset T 1 into T 2 at the node that is the same as the root (and the foot) of T 1. Lexicalized Tree Adjoining Grammar 17 / 53

18 Adjunction (Adjoining) Adjoining an auxiliary tree T 1 into a tree T 2 is to inset T 1 into T 2 at the node that is the same as the root (and the foot) of T 1. Example PP John V walks PREP in John V PP PREP T 2 T 1 walks in T 1 is adjoined at in T 2 Lexicalized Tree Adjoining Grammar 18 / 53

19 Adjunction (Adjoining) Adjoining an auxiliary tree T 1 into a tree T 2 is to inset T 1 into T 2 at the node that is the same as the root (and the foot) of T 1. Example PP John V walks PREP in John V PP PREP T 2 T 1 walks in Lexicalized Tree Adjoining Grammar 19 / 53

20 Adjunction (Adjoining) Adjoining an auxiliary tree T 1 into a tree T 2 is to inset T 1 into T 2 at the node that is the same as the root (and the foot) of T 1. Example PP John V walks PREP in John V PP PREP T 2 T 1 walks in T 1 is adjoined at in T 2 Lexicalized Tree Adjoining Grammar 20 / 53

21 Adjunction (Adjoining) Any adjunction on a node marked for substitution is disallowed. Adjoining Constraints to have more precision for specifying which auxiliary trees can be adjoined at a given node. 1 elective Adjunction ( A(T)) - only members of a set T A of auxiliary trees can be adjoined on the given node, the adjunction of an auxiliary is not mandatory on the given node. 2 Null Adjunction (N A) - disallows any adjunction on the given node. 3 Obligatory Adjunction (O A(T)) - an auxiliary tree member of the set T A must be adjoined on the given node. These constraints on adjoining are needed for formal reasons in order to obtain some closure properties. Lexicalized Tree Adjoining Grammar 21 / 53

22 Derivation in TAG Ad yesterday D N V a man saw N Mary Lexicalized Tree Adjoining Grammar 22 / 53

23 Derivation in TAG Ad yesterday D N V a man saw N Mary This tree yields the sentence Yesterday a man saw Mary and is derived from the following elementary trees: Lexicalized Tree Adjoining Grammar 23 / 53

24 Derivation in TAG Ad yesterday D N V a man saw N Mary This tree yields the sentence Yesterday a man saw Mary and is derived from the following elementary trees: Ad yesterday Lexicalized Tree Adjoining Grammar 24 / 53

25 Derivation in TAG Ad yesterday D N V a man saw N Mary This tree yields the sentence Yesterday a man saw Mary and is derived from the following elementary trees: D Ad yesterday a Lexicalized Tree Adjoining Grammar 25 / 53

26 Derivation in TAG Ad yesterday D N V a man saw N Mary This tree yields the sentence Yesterday a man saw Mary and is derived from the following elementary trees: D Ad a D N yesterday man Lexicalized Tree Adjoining Grammar 26 / 53

27 Derivation in TAG Ad yesterday D N V a man saw N Mary This tree yields the sentence Yesterday a man saw Mary and is derived from the following elementary trees: D Ad a D N 0 yesterday man V 1 saw Lexicalized Tree Adjoining Grammar 27 / 53

28 Derivation in TAG Ad yesterday D N V a man saw N Mary This tree yields the sentence Yesterday a man saw Mary and is derived from the following elementary trees: D Ad a D N 0 N yesterday man V 1 Mary saw Lexicalized Tree Adjoining Grammar 28 / 53

29 Derivation in TAG β yest : α a : α man : α saw : α Mary : D Ad a D N 0 N yesterday man V 1 Mary saw Lexicalized Tree Adjoining Grammar 29 / 53

30 Derivation in TAG β yest : α a : α man : α saw : α Mary : D Ad a D N 0 N yesterday man V 1 Mary saw Derivation tree for Yesterday a man saw Mary. α saw α man α Mary β yest α a Lexicalized Tree Adjoining Grammar 30 / 53

31 Derivation in TAG β yest : α a : α man : α saw : α Mary : D Ad a D N 0 N yesterday man V 1 Mary saw Derivation tree for Yesterday a man saw Mary. α saw α man α Mary β yest α a The order in which the derivation tree is interpreted has no impact on the resulting derived tree. Lexicalized Tree Adjoining Grammar 31 / 53

32 Derivation in TAG Derived Tree A tree built by composition of two others trees. the derived tree does not give enough information to determine how it was constructed adjunction and substitution are considered in a TAG derivation Lexicalized Tree Adjoining Grammar 32 / 53

33 Derivation in TAG Derived Tree A tree built by composition of two others trees. the derived tree does not give enough information to determine how it was constructed adjunction and substitution are considered in a TAG derivation Derivation Tree It is an object that specifies uniquely how a derived tree was constructed. Lexicalized Tree Adjoining Grammar 33 / 53

34 Topic Introduction Tree Adjoining Grammar ome Important TAG Properties Lexicalized Tree Adjoining Grammar Lexicalized Tree Adjoining Grammar 34 / 53

35 Tree ets and tring Languages Tree et of a TAG T G Defined as the set of completed initial trees derived from some -rooted initial trees. T G = {t t is derived from some -rooted initial tree} Note that completed initial tree is an initial tree with no substitution nodes. Lexicalized Tree Adjoining Grammar 35 / 53

36 Tree ets and tring Languages Tree et of a TAG T G Defined as the set of completed initial trees derived from some -rooted initial trees. T G = {t t is derived from some -rooted initial tree} Note that completed initial tree is an initial tree with no substitution nodes. Tree tring language of a TAG L G Defined as the set of yields of all trees in the tree set. L G = {w w is the yield of some t in T G } Lexicalized Tree Adjoining Grammar 36 / 53

37 ome Properties of the Tree ets and tring Languages All closure properties of context-free languages (CFL) also hold for tree-adjoining languages (TAL). CFL TAL TAL can be parsed in polynomial time. Tree-adjoining grammars generate some context-sensitive languages. Lexicalized Tree Adjoining Grammar 37 / 53

38 ome Properties of the Tree ets and tring Languages: Example 1 Example Consider following TAG G 1 = ({a, e, b}, {}, {α 6 }, {β 2 }, ) α 6 : β 2 : NA e a NA b Lexicalized Tree Adjoining Grammar 38 / 53

39 ome Properties of the Tree ets and tring Languages: Example 1 Example Consider following TAG G 1 = ({a, e, b}, {}, {α 6 }, {β 2 }, ) α 6 : β 2 : NA e a NA b G 1 generates the language L 1 = {a n eb n n 1} Lexicalized Tree Adjoining Grammar 39 / 53

40 ome Properties of the Tree ets and tring Languages: Example 2 Example Consider following TAG G 1 = ({a, b, c, d, e}, {}, {α 6 }, {β 3 }, ) α 6 : β 3 : NA e a d b NA c Lexicalized Tree Adjoining Grammar 40 / 53

41 ome Properties of the Tree ets and tring Languages: Example 2 Example Consider following TAG G 1 = ({a, b, c, d, e}, {}, {α 6 }, {β 3 }, ) α 6 : β 3 : NA e a d b NA c G 1 generates the language L 1 = {a n b n ec n d n n 1} Lexicalized Tree Adjoining Grammar 41 / 53

42 ome Properties of the Tree ets and tring Languages: Example 2 Example ome derived trees of G 2 NA a d b NA e c Lexicalized Tree Adjoining Grammar 42 / 53

43 ome Properties of the Tree ets and tring Languages: Example 2 Example ome derived trees of G 2 NA NA a d b NA c a NA d e a d b NA c b NA e c Lexicalized Tree Adjoining Grammar 43 / 53

44 Topic Introduction Tree Adjoining Grammar ome Important TAG Properties Lexicalized Tree Adjoining Grammar Lexicalized Tree Adjoining Grammar 44 / 53

45 Lexicalized Grammars Lexicalized Grammar Each elementary structure is associate with a lexical item. The grammar consists of lexicon, where: each lexical item is associated with a finite number of structures and there are operations which tell how these structures are composed. Lexicalized Tree Adjoining Grammar 45 / 53

46 Lexicalized Tree Adjoining Grammar (LTAG) Definition A grammar is lexicalized if it consists of a finite set of structures each associated with a lexical item. Each lexical item is called the anchor of the corresponding structure. Grammar contains an operation or operations for composing the structure. LTAG is a TAG in which every elementary (initial and auxiliary) tree is anchored with a lexical item. Lexicalized Tree Adjoining Grammar 46 / 53

47 Lexicalized Tree Adjoining Grammar (LTAG) Definition A grammar is lexicalized if it consists of a finite set of structures each associated with a lexical item. Each lexical item is called the anchor of the corresponding structure. Grammar contains an operation or operations for composing the structure. LTAG is a TAG in which every elementary (initial and auxiliary) tree is anchored with a lexical item. Notes The anchor must be overt (= not empty string). The structures defined by the lexicon are called elementary structures. tructures built up by combination of others are called derived structures. Lexicalized Tree Adjoining Grammar 47 / 53

48 Lexicalized Tree Adjoining Grammar (LTAG) The definition of Lexicalized Grammar implies the following proposition: Proposition Lexicalized grammars are finitely ambiguous. Lexicalized Tree Adjoining Grammar 48 / 53

49 Lexicalized Tree Adjoining Grammar (LTAG) The definition of Lexicalized Grammar implies the following proposition: Proposition Lexicalized grammars are finitely ambiguous. Further, this closure property holds: Closure under lexicalization TAGs are closed under lexicalization. Lexicalized Tree Adjoining Grammar 49 / 53

50 Conclusion Notes Lexicalization of grammars is of linguistic and formal interest. Rules should not be separated from their lexical realization. By using TAGs we can lexicalize the CFGs. ubstitution and adjunction gives this possibility to lexicalize CFG. Lexicalized Tree Adjoining Grammar 50 / 53

51 References James Allen: Natural Language Understanding, The Benjamin/Cummings Publishing Company. Inc., 2005 Yuji Matsumoto: yntax and Parsing: Phrase tructure and Dependency Parsing Algorithms, LT, 2011 Yves chabes, Aravind K. Joshi: Tree-Adjoining Grammars and Lexicalized Grammars, 1991 Lexicalized Tree Adjoining Grammar 51 / 53

52 Thank you for your attention!

53 End

ž Lexicalized Tree Adjoining Grammar (LTAG) associates at least one elementary tree with every lexical item.

ž Lexicalized Tree Adjoining Grammar (LTAG) associates at least one elementary tree with every lexical item. Advanced Natural Language Processing Lecture 11 Grammar Formalisms (II): LTAG, CCG Bonnie Webber (slides by Mark teedman, Bonnie Webber and Frank Keller) 12 October 2012 Lexicalized Tree Adjoining Grammar

More information

Mildly Context Sensitive Grammar Formalisms

Mildly Context Sensitive Grammar Formalisms Mildly Context Sensitive Grammar Formalisms Petra Schmidt Pfarrer-Lauer-Strasse 23 66386 St. Ingbert petra.schmidt@edeka-suedwest.de Overview 3 Tree-djoining-Grammars 4 Co 7 8 9 CCG 9 LIG 10 TG 13 Linear

More information

Parsing Beyond Context-Free Grammars: Introduction

Parsing Beyond Context-Free Grammars: Introduction Parsing Beyond Context-Free Grammars: Introduction Laura Kallmeyer Heinrich-Heine-Universität Düsseldorf Sommersemester 2016 Parsing Beyond CFG 1 Introduction Overview 1. CFG and natural languages 2. Polynomial

More information

Pushdown automata. Informatics 2A: Lecture 9. Alex Simpson. 3 October, 2014. School of Informatics University of Edinburgh als@inf.ed.ac.

Pushdown automata. Informatics 2A: Lecture 9. Alex Simpson. 3 October, 2014. School of Informatics University of Edinburgh als@inf.ed.ac. Pushdown automata Informatics 2A: Lecture 9 Alex Simpson School of Informatics University of Edinburgh als@inf.ed.ac.uk 3 October, 2014 1 / 17 Recap of lecture 8 Context-free languages are defined by context-free

More information

Constraints in Phrase Structure Grammar

Constraints in Phrase Structure Grammar Constraints in Phrase Structure Grammar Phrase Structure Grammar no movement, no transformations, context-free rules X/Y = X is a category which dominates a missing category Y Let G be the set of basic

More information

Structurally ambiguous sentences

Structurally ambiguous sentences Language and Mind HONR 218L Recap: entences have structure In speaking and writing we string words together linearly (we have no choice) But in our minds, we represent sentences as hierarchical structures

More information

Tools and resources for Tree Adjoining Grammars

Tools and resources for Tree Adjoining Grammars Tools and resources for Tree Adjoining Grammars François Barthélemy, CEDRIC CNAM, 92 Rue St Martin FR-75141 Paris Cedex 03 barthe@cnam.fr Pierre Boullier, Philippe Deschamp Linda Kaouane, Abdelaziz Khajour

More information

Learning Translation Rules from Bilingual English Filipino Corpus

Learning Translation Rules from Bilingual English Filipino Corpus Proceedings of PACLIC 19, the 19 th Asia-Pacific Conference on Language, Information and Computation. Learning Translation s from Bilingual English Filipino Corpus Michelle Wendy Tan, Raymond Joseph Ang,

More information

Applying Co-Training Methods to Statistical Parsing. Anoop Sarkar http://www.cis.upenn.edu/ anoop/ anoop@linc.cis.upenn.edu

Applying Co-Training Methods to Statistical Parsing. Anoop Sarkar http://www.cis.upenn.edu/ anoop/ anoop@linc.cis.upenn.edu Applying Co-Training Methods to Statistical Parsing Anoop Sarkar http://www.cis.upenn.edu/ anoop/ anoop@linc.cis.upenn.edu 1 Statistical Parsing: the company s clinical trials of both its animal and human-based

More information

Phrase Structure Rules, Tree Rewriting, and other sources of Recursion Structure within the NP

Phrase Structure Rules, Tree Rewriting, and other sources of Recursion Structure within the NP Introduction to Transformational Grammar, LINGUIST 601 September 14, 2006 Phrase Structure Rules, Tree Rewriting, and other sources of Recursion Structure within the 1 Trees (1) a tree for the brown fox

More information

5HFDOO &RPSLOHU 6WUXFWXUH

5HFDOO &RPSLOHU 6WUXFWXUH 6FDQQLQJ 2XWOLQH 2. Scanning The basics Ad-hoc scanning FSM based techniques A Lexical Analysis tool - Lex (a scanner generator) 5HFDOO &RPSLOHU 6WUXFWXUH 6RXUFH &RGH /H[LFDO $QDO\VLV6FDQQLQJ 6\QWD[ $QDO\VLV3DUVLQJ

More information

Introduction. Compiler Design CSE 504. Overview. Programming problems are easier to solve in high-level languages

Introduction. Compiler Design CSE 504. Overview. Programming problems are easier to solve in high-level languages Introduction Compiler esign CSE 504 1 Overview 2 3 Phases of Translation ast modifled: Mon Jan 28 2013 at 17:19:57 EST Version: 1.5 23:45:54 2013/01/28 Compiled at 11:48 on 2015/01/28 Compiler esign Introduction

More information

Philadelphia University Faculty of Information Technology Department of Computer Science First Semester, 2007/2008.

Philadelphia University Faculty of Information Technology Department of Computer Science First Semester, 2007/2008. Philadelphia University Faculty of Information Technology Department of Computer Science First Semester, 2007/2008 Course Syllabus Course Title: Theory of Computation Course Level: 3 Lecture Time: Course

More information

SRM UNIVERSITY FACULTY OF ENGINEERING & TECHNOLOGY SCHOOL OF COMPUTING DEPARTMENT OF SOFTWARE ENGINEERING COURSE PLAN

SRM UNIVERSITY FACULTY OF ENGINEERING & TECHNOLOGY SCHOOL OF COMPUTING DEPARTMENT OF SOFTWARE ENGINEERING COURSE PLAN Course Code : CS0355 SRM UNIVERSITY FACULTY OF ENGINEERING & TECHNOLOGY SCHOOL OF COMPUTING DEPARTMENT OF SOFTWARE ENGINEERING COURSE PLAN Course Title : THEORY OF COMPUTATION Semester : VI Course : June

More information

Lempel-Ziv Coding Adaptive Dictionary Compression Algorithm

Lempel-Ziv Coding Adaptive Dictionary Compression Algorithm Lempel-Ziv Coding Adaptive Dictionary Compression Algorithm 1. LZ77:Sliding Window Lempel-Ziv Algorithm [gzip, pkzip] Encode a string by finding the longest match anywhere within a window of past symbols

More information

Basic Parsing Algorithms Chart Parsing

Basic Parsing Algorithms Chart Parsing Basic Parsing Algorithms Chart Parsing Seminar Recent Advances in Parsing Technology WS 2011/2012 Anna Schmidt Talk Outline Chart Parsing Basics Chart Parsing Algorithms Earley Algorithm CKY Algorithm

More information

The Adjunct Network Marketing Model

The Adjunct Network Marketing Model SMOOTHING A PBSMT MODEL BY FACTORING OUT ADJUNCTS MSc Thesis (Afstudeerscriptie) written by Sophie I. Arnoult (born April 3rd, 1976 in Suresnes, France) under the supervision of Dr Khalil Sima an, and

More information

Fast nondeterministic recognition of context-free languages using two queues

Fast nondeterministic recognition of context-free languages using two queues Fast nondeterministic recognition of context-free languages using two queues Burton Rosenberg University of Miami Abstract We show how to accept a context-free language nondeterministically in O( n log

More information

Introduction to Automata Theory. Reading: Chapter 1

Introduction to Automata Theory. Reading: Chapter 1 Introduction to Automata Theory Reading: Chapter 1 1 What is Automata Theory? Study of abstract computing devices, or machines Automaton = an abstract computing device Note: A device need not even be a

More information

Symbiosis of Evolutionary Techniques and Statistical Natural Language Processing

Symbiosis of Evolutionary Techniques and Statistical Natural Language Processing 1 Symbiosis of Evolutionary Techniques and Statistical Natural Language Processing Lourdes Araujo Dpto. Sistemas Informáticos y Programación, Univ. Complutense, Madrid 28040, SPAIN (email: lurdes@sip.ucm.es)

More information

Outline of today s lecture

Outline of today s lecture Outline of today s lecture Generative grammar Simple context free grammars Probabilistic CFGs Formalism power requirements Parsing Modelling syntactic structure of phrases and sentences. Why is it useful?

More information

Compiler I: Syntax Analysis Human Thought

Compiler I: Syntax Analysis Human Thought Course map Compiler I: Syntax Analysis Human Thought Abstract design Chapters 9, 12 H.L. Language & Operating Sys. Compiler Chapters 10-11 Virtual Machine Software hierarchy Translator Chapters 7-8 Assembly

More information

If-Then-Else Problem (a motivating example for LR grammars)

If-Then-Else Problem (a motivating example for LR grammars) If-Then-Else Problem (a motivating example for LR grammars) If x then y else z If a then if b then c else d this is analogous to a bracket notation when left brackets >= right brackets: [ [ ] ([ i ] j,

More information

Compiler Construction

Compiler Construction Compiler Construction Regular expressions Scanning Görel Hedin Reviderad 2013 01 23.a 2013 Compiler Construction 2013 F02-1 Compiler overview source code lexical analysis tokens intermediate code generation

More information

Lecture 9. Semantic Analysis Scoping and Symbol Table

Lecture 9. Semantic Analysis Scoping and Symbol Table Lecture 9. Semantic Analysis Scoping and Symbol Table Wei Le 2015.10 Outline Semantic analysis Scoping The Role of Symbol Table Implementing a Symbol Table Semantic Analysis Parser builds abstract syntax

More information

Approximating Context-Free Grammars for Parsing and Verification

Approximating Context-Free Grammars for Parsing and Verification Approximating Context-Free Grammars for Parsing and Verification Sylvain Schmitz LORIA, INRIA Nancy - Grand Est October 18, 2007 datatype a option = NONE SOME of a fun filter pred l = let fun filterp (x::r,

More information

Module Catalogue for the Bachelor Program in Computational Linguistics at the University of Heidelberg

Module Catalogue for the Bachelor Program in Computational Linguistics at the University of Heidelberg Module Catalogue for the Bachelor Program in Computational Linguistics at the University of Heidelberg March 1, 2007 The catalogue is organized into sections of (1) obligatory modules ( Basismodule ) that

More information

Formal Grammars and Languages

Formal Grammars and Languages Formal Grammars and Languages Tao Jiang Department of Computer Science McMaster University Hamilton, Ontario L8S 4K1, Canada Bala Ravikumar Department of Computer Science University of Rhode Island Kingston,

More information

Overview of E0222: Automata and Computability

Overview of E0222: Automata and Computability Overview of E0222: Automata and Computability Deepak D Souza Department of Computer Science and Automation Indian Institute of Science, Bangalore. August 3, 2011 What this course is about What we study

More information

Surface Realisation using Tree Adjoining Grammar. Application to Computer Aided Language Learning

Surface Realisation using Tree Adjoining Grammar. Application to Computer Aided Language Learning Surface Realisation using Tree Adjoining Grammar. Application to Computer Aided Language Learning Claire Gardent CNRS / LORIA, Nancy, France (Joint work with Eric Kow and Laura Perez-Beltrachini) March

More information

A Chart Parsing implementation in Answer Set Programming

A Chart Parsing implementation in Answer Set Programming A Chart Parsing implementation in Answer Set Programming Ismael Sandoval Cervantes Ingenieria en Sistemas Computacionales ITESM, Campus Guadalajara elcoraz@gmail.com Rogelio Dávila Pérez Departamento de

More information

Analysis of Algorithms I: Optimal Binary Search Trees

Analysis of Algorithms I: Optimal Binary Search Trees Analysis of Algorithms I: Optimal Binary Search Trees Xi Chen Columbia University Given a set of n keys K = {k 1,..., k n } in sorted order: k 1 < k 2 < < k n we wish to build an optimal binary search

More information

OBTAINING PRACTICAL VARIANTS OF LL (k) AND LR (k) FOR k >1. A Thesis. Submitted to the Faculty. Purdue University.

OBTAINING PRACTICAL VARIANTS OF LL (k) AND LR (k) FOR k >1. A Thesis. Submitted to the Faculty. Purdue University. OBTAINING PRACTICAL VARIANTS OF LL (k) AND LR (k) FOR k >1 BY SPLITTING THE ATOMIC k-tuple A Thesis Submitted to the Faculty of Purdue University by Terence John Parr In Partial Fulfillment of the Requirements

More information

Model 2.4 Faculty member + student

Model 2.4 Faculty member + student Model 2.4 Faculty member + student Course syllabus for Formal languages and Automata Theory. Faculty member information: Name of faculty member responsible for the course Office Hours Office Number Email

More information

Textual Modeling Languages

Textual Modeling Languages Textual Modeling Languages Slides 4-31 and 38-40 of this lecture are reused from the Model Engineering course at TU Vienna with the kind permission of Prof. Gerti Kappel (head of the Business Informatics

More information

Converting Finite Automata to Regular Expressions

Converting Finite Automata to Regular Expressions Converting Finite Automata to Regular Expressions Alexander Meduna, Lukáš Vrábel, and Petr Zemek Brno University of Technology, Faculty of Information Technology Božetěchova 1/2, 612 00 Brno, CZ http://www.fit.vutbr.cz/

More information

Semantic Mapping Between Natural Language Questions and SQL Queries via Syntactic Pairing

Semantic Mapping Between Natural Language Questions and SQL Queries via Syntactic Pairing Semantic Mapping Between Natural Language Questions and SQL Queries via Syntactic Pairing Alessandra Giordani and Alessandro Moschitti Department of Computer Science and Engineering University of Trento

More information

COMP 356 Programming Language Structures Notes for Chapter 4 of Concepts of Programming Languages Scanning and Parsing

COMP 356 Programming Language Structures Notes for Chapter 4 of Concepts of Programming Languages Scanning and Parsing COMP 356 Programming Language Structures Notes for Chapter 4 of Concepts of Programming Languages Scanning and Parsing The scanner (or lexical analyzer) of a compiler processes the source program, recognizing

More information

English Grammar Checker

English Grammar Checker International l Journal of Computer Sciences and Engineering Open Access Review Paper Volume-4, Issue-3 E-ISSN: 2347-2693 English Grammar Checker Pratik Ghosalkar 1*, Sarvesh Malagi 2, Vatsal Nagda 3,

More information

Automata and Computability. Solutions to Exercises

Automata and Computability. Solutions to Exercises Automata and Computability Solutions to Exercises Fall 25 Alexis Maciel Department of Computer Science Clarkson University Copyright c 25 Alexis Maciel ii Contents Preface vii Introduction 2 Finite Automata

More information

The Predicate-Argument Structure of Discourse Connectives A Corpus-based Study

The Predicate-Argument Structure of Discourse Connectives A Corpus-based Study A Corpus-based Study Cassandre Creswell, Katherine Forbes, Eleni Miltsakaki, Rashmi Prasad, Aravind Joshi, and Bonnie Webber University of Pennsylvania, University of Pittsburgh, and Edinburgh University

More information

ORAKEL: A Portable Natural Language Interface to Knowledge Bases

ORAKEL: A Portable Natural Language Interface to Knowledge Bases ORAKEL: A Portable Natural Language Interface to Knowledge Bases Philipp Cimiano, Peter Haase, Jörg Heizmann, Matthias Mantel March 1, 2007 Chapter 1 Introduction As the amount of information available

More information

Factoring Surface Syntactic Structures

Factoring Surface Syntactic Structures MTT 2003, Paris, 16 18 jui003 Factoring Surface Syntactic Structures Alexis Nasr LATTICE-CNRS (UMR 8094) Université Paris 7 alexis.nasr@linguist.jussieu.fr Mots-clefs Keywords Syntaxe de surface, représentation

More information

Context free grammars and predictive parsing

Context free grammars and predictive parsing Context free grammars and predictive parsing Programming Language Concepts and Implementation Fall 2012, Lecture 6 Context free grammars Next week: LR parsing Describing programming language syntax Ambiguities

More information

The Predicate-Argument Structure of Discourse Connectives: A Corpus-based Study 1 Introduction

The Predicate-Argument Structure of Discourse Connectives: A Corpus-based Study 1 Introduction The Predicate-Argument Structure of Discourse Connectives: A Corpus-based Study Cassandre Creswell 1, Katherine Forbes 2, Eleni Miltsakaki 1, Rashmi Prasad 1, Aravind Joshi 1 and Bonnie Webber 3 1 University

More information

CALICO Journal, Volume 9 Number 1 9

CALICO Journal, Volume 9 Number 1 9 PARSING, ERROR DIAGNOSTICS AND INSTRUCTION IN A FRENCH TUTOR GILLES LABRIE AND L.P.S. SINGH Abstract: This paper describes the strategy used in Miniprof, a program designed to provide "intelligent' instruction

More information

Ambiguity, closure properties, Overview of ambiguity, and Chomsky s standard form

Ambiguity, closure properties, Overview of ambiguity, and Chomsky s standard form Ambiguity, closure properties, and Chomsky s normal form Overview of ambiguity, and Chomsky s standard form The notion of ambiguity Convention: we assume that in every substitution, the leftmost remaining

More information

Outlook. Hungarian verbal complexes and the pre-verbal field: towards an MCTAG analysis. (L)TAG: Basics. Motivation fot (L)TAG

Outlook. Hungarian verbal complexes and the pre-verbal field: towards an MCTAG analysis. (L)TAG: Basics. Motivation fot (L)TAG Outlook Hungarian verbal complexes and the pre-verbal field: towards an MCTAG analysis Kata Balogh HHU Düsseldorf 16 th zklarska Poreba Workshop 20-23 February 2015 goal: Hungarian grammar using TAG +

More information

Turing Machines: An Introduction

Turing Machines: An Introduction CIT 596 Theory of Computation 1 We have seen several abstract models of computing devices: Deterministic Finite Automata, Nondeterministic Finite Automata, Nondeterministic Finite Automata with ɛ-transitions,

More information

CPS 140 - Mathematical Foundations of CS Dr. S. Rodger Section: Properties of Context-Free Languages èhandoutè Section 3.5 Which of the following languages are CFL? æ L=fa n b n c j j 0 énçjg æ L=fa n

More information

How To Understand A Sentence In A Syntactic Analysis

How To Understand A Sentence In A Syntactic Analysis AN AUGMENTED STATE TRANSITION NETWORK ANALYSIS PROCEDURE Daniel G. Bobrow Bolt, Beranek and Newman, Inc. Cambridge, Massachusetts Bruce Eraser Language Research Foundation Cambridge, Massachusetts Summary

More information

Transformational Generative Grammar for Various Types of Bengali Sentences

Transformational Generative Grammar for Various Types of Bengali Sentences UT tudies, Vol. 12, No. 1, 2010; P:99-105 Transformational Generative Grammar for Various Types of Bengali entences Mohammad Reza elim 1 and Muhammed Zafar Iqbal 1 1 Department of Computer cience and Engineering,

More information

CS143 Handout 08 Summer 2008 July 02, 2007 Bottom-Up Parsing

CS143 Handout 08 Summer 2008 July 02, 2007 Bottom-Up Parsing CS143 Handout 08 Summer 2008 July 02, 2007 Bottom-Up Parsing Handout written by Maggie Johnson and revised by Julie Zelenski. Bottom-up parsing As the name suggests, bottom-up parsing works in the opposite

More information

CGT 581 G Procedural Methods L systems

CGT 581 G Procedural Methods L systems CGT 581 G Procedural Methods L systems Bedrich Benes, Ph.D. Purdue University Department of Computer Graphics Technology L systems Lindenmayer systems Lindenmayer system or D0L systems [d zero l system]

More information

Syntax: Phrases. 1. The phrase

Syntax: Phrases. 1. The phrase Syntax: Phrases Sentences can be divided into phrases. A phrase is a group of words forming a unit and united around a head, the most important part of the phrase. The head can be a noun NP, a verb VP,

More information

POS Tagging 1. POS Tagging. Rule-based taggers Statistical taggers Hybrid approaches

POS Tagging 1. POS Tagging. Rule-based taggers Statistical taggers Hybrid approaches POS Tagging 1 POS Tagging Rule-based taggers Statistical taggers Hybrid approaches POS Tagging 1 POS Tagging 2 Words taken isolatedly are ambiguous regarding its POS Yo bajo con el hombre bajo a PP AQ

More information

Syntaktická analýza. Ján Šturc. Zima 208

Syntaktická analýza. Ján Šturc. Zima 208 Syntaktická analýza Ján Šturc Zima 208 Position of a Parser in the Compiler Model 2 The parser The task of the parser is to check syntax The syntax-directed translation stage in the compiler s front-end

More information

Structure of Clauses. March 9, 2004

Structure of Clauses. March 9, 2004 Structure of Clauses March 9, 2004 Preview Comments on HW 6 Schedule review session Finite and non-finite clauses Constituent structure of clauses Structure of Main Clauses Discuss HW #7 Course Evals Comments

More information

Scanning and parsing. Topics. Announcements Pick a partner by Monday Makeup lecture will be on Monday August 29th at 3pm

Scanning and parsing. Topics. Announcements Pick a partner by Monday Makeup lecture will be on Monday August 29th at 3pm Scanning and Parsing Announcements Pick a partner by Monday Makeup lecture will be on Monday August 29th at 3pm Today Outline of planned topics for course Overall structure of a compiler Lexical analysis

More information

Binary Search Trees (BST)

Binary Search Trees (BST) Binary Search Trees (BST) 1. Hierarchical data structure with a single reference to node 2. Each node has at most two child nodes (a left and a right child) 3. Nodes are organized by the Binary Search

More information

A first step towards modeling semistructured data in hybrid multimodal logic

A first step towards modeling semistructured data in hybrid multimodal logic A first step towards modeling semistructured data in hybrid multimodal logic Nicole Bidoit * Serenella Cerrito ** Virginie Thion * * LRI UMR CNRS 8623, Université Paris 11, Centre d Orsay. ** LaMI UMR

More information

Effective Self-Training for Parsing

Effective Self-Training for Parsing Effective Self-Training for Parsing David McClosky dmcc@cs.brown.edu Brown Laboratory for Linguistic Information Processing (BLLIP) Joint work with Eugene Charniak and Mark Johnson David McClosky - dmcc@cs.brown.edu

More information

Understanding English Grammar: A Linguistic Introduction

Understanding English Grammar: A Linguistic Introduction Understanding English Grammar: A Linguistic Introduction Additional Exercises for Chapter 8: Advanced concepts in English syntax 1. A "Toy Grammar" of English The following "phrase structure rules" define

More information

Noam Chomsky: Aspects of the Theory of Syntax notes

Noam Chomsky: Aspects of the Theory of Syntax notes Noam Chomsky: Aspects of the Theory of Syntax notes Julia Krysztofiak May 16, 2006 1 Methodological preliminaries 1.1 Generative grammars as theories of linguistic competence The study is concerned with

More information

Windows 7 Security Event Log Format

Windows 7 Security Event Log Format Windows 7 ecurity vent Log Format Todd Heberlein 23 ep 2010 Windows security event log provides a rich source of information to detect and analyze a wide range of threats against computer systems. Unfortunately

More information

A Knowledge-based System for Translating FOL Formulas into NL Sentences

A Knowledge-based System for Translating FOL Formulas into NL Sentences A Knowledge-based System for Translating FOL Formulas into NL Sentences Aikaterini Mpagouli, Ioannis Hatzilygeroudis University of Patras, School of Engineering Department of Computer Engineering & Informatics,

More information

Natural Language Database Interface for the Community Based Monitoring System *

Natural Language Database Interface for the Community Based Monitoring System * Natural Language Database Interface for the Community Based Monitoring System * Krissanne Kaye Garcia, Ma. Angelica Lumain, Jose Antonio Wong, Jhovee Gerard Yap, Charibeth Cheng De La Salle University

More information

Course: Model, Learning, and Inference: Lecture 5

Course: Model, Learning, and Inference: Lecture 5 Course: Model, Learning, and Inference: Lecture 5 Alan Yuille Department of Statistics, UCLA Los Angeles, CA 90095 yuille@stat.ucla.edu Abstract Probability distributions on structured representation.

More information

The International Journal of Digital Curation Volume 7, Issue 1 2012

The International Journal of Digital Curation Volume 7, Issue 1 2012 doi:10.2218/ijdc.v7i1.217 Grammar-Based Specification 95 Grammar-Based Specification and Parsing of Binary File Formats William Underwood, Principal Research Scientist, Georgia Tech Research Institute

More information

Lexical analysis FORMAL LANGUAGES AND COMPILERS. Floriano Scioscia. Formal Languages and Compilers A.Y. 2015/2016

Lexical analysis FORMAL LANGUAGES AND COMPILERS. Floriano Scioscia. Formal Languages and Compilers A.Y. 2015/2016 Master s Degree Course in Computer Engineering Formal Languages FORMAL LANGUAGES AND COMPILERS Lexical analysis Floriano Scioscia 1 Introductive terminological distinction Lexical string or lexeme = meaningful

More information

Unified Language for Network Security Policy Implementation

Unified Language for Network Security Policy Implementation Unified Language for Network Security Policy Implementation Dmitry Chernyavskiy Information Security Faculty National Research Nuclear University MEPhI Moscow, Russia milnat2004@yahoo.co.uk Natalia Miloslavskaya

More information

Learning Analysis by Reduction from Positive Data

Learning Analysis by Reduction from Positive Data Learning Analysis by Reduction from Positive Data František Mráz 1, Friedrich Otto 1, and Martin Plátek 2 1 Fachbereich Mathematik/Informatik, Universität Kassel 34109 Kassel, Germany {mraz,otto}@theory.informatik.uni-kassel.de

More information

VoiceXML-Based Dialogue Systems

VoiceXML-Based Dialogue Systems VoiceXML-Based Dialogue Systems Pavel Cenek Laboratory of Speech and Dialogue Faculty of Informatics Masaryk University Brno Agenda Dialogue system (DS) VoiceXML Frame-based DS in general 2 Computer based

More information

HECTOR a software model checker with cooperating analysis plugins. Nathaniel Charlton and Michael Huth Imperial College London

HECTOR a software model checker with cooperating analysis plugins. Nathaniel Charlton and Michael Huth Imperial College London HECTOR a software model checker with cooperating analysis plugins Nathaniel Charlton and Michael Huth Imperial College London Introduction HECTOR targets imperative heap-manipulating programs uses abstraction

More information

Teaching Formal Methods for Computational Linguistics at Uppsala University

Teaching Formal Methods for Computational Linguistics at Uppsala University Teaching Formal Methods for Computational Linguistics at Uppsala University Roussanka Loukanova Computational Linguistics Dept. of Linguistics and Philology, Uppsala University P.O. Box 635, 751 26 Uppsala,

More information

Natural Language Processing

Natural Language Processing Natural Language Processing : AI Course Lecture 41, notes, slides www.myreaders.info/, RC Chakraborty, e-mail rcchak@gmail.com, June 01, 2010 www.myreaders.info/html/artificial_intelligence.html www.myreaders.info

More information

Visualizing Data Structures in Parsing-based Machine Translation. Jonathan Weese, Chris Callison-Burch

Visualizing Data Structures in Parsing-based Machine Translation. Jonathan Weese, Chris Callison-Burch The Prague Bulletin of Mathematical Linguistics NUMBER 93 JANUARY 2010 127 136 Visualizing Data Structures in Parsing-based Machine Translation Jonathan Weese, Chris Callison-Burch Abstract As machine

More information

Natural Language to Relational Query by Using Parsing Compiler

Natural Language to Relational Query by Using Parsing Compiler Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 4, Issue. 3, March 2015,

More information

Semantic parsing with Structured SVM Ensemble Classification Models

Semantic parsing with Structured SVM Ensemble Classification Models Semantic parsing with Structured SVM Ensemble Classification Models Le-Minh Nguyen, Akira Shimazu, and Xuan-Hieu Phan Japan Advanced Institute of Science and Technology (JAIST) Asahidai 1-1, Nomi, Ishikawa,

More information

Regular Expressions with Nested Levels of Back Referencing Form a Hierarchy

Regular Expressions with Nested Levels of Back Referencing Form a Hierarchy Regular Expressions with Nested Levels of Back Referencing Form a Hierarchy Kim S. Larsen Odense University Abstract For many years, regular expressions with back referencing have been used in a variety

More information

NATURAL LANGUAGE QUERY PROCESSING USING PROBABILISTIC CONTEXT FREE GRAMMAR

NATURAL LANGUAGE QUERY PROCESSING USING PROBABILISTIC CONTEXT FREE GRAMMAR NATURAL LANGUAGE QUERY PROCESSING USING PROBABILISTIC CONTEXT FREE GRAMMAR Arati K. Deshpande 1 and Prakash. R. Devale 2 1 Student and 2 Professor & Head, Department of Information Technology, Bharati

More information

Regular Expressions and Automata using Haskell

Regular Expressions and Automata using Haskell Regular Expressions and Automata using Haskell Simon Thompson Computing Laboratory University of Kent at Canterbury January 2000 Contents 1 Introduction 2 2 Regular Expressions 2 3 Matching regular expressions

More information

Output: 12 18 30 72 90 87. struct treenode{ int data; struct treenode *left, *right; } struct treenode *tree_ptr;

Output: 12 18 30 72 90 87. struct treenode{ int data; struct treenode *left, *right; } struct treenode *tree_ptr; 50 20 70 10 30 69 90 14 35 68 85 98 16 22 60 34 (c) Execute the algorithm shown below using the tree shown above. Show the exact output produced by the algorithm. Assume that the initial call is: prob3(root)

More information

Syllabus of. BCA III (Bachelor of Computer Application) Semester-V

Syllabus of. BCA III (Bachelor of Computer Application) Semester-V Syllabus of BCA III (Bachelor of Computer Application) Semester-V Designed by Dr. S.B. Kishor GONDWANA UNIVERSITY, GADCHIROLI SESSION 2014-2015 SEM V BCA III Paper 1 Paper 2 Theory of Computational Analyzer

More information

Introduction. BM1 Advanced Natural Language Processing. Alexander Koller. 17 October 2014

Introduction. BM1 Advanced Natural Language Processing. Alexander Koller. 17 October 2014 Introduction! BM1 Advanced Natural Language Processing Alexander Koller! 17 October 2014 Outline What is computational linguistics? Topics of this course Organizational issues Siri Text prediction Facebook

More information

Scoping (Readings 7.1,7.4,7.6) Parameter passing methods (7.5) Building symbol tables (7.6)

Scoping (Readings 7.1,7.4,7.6) Parameter passing methods (7.5) Building symbol tables (7.6) Semantic Analysis Scoping (Readings 7.1,7.4,7.6) Static Dynamic Parameter passing methods (7.5) Building symbol tables (7.6) How to use them to find multiply-declared and undeclared variables Type checking

More information

Test Suite Generation

Test Suite Generation Test uite Generation ylvain chmitz LORIA, INRIA Nancy - Grand Est, Nancy, France NaTAL Workshop, Nancy, June 25, 2008 Issues with urface Generation *Jean que cherches-tu est grand. Jean qui baille s endort.

More information

International Journal of Scientific & Engineering Research, Volume 4, Issue 11, November-2013 5 ISSN 2229-5518

International Journal of Scientific & Engineering Research, Volume 4, Issue 11, November-2013 5 ISSN 2229-5518 International Journal of Scientific & Engineering Research, Volume 4, Issue 11, November-2013 5 INTELLIGENT MULTIDIMENSIONAL DATABASE INTERFACE Mona Gharib Mohamed Reda Zahraa E. Mohamed Faculty of Science,

More information

FIRST and FOLLOW sets a necessary preliminary to constructing the LL(1) parsing table

FIRST and FOLLOW sets a necessary preliminary to constructing the LL(1) parsing table FIRST and FOLLOW sets a necessary preliminary to constructing the LL(1) parsing table Remember: A predictive parser can only be built for an LL(1) grammar. A grammar is not LL(1) if it is: 1. Left recursive,

More information

Chapter 5 Parser Combinators

Chapter 5 Parser Combinators Part II Chapter 5 Parser Combinators 5.1 The type of parsers 5.2 Elementary parsers 5.3 Grammars 5.4 Parser combinators 5.5 Parser transformers 5.6 Matching parentheses 5.7 More parser combinators 5.8

More information

XML Data Integration

XML Data Integration XML Data Integration Lucja Kot Cornell University 11 November 2010 Lucja Kot (Cornell University) XML Data Integration 11 November 2010 1 / 42 Introduction Data Integration and Query Answering A data integration

More information

Dynamic Cognitive Modeling IV

Dynamic Cognitive Modeling IV Dynamic Cognitive Modeling IV CLS2010 - Computational Linguistics Summer Events University of Zadar 23.08.2010 27.08.2010 Department of German Language and Linguistics Humboldt Universität zu Berlin Overview

More information

Honors Class (Foundations of) Informatics. Tom Verhoeff. Department of Mathematics & Computer Science Software Engineering & Technology

Honors Class (Foundations of) Informatics. Tom Verhoeff. Department of Mathematics & Computer Science Software Engineering & Technology Honors Class (Foundations of) Informatics Tom Verhoeff Department of Mathematics & Computer Science Software Engineering & Technology www.win.tue.nl/~wstomv/edu/hci c 2011, T. Verhoeff @ TUE.NL 1/20 Information

More information

Rapid Prototyping of Application-oriented Natural Language Interfaces

Rapid Prototyping of Application-oriented Natural Language Interfaces Rapid Prototyping of Application-oriented Natural Language Interfaces Tamás Mészáros Department of Measurement and Information Systems, Budapest University of Technology and Economics, Magyar tudósok krt.

More information

The Role of Sentence Structure in Recognizing Textual Entailment

The Role of Sentence Structure in Recognizing Textual Entailment Blake,C. (In Press) The Role of Sentence Structure in Recognizing Textual Entailment. ACL-PASCAL Workshop on Textual Entailment and Paraphrasing, Prague, Czech Republic. The Role of Sentence Structure

More information

Learning Automata and Grammars

Learning Automata and Grammars WDS'11 Proceedings of Contributed Papers, Part I, 125 130, 2011. ISBN 978-80-7378-184-2 MATFYZPRESS Learning Automata and Grammars P. Černo Charles University, Faculty of Mathematics and Physics, Prague,

More information

Case-Factor Diagrams for Structured Probabilistic Modeling

Case-Factor Diagrams for Structured Probabilistic Modeling Case-Factor Diagrams for Structured Probabilistic Modeling David McAllester TTI at Chicago mcallester@tti-c.org Michael Collins CSAIL Massachusetts Institute of Technology mcollins@ai.mit.edu Fernando

More information

NATURAL LANGUAGE QUERY PROCESSING USING SEMANTIC GRAMMAR

NATURAL LANGUAGE QUERY PROCESSING USING SEMANTIC GRAMMAR NATURAL LANGUAGE QUERY PROCESSING USING SEMANTIC GRAMMAR 1 Gauri Rao, 2 Chanchal Agarwal, 3 Snehal Chaudhry, 4 Nikita Kulkarni,, 5 Dr. S.H. Patil 1 Lecturer department o f Computer Engineering BVUCOE,

More information

Genetic programming with regular expressions

Genetic programming with regular expressions Genetic programming with regular expressions Børge Svingen Chief Technology Officer, Open AdExchange bsvingen@openadex.com 2009-03-23 Pattern discovery Pattern discovery: Recognizing patterns that characterize

More information

DEPENDENCY PARSING JOAKIM NIVRE

DEPENDENCY PARSING JOAKIM NIVRE DEPENDENCY PARSING JOAKIM NIVRE Contents 1. Dependency Trees 1 2. Arc-Factored Models 3 3. Online Learning 3 4. Eisner s Algorithm 4 5. Spanning Tree Parsing 6 References 7 A dependency parser analyzes

More information