C SC 620 Advanced Topics in Natural Language Processing Lecture 20 4/8.

Slides:



Advertisements
Similar presentations
CS Morphological Parsing CS Parsing Taking a surface input and analyzing its components and underlying structure Morphological parsing:
Advertisements

Natural Language Understanding Difficulties: Large amount of human knowledge assumed – Context is key. Language is pattern-based. Patterns can restrict.
Proceedings of the Conference on Intelligent Text Processing and Computational Linguistics (CICLing-2007) Learning for Semantic Parsing Advisor: Hsin-His.
May 2006CLINT-LN Parsing1 Computational Linguistics Introduction Approaches to Parsing.
For Friday No reading Homework –Chapter 23, exercises 1, 13, 14, 19 –Not as bad as it sounds –Do them IN ORDER – do not read ahead here.
CS 355 – Programming Languages
C SC 620 Advanced Topics in Natural Language Processing Lecture 22 4/15.
Machine Translation (Level 2) Anna Sågvall Hein GSLT Course, September 2004.
The Query Compiler Varun Sud ID: 104. Agenda Parsing  Syntax analysis and Parse Trees.  Grammar for a simple subset of SQL  Base Syntactic Categories.
Machine Translation Anna Sågvall Hein Mösg F
C SC 620 Advanced Topics in Natural Language Processing Lecture 21 4/13.
C SC 620 Advanced Topics in Natural Language Processing Lecture 23 4/20.
C SC 620 Advanced Topics in Natural Language Processing Lecture 19 4/6.
Machine Translation Prof. Alexandros Potamianos Dept. of Electrical & Computer Engineering Technical University of Crete, Greece May 2003.
C SC 620 Advanced Topics in Natural Language Processing Lecture 24 4/22.
Semi-Automatic Learning of Transfer Rules for Machine Translation of Low-Density Languages Katharina Probst April 5, 2002.
C SC 620 Advanced Topics in Natural Language Processing 3/9 Lecture 14.
C SC 620 Advanced Topics in Natural Language Processing Lecture 10 2/19.
C SC 620 Advanced Topics in Natural Language Processing Lecture 17 3/25.
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.
Lecture 1, 7/21/2005Natural Language Processing1 CS60057 Speech &Natural Language Processing Autumn 2005 Lecture 1 21 July 2005.
9/8/20151 Natural Language Processing Lecture Notes 1.
Applied Linguistics Overview of course’ Linguistics’
Lecture 12: 22/6/1435 Natural language processing Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
Week 9: resources for globalisation Finish spell checkers Machine Translation (MT) The ‘decoding’ paradigm Ambiguity Translation models Interlingua and.
Globalisation and machine translation Machine Translation (MT) The ‘decoding’ paradigm Ambiguity Translation models Interlingua and First Order Predicate.
Tree-adjoining grammar (TAG) is a grammar formalism defined by Aravind Joshi and introduced in Tree-adjoining grammars are somewhat similar to context-free.
© Copyright 2013 ABBYY NLP PLATFORM FOR EU-LINGUAL DIGITAL SINGLE MARKET Alexander Rylov LTi Summit 2013 Confidential.
Winter 2007SEG2101 Chapter 71 Chapter 7 Introduction to Languages and Compiler.
THE BIG PICTURE Basic Assumptions Linguistics is the empirical science that studies language (or linguistic behavior) Linguistics proposes theories (models)
1 Knowledge Based Systems (CM0377) Lecture 4 (Last modified 5th February 2001)
November 2003CSA4050: Semantics I1 CSA4050: Advanced Topics in NLP Semantics I What is semantics for? Role of FOL Montague Approach.
Machine Translation  Machine translation is of one of the earliest uses of AI  Two approaches:  Traditional approach using grammars, rewrite rules,
An Intelligent Analyzer and Understander of English Yorick Wilks 1975, ACM.
ISBN Chapter 3 Describing Semantics -Attribute Grammars -Dynamic Semantics.
Approaches to Machine Translation CSC 5930 Machine Translation Fall 2012 Dr. Tom Way.
1 Montague Grammar and MT Chris Brew, The Ohio State University
1 CSI 5180: Topics in AI: Natural Language Processing, A Statistical Approach Instructor: Nathalie Japkowicz Objectives of.
October 2005CSA3180 NLP1 CSA3180 Natural Language Processing Introduction and Course Overview.
Albert Gatt LIN3021 Formal Semantics Lecture 4. In this lecture Compositionality in Natural Langauge revisited: The role of types The typed lambda calculus.
1 Chapter 1 Introduction. 2 Outlines 1.1 Overview and History 1.2 What Do Compilers Do? 1.3 The Structure of a Compiler 1.4 The Syntax and Semantics of.
Machine Translation (Level 2) Anna Sågvall Hein GSLT Course, January 2003.
3.2 Semantics. 2 Semantics Attribute Grammars The Meanings of Programs: Semantics Sebesta Chapter 3.
Programming Languages and Design Lecture 3 Semantic Specifications of Programming Languages Instructor: Li Ma Department of Computer Science Texas Southern.
Rules, Movement, Ambiguity
Artificial Intelligence: Natural Language
1 Context Free Grammars October Syntactic Grammaticality Doesn’t depend on Having heard the sentence before The sentence being true –I saw a unicorn.
For Monday Read chapter 26 Last Homework –Chapter 23, exercise 7.
The Minimalist Program
Auckland 2012Kilgarriff: NLP and Corpus Processing1 The contribution of NLP: corpus processing.
Natural Language Processing Chapter 1 : Introduction.
November 16, 2004 Lexicon (An Interacting Subsystem in UG) Part-II Rajat Kumar Mohanty IIT Bombay.
Jan 2005CSA4050 Machine Translation II1 CSA4050: Advanced Techniques in NLP Machine Translation II Direct MT Transfer MT Interlingual MT.
For Friday Finish chapter 23 Homework –Chapter 23, exercise 15.
CPSC 422, Lecture 27Slide 1 Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 27 Nov, 16, 2015.
SYNTAX.
Language Language - a system for combining symbols (such as words) so that an unlimited number of meaningful statements can be made for the purpose of.
1 An Introduction to Computational Linguistics Mohammad Bahrani.
For Monday Read chapter 26 Homework: –Chapter 23, exercises 8 and 9.
A Simple English-to-Punjabi Translation System By : Shailendra Singh.
2. The standards of textuality: cohesion Traditional approach to the study of lannguage: sentence as conventional object of study Structuralism (Bloofield,
LingWear Language Technology for the Information Warrior Alex Waibel, Lori Levin Alon Lavie, Robert Frederking Carnegie Mellon University.
Approaches to Machine Translation
Kenneth Baclawski et. al. PSB /11/7 Sa-Im Shin
Representation of Actions as an Interlingua
Statistical NLP: Lecture 13
Approaches to Machine Translation
Generative Transformation
Artificial Intelligence 2004 Speech & Natural Language Processing
Presentation transcript:

C SC 620 Advanced Topics in Natural Language Processing Lecture 20 4/8

Reading List Readings in Machine Translation, Eds. Nirenburg, S. et al. MIT Press –19. Montague Grammar and Machine Translation. Landsbergen, J. –20. Dialogue Translation vs. Text Translation – Interpretation Based Approach. Tsujii, J.-I. And M. Nagao –21. Translation by Structural Correspondences. Kaplan, R. et al. –22. Pros and Cons of the Pivot and Transfer Approaches in Multilingual Machine Translation. Boitet, C. –31. A Framework of a Mechanical Translation between Japanese and English by Analogy Principle. Nagao, M. –32. A Statistical Approach to Machine Translation. Brown, P. F. et al.

Translating is EU's new boom industry

Paper 19. Montague Grammar and Machine Translation. Landsbergen, J. Year is 1985 Montague Grammar –Meaning as Higher-Order Intentional Logic –Compositional Meaning of an expression is a function of the meaning of its parts –Close mapping between syntax and semantics –Possible-world semantics

Paper 19. Montague Grammar and Machine Translation. Landsbergen, J. The boys are sleeping ->  x (boy’(x) -> sleep’(x))

Paper 19. Montague Grammar and Machine Translation. Landsbergen, J. Montague Grammar and Computer Applications –Strong and weak points? –Attention given to semantics Sound semantic base is needed for determining what a correct answer or a correct translation is… –NLP Q&A –Machine Translation –Advantage over some other linguistic theories Exactness and constructiveness Syntax and semantics defined locally over phrase composition rules –cf. Grammar with several syntactic levels, where the semantics is defined at the deepest level

Paper 19. Montague Grammar and Machine Translation. Landsbergen, J. Montague Grammar and Computer Applications –Strong and weak points? (contd.) –Weak syntax Incidental property of Montague’s examples –Intentional logic and possible-world semantics too complex for practical use –Purely generative framework Syntax and semantics in parallel

Paper 19. Montague Grammar and Machine Translation. Landsbergen, J. M-grammars –Transformational power Consists of: –Syntactic component –Morphological component –Semantic component

Paper 19. Montague Grammar and Machine Translation. Landsbergen, J. Syntactic Component –S-tree –Nodes: category + attr/val pairs –Edges: syntactic relations

Paper 19. Montague Grammar and Machine Translation. Landsbergen, J. Rules must be bidirectional to serve as input to –M-Parser –M-Generator Termination of transformational rules guaranteed by measure condition –E.g. number of nodes in a tree must be decreasing Surface syntax condition –Covering grammar? –S-PARSER

Paper 19. Montague Grammar and Machine Translation. Landsbergen, J. Morphological Component –A-MORPH: words -> terminal S-trees –G-MORPH: terminal S-trees -> words

Paper 19. Montague Grammar and Machine Translation. Landsbergen, J. Montague Grammar and Machine Translation –“Possible Translation” System –Assumptions Linguistic theory can be clearly separated from the other aspects (extralinguistic information, robustness measures, etc.) Isolated sentences only F-PTR: source language (SL) sentence -> set of possible translations in the target language (TL) –s’ in F-PTR(s) s in F-PTR(s’) Explicit grammars for SL and TL Correctness-preserving property of F-PTR Common information content between source and target sentence

Paper 19. Montague Grammar and Machine Translation. Landsbergen, J. Attractive model but there are problems with Intentional Logic as an interlingua –Discrepancy between MG literature (detailed semantics for small fragment) vs. what is needed for MT (wide coverage, superficial semantics) –Doesn’t convey pragmatic and stylistic information –Subset problem

Paper 19. Montague Grammar and Machine Translation. Landsbergen, J. Subset problem Need transfer rules from IL 1 to IL 2

Paper 19. Montague Grammar and Machine Translation. Landsbergen, J. Take Intentional Logic out Or eliminate TL grammar by transfer of terms of the logical expression obtained from Syntactic Analysis

Paper 19. Montague Grammar and Machine Translation. Landsbergen, J. Isomorphic M-grammars –Each expression in one language must have (at least) one corresponding basic expression in the other language with the same meaning –Each syntactic rule in one language must have (at least) one corresponding syntactic rule in the other language with the same meaning operation –Two sentences are translations of each other if they are derived from corresponding basic expressions by application of corresponding rules

Paper 19. Montague Grammar and Machine Translation. Landsbergen, J. Isomorphic M-grammars

Paper 19. Montague Grammar and Machine Translation. Landsbergen, J. Interlingual system –But not universal