Harmonic Ascent  Getting better all the time Timestamp: Jul 25, 2005.

Slides:



Advertisements
Similar presentations
Optimality Theory (OT) Prepared and presented by: Abdullah Bosaad & Liú Chàng Spring 2011.
Advertisements

Multi-Layer Perceptron (MLP)
Optimality Theory Presented by Ashour Abdulaziz, Eric Dodson, Jessica Hanson, and Teresa Li.
By Anthony Campanaro & Dennis Hernandez
The ontological argument. I had the persuasion that there was absolutely nothing in the world, that there was no sky and no earth, neither minds nor.
SAT Based Abstraction/Refinement in Model-Checking Based on work by E. Clarke, A. Gupta, J. Kukula, O. Strichman (CAV’02)
1 Microeconomics Lecture 1 Institute of Economic Theories - University of Miskolc Mónika Kis-Orloczki Assistant lecturer
PROBLEM MANAGEMENT & SOLUTION FOCUSED THERAPY WEEK NINE.
Planning using Problem Analysis and The Theory of Change.
Chapter Seven: Utilitarianism
Copyright © Cengage Learning. All rights reserved. CHAPTER 1 SPEAKING MATHEMATICALLY SPEAKING MATHEMATICALLY.
Planning under Uncertainty
Evaluation of representations in AI problem solving Eugene Fink.
PRINCIPLE OF ECONOMICS
1 Introduction to Computability Theory Lecture15: Reductions Prof. Amos Israeli.
1. Introduction Consistency of learning processes To explain when a learning machine that minimizes empirical risk can achieve a small value of actual.
1 Introduction to Computability Theory Lecture12: Reductions Prof. Amos Israeli.
Social Choice Theory By Shiyan Li. History The theory of social choice and voting has had a long history in the social sciences, dating back to early.
January 24-25, 2003Workshop on Markedness and the Lexicon1 On the Priority of Markedness Paul Smolensky Cognitive Science Department Johns Hopkins University.
Belief Revision Lecture 1: AGM April 1, 2004 Gregory Wheeler
Thinking: A Key Process for effective learning “The best thing we can do, from the point of view of the brain and learning, is to teach our learners how.
Bell Work InOut Find the pattern and fill in the numbers then write the function rule. Function rule: y= x
Chapter 1 - The Nature of Economics
Decision Theory CHOICE (Social Choice) Professor : Dr. Liang Student : Kenwa Chu.
R. Paul’s Eight Elements of Thought / Paul’s Wheel of Reasoning
Random Process The concept of random variable was defined previously as mapping from the Sample Space S to the real line as shown below.
January 24-25, 2003Workshop on Markedness and the Lexicon1  Empirical Relevance Local conjunction has seen many empirical applications; here, vowel harmony.
Chapter 1 Introduction to Macroeconomics Copyright © 2012 Pearson Education Inc.
[kmpjuteynl] [fownldi]
Probability Lesson 1 Aims:
Harmonic Bounding  Alan Prince,Vieri Samek-Lodovici, Paul Smolensky.
What research is Noun: The systematic investigation into and study of materials and sources in order to establish facts and reach new conclusions. Verb:
Decision making Making decisions Optimal decisions Violations of rationality.
Economic Growth I CHAPTER 7.
Methodological introspection: how not to talk past one another When common sense knowledge is neither common nor sensible enough Or How five experts can.
Copyright © Cengage Learning. All rights reserved. CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF ELEMENTARY NUMBER THEORY AND METHODS OF PROOF.
1 Automatic Refinement and Vacuity Detection for Symbolic Trajectory Evaluation Orna Grumberg Technion Haifa, Israel Joint work with Rachel Tzoref.
Overview of Chapter The issues of evidence-based medicine reflect the question of how to apply clinical research literature: Why do disease and injury.
Introduction The berthing assignment problem requires that a detailed time-and-space-schedule be planned for incoming ships, with the goal of minimizing.
Models of Linguistic Choice Christopher Manning. 2 Explaining more: How do people choose to express things? What people do say has two parts: Contingent.
© 2007 Pearson Education Decision Making Supplement A.
Lecture 11 Page 1 CS 111 Online Virtual Memory A generalization of what demand paging allows A form of memory where the system provides a useful abstraction.
The phonology of Hakka zero- initials Raung-fu Chung Southern Taiwan University 2011, 05, 29, Cheng Da.
Theoretical Foundations of Clustering – CS497 Talk Shai Ben-David February 2007.
Program Structure  OT Constructs formal grammars directly from markedness principles Strongly universalist: inherent typology  OT allows completely formal.
Location Planning and Analysis Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent.
KANT ON THE SYNTHETIC A PRIORI
1 Chapter 4 Prof. Dr. Mohamed I. Migdad Professor in Economics 2015.
John D. McGregor Architecture Evaluation
Principles Rules or Constraints
Four Crescents What’s the area of the four yellow crescents?
Formal Verification. Background Information Formal verification methods based on theorem proving techniques and model­checking –To prove the absence of.
Intro to NLP - J. Eisner1 Phonology [These slides are missing most examples and discussion from class …]
Computational Learning Theory Part 1: Preliminaries 1.
1 Situation Comprehension and Emotion Bob Marinier University of Michigan June 2005.
Optimality Theory. Linguistic theory in the 1990s... and beyond!
Understanding Problem Solving. Next Generation Science/Common Core Standards Addressed! CCSS.Math.Content.8.EE.B.5 Graph proportional relationships, interpreting.
Some Slides from Art Costa on Effective Questioning Challenge yourself to make thinking skill requirements specific to your students.
1 LING 696B: Maximum-Entropy and Random Fields. 2 Review: two worlds Statistical model and OT seem to ask different questions about learning UG: what.
Consciousness & Causality Revision Lecture. Questions (open or closed?) Is there good evidence for learning while sleeping? Describe and discuss dualist.
Writing Learning Outcomes Best Practices. Do Now What is your process for writing learning objectives? How do you come up with the information?
Improving your Evaluation Skills in Economics. The Hierarchy of Skills KNOWLEDGE COMPREHENSION APPLICATION ANALYSIS EVALUATION SYNTHESIS.
1 Design and evaluation methods: Objectives n Design life cycle: HF input and neglect n Levels of system design: Going beyond the interface n Sources of.
The design cycle model and the design process.
Consumers, Producers, and the Efficiency of markets
Some(what) Grand Challenges for Information Retrieval
CS 9633 Machine Learning Concept Learning
Part I: Introduction to Business economics
Philosophy Sept 28th Objective Opener 10 minutes
Dr. Arslan Ornek MATHEMATICAL MODELS
Presentation transcript:

