Computational and Evolutionary Aspects of Language Written by: Martin Nowak, Natalia Komarova, and Partha Niyogi Presentation by: Amerika Adams, Isaac.

Slides:



Advertisements
Similar presentations
CSE 202 – Formal Languages and Automata Theory 1 REGULAR LANGUAGE.
Advertisements

Theory of Computation What types of things are computable? How can we demonstrate what things are computable?
Genetic Algorithms1 COMP305. Part II. Genetic Algorithms.
Fall 2006Costas Busch - RPI1 Deterministic Finite Automata And Regular Languages.
This set of slides is provided by the author of the textbook1 Introductory Topics l Computer Programming l Programming Life-Cycle Phases l Creating an.
Lecture 3 Goals: Formal definition of NFA, acceptance of a string by an NFA, computation tree associated with a string. Algorithm to convert an NFA to.
CS5371 Theory of Computation Lecture 5: Automata Theory III (Non-regular Language, Pumping Lemma, Regular Expression)
PZ02A - Language translation
Grammars, Languages and Finite-state automata Languages are described by grammars We need an algorithm that takes as input grammar sentence And gives a.
1 Introduction to Automata Theory Reading: Chapter 1.
Introduction to ASMs Dumitru Roman Digital Enterprise Research Institute
Evolution of Universal Grammar Pia Göser Universität Tübingen Seminar: Sprachevolution Dozent: Prof. Jäger
CS/IT 138 THEORY OF COMPUTATION Chapter 1 Introduction to the Theory of Computation.
Introduction to Theory of Automata By: Wasim Ahmad Khan.
By: Er. Sukhwinder kaur.  What is Automata Theory? What is Automata Theory?  Alphabet and Strings Alphabet and Strings  Empty String Empty String 
Bi-Weekly BTP Meeting Bhargava Reddy
Introduction to CS Theory Lecture 3 – Regular Languages Piotr Faliszewski
Learning Automata and Grammars Peter Černo.  The problem of learning or inferring automata and grammars has been studied for decades and has connections.
1 Computability Five lectures. Slides available from my web page There is some formality, but it is gentle,
Copyright © Curt Hill Languages and Grammars This is not English Class. But there is a resemblance.
Programming Languages and Design Lecture 3 Semantic Specifications of Programming Languages Instructor: Li Ma Department of Computer Science Texas Southern.
1 Language translation Programming Language Design and Implementation (4th Edition) by T. Pratt and M. Zelkowitz Prentice Hall, 2001 Sections
1Computer Sciences Department. Book: INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION, by: MICHAEL SIPSER Reference 3Computer Sciences Department.
Grammars Hopcroft, Motawi, Ullman, Chap 5. Grammars Describes underlying rules (syntax) of programming languages Compilers (parsers) are based on such.
Grammars CS 130: Theory of Computation HMU textbook, Chap 5.
Finite Automata Chapter 1. Automatic Door Example Top View.
Formal Language. A formal language is defined by two components: -Alphabet -Rules of syntax.
Theory of computation Introduction theory of computation: It comprises the fundamental mathematical properties of computer hardware, software,
1 Course Overview Why this course “formal languages and automata theory?” What do computers really do? What are the practical benefits/application of formal.
1 Compiler Construction (CS-636) Muhammad Bilal Bashir UIIT, Rawalpindi.
C Sc 132 Computing Theory Professor Meiliu Lu Computer Science Department.
CSE 202 – Formal Languages and Automata Theory 1 REGULAR EXPRESSION.
Beyond Scenarios: Generating State Models from Use Cases An approach for the synthesis of State transition graphs from Use Cases Supporting Use Cases Based.
Week 14 - Friday.  What did we talk about last time?  Simplifying FSAs  Quotient automata.
Ch 2. The Probably Approximately Correct Model and the VC Theorem 2.3 The Computational Nature of Language Learning and Evolution, Partha Niyogi, 2004.
Lecture #2 Advanced Theory of Computation. Languages & Grammar Before discussing languages & grammar let us deal with some related issues. Alphabet: is.
Costas Busch - LSU1 Deterministic Finite Automata And Regular Languages.
Theory of Computation Automata Theory Dr. Ayman Srour.
Ch 5. Language Change: A Preliminary Model 5.1 ~ 5.2 The Computational Nature of Language Learning and Evolution P. Niyogi 2006 Summarized by Kwonill,
Theory of Computation Automata Theory Dr. Ayman Srour.
Deterministic Finite-State Machine (or Deterministic Finite Automaton) A DFA is a 5-tuple, (S, Σ, T, s, A), consisting of: S: a finite set of states Σ:
Chapter 1 Introduction.
Formal Methods in software development
Deterministic Finite Automata And Regular Languages.
David Rodriguez-Velazquez CS – 6800 Summer I
CIS Automata and Formal Languages – Pei Wang
Course 1 Introduction to Formal Languages and Automata Theory (part 1)
Automata, Formal Grammars, and Consequences
Language translation Programming Language Design and Implementation (4th Edition) by T. Pratt and M. Zelkowitz Prentice Hall, 2001 Sections
Context free grammar.
Chapter 1 Introduction.
Formal Language Theory
Compiler Lecture 1 CS510.
PARSE TREES.
Knowledge Representation
Martin Kay Stanford University
Formal Language.
Computer Programming LAB 1 Tejalal Choudhary Asst. Prof, CSE Dept.
CSE322 LEFT & RIGHT LINEAR REGULAR GRAMMAR
Context-Free Languages
Regular Expressions
Formal Methods in software development
Language translation Programming Language Design and Implementation (4th Edition) by T. Pratt and M. Zelkowitz Prentice Hall, 2001 Sections
Language translation Programming Language Design and Implementation (4th Edition) by T. Pratt and M. Zelkowitz Prentice Hall, 2001 Sections
Aim: To be able to describe the general rule for a sequence
Lecture One: Automata Theory Amjad Ali
Language translation Programming Language Design and Implementation (4th Edition) by T. Pratt and M. Zelkowitz Prentice Hall, 2001 Sections
Language translation Programming Language Design and Implementation (4th Edition) by T. Pratt and M. Zelkowitz Prentice Hall, 2001 Sections
Language translation Programming Language Design and Implementation (4th Edition) by T. Pratt and M. Zelkowitz Prentice Hall, 2001 Sections
Language translation Programming Language Design and Implementation (4th Edition) by T. Pratt and M. Zelkowitz Prentice Hall, 2001 Sections
Presentation transcript:

Computational and Evolutionary Aspects of Language Written by: Martin Nowak, Natalia Komarova, and Partha Niyogi Presentation by: Amerika Adams, Isaac Huang, and Margaret Kuwata

Purpose Attempt to formulate a synthesis of three theories. Addresses the importance of human language. Addresses the following questions: 1. What is language? 2. What is grammar? 3. What is learning? 4. How does a child learn language? 5. How formal language theory and learning theory can be extended to study language as a biological phenomenon and as a product of evolution.

Formal Language Theory It is a mode of communication It is a crucial part of human behavior It is the sequencing of small units into bigger structures. There are rules for word grouping.

What is language? The alphabet is a set of symbols Sentences are strings of symbols Language is a set of sentences Example: Binary Language

What is grammar? It is a finite set of rules specifying a language. Expressed in terms of “rewrite rules”

Languages, Grammars, and Machines. Correspondence between languages, grammars, and machines. Regular Languages are generated by finite-state grammars which is equal to finite-state automata. Finite-state automata have a start, a finite number of intermediate states, and a finish. A particular run from start to finish produces a sentence.

Learning Theory Learning is the ability to generalize beyond one’s own experience to new circumstances. Learning theory describes the mathematics of learning with the aim of outlining conditions for successful generalization. Theory of Universal Grammar (UG)

What is special about language acquisition? We learn the grammar of generative systems. The process occurs without being instructed about rules. The set of all computable languages is learnable by an algorithm that memorizes the rules.

Evolutionary Language Theory The evolution of language occurred in several incremental steps that were guided by natural selection. The theory states that by taking a population of individuals and with each individual using a particular language, the successful ones are able to communicate which results in a pay-off that attributes to fitness. Languages change overtime because the transmission from one generation to the next is not perfect.

Agreements 1. Language is a crucial part of human identity and behavior. 2. Language has evolved through Darwinian dynamics of natural selection. 3. That learning is the ability to generalize beyond one’s own experience. Not just modeling others.

Disagreements 1. The set of all computable languages is learnable by an algorithm that memorizes rules. (?) That children have a restricted set of innate languages they could learn correctly.