Harmonic Ascent  Getting better all the time Timestamp: Jul 25, 2005

2 Endowing CON with Structure Thus far, we have examined properties that inhere in any OT grammar, regardless of what constraints there are. This addresses the question ‘How do you DO it’ at the most basic level. To reach a minimal theory of generative phonology, to make OT into a linguistic theory, the first step was to impose the distinction between Markedness & Faithfulness. (Prince & Smolensky 1991 et seq.)

3 MF / OT Let the constraints in CON, the universal shared set, fall exhaustively into two disjoint classes. A candidate relates an Input to an Output. A Markedness constraint only evaluates the Output, regardless of the Input. A Faithfulness constraint evaluate the Input-Output relation along some dimension of structure –demanding that In = Out along this dimension.

4 Beyond Faithful Replication Faithful mapping: In=Out ‘nabbed’næb+d  næbd What does it take to beat the faithful candidate? –Moreton 2002, 2004 asks and answers this question. Fully Faithful  x  x  satisfies every F constraint. –Nothing can do better than that on the F’s. Nonfaithful  x  y  beats faithful  x  x  iff –The highest ranked constraint distinguishing them prefers  x  y 

5 Beyond Replication Faithful mapping: In=Out ‘nabbed’næb+d  næbd What does it take to beat the faithful candidate? –Moreton 2002, 2004 asks and answers this question. Fully Faithful  x  x  satisfies every F constraint. –Nothing can do better than that on the F’s. Nonfaithful  x  y  beats faithful  x  x  iff –The highest ranked constraint distinguishing them prefers  x  y 

6 Triumph of Markedness That decisive constraint must be a Markedness constraint. –Since every F is happy with the faithful candidate.

7 Triumph of Markedness That decisive constraint must be a Markedness constraint. –Since every F is happy with the faithful candidate. M:*Gem M:*Diff F:NoIns NoDev Action W: pæd+d  pædəd Ins L: pædd 1 W 0 0 L 0 faithful

8 Harmonic Ascent = Markedness Descent For a constraint hierarchy H, let H|M be the subhierarchy of Markedness constraints within it. If H:α  φ, for φ fully faithful, then H|M: α  φ –If things do not stay the same, they must get better. Analysis and results due to Moreton 2002, 2004.

9 Markedness Rating by H|M M: *Diff(voi)>>M:*Voi pt, bd (0) pt (0) bd (2) bt, pd (1)bt, pd (1) Let us consider the situation given this M subhierarchy Good Bad Constraints from Lombardi 1999  Note lexicographic refinement of classes

10 Markedness-Admissible Mappings pt bd bt pd NB: we assume M:*Diff >> M:*Voi Good Bad  Where you stop the ascent, and if you can, depends on H|F.

11 Utterly Impossible Mappings pt bd bt pd In any grammar with the assumed M subhierarchy Good Bad

12 Two Consequences of Harmonic Ascent [1] No Circular Shifts in MF/OT Shifts that happen –Western Basque (Kirchner 1995) a → ealaba+a → alabea e → iseme+e → semie –Catalan(Mascaró 1978, Wheeler 1979) nt → nkuntent → kunten n → Ø plan→ pla  Analyzed recently in Moreton & Smolensky 2002

13  [1] No Circular Shifts Harmonic Ascent –Any such shift must result in betterment vis-à-vis H|M. –The goodness order imposed on alternatives is Asymmetric:NOT[ a  b & b  a] Transitive: [a  b & b  c]  a  b Can’t have x → y or even▪ x → y y → z▪ y → x z → x Any such cycle would give: x  x (contradiction!)

14 Way Up ≠ Way Down z y x Good Bad

15 Shift Data Large numbers of noncircular shifts exist –Moreton & Smolensky collect 35 segmental cases 3 doubtful, 4 inferred: 28 robustly evidenced. A potential counterexample –Taiwanese/ Xiamen Tone Circle –See Yip 2002, Moreton 2002, and many others for discussion.

16 Coastal Taiwanese Tone Shifts Diagram from Feng-fan Hsieh,

17 Not the True Article? No basis in justifiable Markedness for shifts (Yip). “Paradigm Replacement” ? –Moreton Yip 1980, Chen Mortensen Hsieh Chen 2000.

18  [2] No Endless Shifts NO: x → y →z → … → ……

19  [2] No Endless Shifts NO: x → y →z → … → …… E.g: “Add one syllable to input”

20  [2] No Endless Shifts NO: x → y →z → … → …… E.g: “Add one syllable to input” Because constraints only penalize, there is an end to getting better.

21  [2] No Endless Shifts NO: x → y →z → … → …… E.g: “Add one syllable to input” Because constraints only penalize, there is an end to getting better.  This is certainly a correct result. — we can add one syllable to hit a fixed target (e.g. 2 sylls.) not merely to expand regardless of shape of outcome.

22 From Abstract Theory to Research Challenge The Harmonic Ascent property of MF/OT determines absolutely the structure of certain analyses. A chain shift likeH|M a  bb  a b  cc  b, therefore c  a. can only be obtained via Fac = F( * a  c) No M constraint can stop the headlong rush a  c. –Because we can’t have a  c on H|M.

23 What are these F of which we speak? Ergo, MF/OT + [reality of chain shifts] in data means: We must be able to define F that treat not just * nt  n Ø * a  e * n  Ø*e  i But also, and distinctly, the composed fell swoops * nt  Ø * a  i The anti-Fell-Swoop constraints are unviolated; while the step-wise F constraints are violated.

24 Some Thoughts on the Topic See such analysts as –Moreton & Smolensky 2002, ROA-525 –Gnanadesikan 1997, ROA-195 –Kirchner ROA-66 –Mortensen 2004, ROA-667 –Lubowicz ROA-554 –and undoubtedly others as well For a variety of inventive approaches.

25 Conclusions Local to Global. Design of the theory succeeds in taking property of atomic components (single M constraint) and propagating it to the aggregate judgment. Moreton’s abstract question about basic design leads directly to basic empirical predictions of the theory. And to a truly central research challenge, tied to realizing its basic predictions in empirical reality.