Context-Free Grammars and Languages. Context-Free Grammars and Languages p.1/40
|
|
- Rebecca McCarthy
- 6 years ago
- Views:
Transcription
1 Context-Free Grammars and Languages Context-Free Grammars and Languages p.1/40
2 Limitations of finite automata There are languages, such as be described (specified) by NFAs or REs that cannot Context-Free Grammars and Languages p.2/40
3 Limitations of finite automata There are languages, such as be described (specified) by NFAs or REs Context-free grammars provide a more powerful mechanism for language specification that cannot Context-Free Grammars and Languages p.2/40
4 Limitations of finite automata There are languages, such as be described (specified) by NFAs or REs Context-free grammars provide a more powerful mechanism for language specification that cannot Context-free grammars can describe features that have a recursive structure making them useful beyond finite automata Context-Free Grammars and Languages p.2/40
5 Historical notes Context-free grammars were first used to study human languages Context-Free Grammars and Languages p.3/40
6 Historical notes Context-free grammars were first used to study human languages One way of understanding the relationship between syntactic categories (such as noun, verb, preposition, etc) and their respective phrases leads to natural recursion Context-Free Grammars and Languages p.3/40
7 Historical notes Context-free grammars were first used to study human languages One way of understanding the relationship between syntactic categories (such as noun, verb, preposition, etc) and their respective phrases leads to natural recursion This is because noun phrases may occur inside the verb phrases and vice versa. Context-Free Grammars and Languages p.3/40
8 Note Context-free grammars can capture important aspects of these relationships Context-Free Grammars and Languages p.4/40
9 Important application Context-free grammars are used as basis for compiler design and implementation Context-Free Grammars and Languages p.5/40
10 Important application Context-free grammars are used as basis for compiler design and implementation Context-free grammars are used as specification mechanisms for programming languages Context-Free Grammars and Languages p.5/40
11 Important application Context-free grammars are used as basis for compiler design and implementation Context-free grammars are used as specification mechanisms for programming languages Designers of compilers use such grammars to implement compiler s components, such a scanners, parsers, and code generators Context-Free Grammars and Languages p.5/40
12 Important application Context-free grammars are used as basis for compiler design and implementation Context-free grammars are used as specification mechanisms for programming languages Designers of compilers use such grammars to implement compiler s components, such a scanners, parsers, and code generators The implementation of any programming language is preceded by a context-free grammar that specifies it Context-Free Grammars and Languages p.5/40
13 Context-free languages The collection of languages specified by context-free grammars are called context-free languages Context-Free Grammars and Languages p.6/40
14 Context-free languages The collection of languages specified by context-free grammars are called context-free languages Context-free languages include regular languages and many others Context-Free Grammars and Languages p.6/40
15 Context-free languages The collection of languages specified by context-free grammars are called context-free languages Context-free languages include regular languages and many others Here we will study the formal concepts of context-free grammars and context-free languages Context-Free Grammars and Languages p.6/40
16 Notations Abbreviate the phrase context-free grammar to CFG. Context-Free Grammars and Languages p.7/40
17 Notations Abbreviate the phrase context-free grammar to CFG. Abbreviate the phrase context-free language to CFL. Context-Free Grammars and Languages p.7/40
18 Notations Abbreviate the phrase context-free grammar to CFG. Abbreviate the phrase context-free language to CFL. Abbreviate the concept of a CFG specification rule to the tuple side and where stands for right hand side. stands for left hand Context-Free Grammars and Languages p.7/40
19 More on specification rules The of a specification rule is also called variable and is denoted by capital letters Context-Free Grammars and Languages p.8/40
20 More on specification rules The of a specification rule is also called variable and is denoted by capital letters The of a specification rule is also called a specification pattern and consists of a string of variables and constants Context-Free Grammars and Languages p.8/40
21 More on specification rules The of a specification rule is also called variable and is denoted by capital letters The of a specification rule is also called a specification pattern and consists of a string of variables and constants The variables that occur in a specification pattern are also called nonterminal symbols; the constants that occur in a specification pattern are also called terminal symbols Context-Free Grammars and Languages p.8/40
22 CFG: Informal A CFG grammar consists of a collection of specification rules where one variable is designated as start symbol or axiom Context-Free Grammars and Languages p.9/40
23 CFG: Informal A CFG grammar consists of a collection of specification rules where one variable is designated as start symbol or axiom Example: the CFG rules: has the following specification Context-Free Grammars and Languages p.9/40
24 CFG: Informal A CFG grammar consists of a collection of specification rules where one variable is designated as start symbol or axiom Example: the CFG rules: has the following specification Context-Free Grammars and Languages p.9/40
25 Note Nonterminals of CFG are and is the axiom Context-Free Grammars and Languages p.10/40
26 Note Nonterminals of CFG are and is the axiom Terminals of CFG are Context-Free Grammars and Languages p.10/40
27 More terminology The specification rules of a CFG are also called productions or substitution rules Context-Free Grammars and Languages p.11/40
28 More terminology The specification rules of a CFG are also called productions or substitution rules Nonterminals used in the specification rules defining a CFG may be strings Context-Free Grammars and Languages p.11/40
29 More terminology The specification rules of a CFG are also called productions or substitution rules Nonterminals used in the specification rules defining a CFG may be strings Terminals in the specification rules defining a CFG are constant strings Context-Free Grammars and Languages p.11/40
30 Terminals Terminals used in CFG specification rules are analogous to the input alphabet of an automaton Context-Free Grammars and Languages p.12/40
31 Terminals Terminals used in CFG specification rules are analogous to the input alphabet of an automaton Example terminals used in CFG-s are letters of an alphabet, numbers, special symbols, and strings of such elements. Context-Free Grammars and Languages p.12/40
32 Terminals Terminals used in CFG specification rules are analogous to the input alphabet of an automaton Example terminals used in CFG-s are letters of an alphabet, numbers, special symbols, and strings of such elements. Strings used to denote terminals in CFG specification rules are quoted Context-Free Grammars and Languages p.12/40
33 Language specification A CFG is used as a language specification mechanism by generating each string of the language in following manner: Context-Free Grammars and Languages p.13/40
34 Language specification A CFG is used as a language specification mechanism by generating each string of the language in following manner: 1. Write down the start variable; it is the of one of the specification rules,the top rule, unless specified otherwise Context-Free Grammars and Languages p.13/40
35 Language specification A CFG is used as a language specification mechanism by generating each string of the language in following manner: 1. Write down the start variable; it is the of one of the specification rules,the top rule, unless specified otherwise 2. Find a variable that is written down and a rule whose variable. Replace the written down variable with the rule is that of that Context-Free Grammars and Languages p.13/40
36 Language specification A CFG is used as a language specification mechanism by generating each string of the language in following manner: 1. Write down the start variable; it is the of one of the specification rules,the top rule, unless specified otherwise 2. Find a variable that is written down and a rule whose variable. Replace the written down variable with the rule is that of that 3. Repeat step 2 until no variables remain in the string thus generated Context-Free Grammars and Languages p.13/40
37 Example string generation Using CFG follows: we can generate the string 000#111 as A 0A1 00A11 000A B #111 Context-Free Grammars and Languages p.14/40
38 Example string generation Using CFG follows: we can generate the string 000#111 as A 0A1 00A11 000A B #111 Note: The sequence of substitutions used to obtain a string using a CFG is called a derivation and may be represented by a tree called a derivation tree or a parse tree Context-Free Grammars and Languages p.14/40
39 Example derivation tree The derivation tree of the string 000#111 using CFG in Figure 1 A is A A A B # Figure 1: Derivation tree for 000#111 Context-Free Grammars and Languages p.15/40
40 Note All strings of terminals generated in this way constitute the language specified by the grammar Context-Free Grammars and Languages p.16/40
41 Note All strings of terminals generated in this way constitute the language specified by the grammar We write grammar. Thus, for the language generated by the. Context-Free Grammars and Languages p.16/40
42 Note All strings of terminals generated in this way constitute the language specified by the grammar We write grammar. Thus, for the language generated by the. The language generated by a context-free grammar is called a Context-Free Language, CFL. Context-Free Grammars and Languages p.16/40
43 More notations To distinguish nonterminal from terminal strings we often enclose nonterminals in angular parentheses,, and terminals in quotes,". Context-Free Grammars and Languages p.17/40
44 More notations To distinguish nonterminal from terminal strings we often enclose nonterminals in angular parentheses,, and terminals in quotes,". If two or more rules have the same example using the form and with the meaning of an or"., as in the, we may compact them where is used Context-Free Grammars and Languages p.17/40
45 Example compaction The rules. and may be written as Context-Free Grammars and Languages p.18/40
46 $ CFG specifies a fragment of English The CFG $ # "! % Context-Free Grammars and Languages p.19/40
47 Note The CFG has ten variables (capitalized and in angular brackets) and 9 terminals (written in the standard English alphabet) plus a space character Context-Free Grammars and Languages p.20/40
48 Note The CFG has ten variables (capitalized and in angular brackets) and 9 terminals (written in the standard English alphabet) plus a space character Also, the CFG has 18 rules Context-Free Grammars and Languages p.20/40
49 Note The CFG has ten variables (capitalized and in angular brackets) and 9 terminals (written in the standard English alphabet) plus a space character Also, the CFG has 18 rules Examples strings that belongs to a boy sees the boy sees a flower are: a girl with a flower likes the boy Context-Free Grammars and Languages p.20/40
50 Example derivation with Context-Free Grammars and Languages p.21/40
51 Formal definition of a CFG A context-free grammar is a 4-tuple where: Context-Free Grammars and Languages p.22/40
52 Formal definition of a CFG A context-free grammar is a 4-tuple where: 1. is a finite set of strings called the variables or nonterminals Context-Free Grammars and Languages p.22/40
53 Formal definition of a CFG A context-free grammar is a 4-tuple where: 1. is a finite set of strings called the variables or nonterminals 2. is a finite set of strings, disjoint from terminals, called Context-Free Grammars and Languages p.22/40
54 Formal definition of a CFG A context-free grammar is a 4-tuple where: 1. is a finite set of strings called the variables or nonterminals 2. is a finite set of strings, disjoint from terminals, called 3. form is a finite set of rules (or specification rules) of the, where, Context-Free Grammars and Languages p.22/40
55 Formal definition of a CFG A context-free grammar is a 4-tuple where: 1. is a finite set of strings called the variables or nonterminals 2. is a finite set of strings, disjoint from terminals, called 3. form is a finite set of rules (or specification rules) of the, where, 4. is the start variable (or grammar axiom) Context-Free Grammars and Languages p.22/40
56 Example CFG grammar where is: Context-Free Grammars and Languages p.23/40
57 Direct derivation If terminals) and grammar) then we say that (i.e., are strings of variables and (i.e., is a rule of the yields, written Context-Free Grammars and Languages p.24/40
58 Direct derivation If terminals) and grammar) then we say that (i.e., are strings of variables and (i.e., is a rule of the yields, written We may also say that using the rule is directly derived from Context-Free Grammars and Languages p.24/40
59 % % Derivation We write or if a sequence if, and exists, for Context-Free Grammars and Languages p.25/40
60 % % % Derivation or if a sequence if We write, and exists, for is a derivation of We may also say that from Context-Free Grammars and Languages p.25/40
61 Language specified by If (or the language of is a CFG then the language specified by ) is Context-Free Grammars and Languages p.26/40
62 Note Often we specify a grammar by writing down only its rules Context-Free Grammars and Languages p.27/40
63 Note Often we specify a grammar by writing down only its rules We can identify the variables as the symbols that appear only as the of the rules Context-Free Grammars and Languages p.27/40
64 Note Often we specify a grammar by writing down only its rules We can identify the variables as the symbols that appear only as the of the rules Terminals are the remaining strings used in the rules Context-Free Grammars and Languages p.27/40
65 More examples of CFGs Consider the grammar: Context-Free Grammars and Languages p.28/40
66 More examples of CFGs Consider the grammar: Context-Free Grammars and Languages p.28/40
67 More examples of CFGs Consider the grammar: contains strings such as: Context-Free Grammars and Languages p.28/40
68 More examples of CFGs Consider the grammar: contains strings such as: abab, aaabbb, aababb; Context-Free Grammars and Languages p.28/40
69 More examples of CFGs Consider the grammar: contains strings such as: abab, aaabbb, aababb; Note: if one think at parentheses as then we can see that is the language of all strings of properly nested Context-Free Grammars and Languages p.28/40
70 Arithmetic expressions Consider the grammar: where is: Context-Free Grammars and Languages p.29/40
71 Arithmetic expressions Consider the grammar: where is: Context-Free Grammars and Languages p.29/40
72 Arithmetic expressions Consider the grammar: where is: is the language of arithmetic expressions Context-Free Grammars and Languages p.29/40
73 Note The variables and constants in by the terminal are represented Context-Free Grammars and Languages p.30/40
74 Note The variables and constants in by the terminal are represented Arithmetic operations in are addition, represented by +, and multiplication, represented by * Context-Free Grammars and Languages p.30/40
75 Note The variables and constants in by the terminal are represented Arithmetic operations in are addition, represented by +, and multiplication, represented by * An examples of a derivation using is in Figure 2 Context-Free Grammars and Languages p.30/40
76 Example derivation with E E + T T T * F F F a a a Figure 2: Derivation tree for a+a*a Context-Free Grammars and Languages p.31/40
77 Designing CFGs As with the design of automata, the design of CFGs requires creativity Context-Free Grammars and Languages p.32/40
78 Designing CFGs As with the design of automata, the design of CFGs requires creativity CFGs are even trickier to construct than finite automata because we are more accustomed to programming a machine than we are to specify programming languages" Context-Free Grammars and Languages p.32/40
79 Design techniques Many CFG are unions of simpler CFGs. Hence the suggestion is to construct smaller, simpler grammars first and then to join them into a larger grammar Context-Free Grammars and Languages p.33/40
80 Design techniques Many CFG are unions of simpler CFGs. Hence the suggestion is to construct smaller, simpler grammars first and then to join them into a larger grammar The mechanism of grammar combination consists of putting all their rules together and adding the new rules % where the variables are the start variables of the individual grammars and is a new variable,, Context-Free Grammars and Languages p.33/40
81 Example grammar design Design a grammar for the language Context-Free Grammars and Languages p.34/40
82 Example grammar design Design a grammar for the language 1. Construct the grammar that generates Context-Free Grammars and Languages p.34/40
83 Example grammar design Design a grammar for the language 1. Construct the grammar that generates 2. Construct the grammar that generates Context-Free Grammars and Languages p.34/40
84 Example grammar design Design a grammar for the language 1. Construct the grammar that generates 2. Construct the grammar that generates 3. Put them together adding the rule thus getting Context-Free Grammars and Languages p.34/40
85 Second design technique Constructing a CFG for a regular language is easy if one can first construct a DFA for that language Context-Free Grammars and Languages p.35/40
86 Second design technique Constructing a CFG for a regular language is easy if one can first construct a DFA for that language Conversion procedure: Context-Free Grammars and Languages p.35/40
87 Second design technique Constructing a CFG for a regular language is easy if one can first construct a DFA for that language Conversion procedure: 1. Make a variable for each state of DFA Context-Free Grammars and Languages p.35/40
88 Second design technique Constructing a CFG for a regular language is easy if one can first construct a DFA for that language Conversion procedure: 1. Make a variable for each state of DFA 2. Add the rule to the CFG if is a transition in the DFA Context-Free Grammars and Languages p.35/40
89 Second design technique Constructing a CFG for a regular language is easy if one can first construct a DFA for that language Conversion procedure: 1. Make a variable for each state of DFA 2. Add the rule to the CFG if transition in the DFA 3. Add the rule if is a is an accept state of the DFA Context-Free Grammars and Languages p.35/40
90 Second design technique Constructing a CFG for a regular language is easy if one can first construct a DFA for that language Conversion procedure: 1. Make a variable for each state of DFA 2. Add the rule to the CFG if transition in the DFA 3. Add the rule if 4. If is the start state of the DFA make the CFG. is a is an accept state of the DFA the start variable of Context-Free Grammars and Languages p.35/40
91 Note Verify that CFG constructed by the conversion of a DFA into a CFG generates the language that the DFA recognizes Context-Free Grammars and Languages p.36/40
92 Third design technique Certain CFLs contain strings with two related substrings as are and in Context-Free Grammars and Languages p.37/40
93 Third design technique Certain CFLs contain strings with two related substrings as are and in Example of relationship: to recognize such a language a machine would need to remember an unbounded amount of info about one of the substrings Context-Free Grammars and Languages p.37/40
94 Note A CFG that handles this situation uses a rule of the form which generates strings wherein the portion containing s corresponds to the portion containing s Context-Free Grammars and Languages p.38/40
95 Fourth design technique In a complex language, strings may contain certain structures that appear recursively Context-Free Grammars and Languages p.39/40
96 Fourth design technique In a complex language, strings may contain certain structures that appear recursively Example: in arithmetic expressions any time the symbol a appear, the entire parenthesized expression may appear. Context-Free Grammars and Languages p.39/40
97 Note To achieve this effect one needs to place the variable generating the structure ( in case of ) in the location of the rule corresponding to where the structure may recursively appear as in in case of Context-Free Grammars and Languages p.40/40
CS 598 Natural Language Processing
CS 598 Natural Language Processing Natural language is everywhere Natural language is everywhere Natural language is everywhere Natural language is everywhere!"#$%&'&()*+,-./012 34*5665756638/9:;< =>?@ABCDEFGHIJ5KL@
More informationGrammars & Parsing, Part 1:
Grammars & Parsing, Part 1: Rules, representations, and transformations- oh my! Sentence VP The teacher Verb gave the lecture 2015-02-12 CS 562/662: Natural Language Processing Game plan for today: Review
More informationInformatics 2A: Language Complexity and the. Inf2A: Chomsky Hierarchy
Informatics 2A: Language Complexity and the Chomsky Hierarchy September 28, 2010 Starter 1 Is there a finite state machine that recognises all those strings s from the alphabet {a, b} where the difference
More informationLanguage properties and Grammar of Parallel and Series Parallel Languages
arxiv:1711.01799v1 [cs.fl] 6 Nov 2017 Language properties and Grammar of Parallel and Series Parallel Languages Mohana.N 1, Kalyani Desikan 2 and V.Rajkumar Dare 3 1 Division of Mathematics, School of
More informationProof Theory for Syntacticians
Department of Linguistics Ohio State University Syntax 2 (Linguistics 602.02) January 5, 2012 Logics for Linguistics Many different kinds of logic are directly applicable to formalizing theories in syntax
More informationSyntax Parsing 1. Grammars and parsing 2. Top-down and bottom-up parsing 3. Chart parsers 4. Bottom-up chart parsing 5. The Earley Algorithm
Syntax Parsing 1. Grammars and parsing 2. Top-down and bottom-up parsing 3. Chart parsers 4. Bottom-up chart parsing 5. The Earley Algorithm syntax: from the Greek syntaxis, meaning setting out together
More informationParsing of part-of-speech tagged Assamese Texts
IJCSI International Journal of Computer Science Issues, Vol. 6, No. 1, 2009 ISSN (Online): 1694-0784 ISSN (Print): 1694-0814 28 Parsing of part-of-speech tagged Assamese Texts Mirzanur Rahman 1, Sufal
More information11/29/2010. Statistical Parsing. Statistical Parsing. Simple PCFG for ATIS English. Syntactic Disambiguation
tatistical Parsing (Following slides are modified from Prof. Raymond Mooney s slides.) tatistical Parsing tatistical parsing uses a probabilistic model of syntax in order to assign probabilities to each
More informationRANKING AND UNRANKING LEFT SZILARD LANGUAGES. Erkki Mäkinen DEPARTMENT OF COMPUTER SCIENCE UNIVERSITY OF TAMPERE REPORT A ER E P S I M S
N S ER E P S I M TA S UN A I S I T VER RANKING AND UNRANKING LEFT SZILARD LANGUAGES Erkki Mäkinen DEPARTMENT OF COMPUTER SCIENCE UNIVERSITY OF TAMPERE REPORT A-1997-2 UNIVERSITY OF TAMPERE DEPARTMENT OF
More informationBasic Parsing with Context-Free Grammars. Some slides adapted from Julia Hirschberg and Dan Jurafsky 1
Basic Parsing with Context-Free Grammars Some slides adapted from Julia Hirschberg and Dan Jurafsky 1 Announcements HW 2 to go out today. Next Tuesday most important for background to assignment Sign up
More informationErkki Mäkinen State change languages as homomorphic images of Szilard languages
Erkki Mäkinen State change languages as homomorphic images of Szilard languages UNIVERSITY OF TAMPERE SCHOOL OF INFORMATION SCIENCES REPORTS IN INFORMATION SCIENCES 48 TAMPERE 2016 UNIVERSITY OF TAMPERE
More informationA General Class of Noncontext Free Grammars Generating Context Free Languages
INFORMATION AND CONTROL 43, 187-194 (1979) A General Class of Noncontext Free Grammars Generating Context Free Languages SARWAN K. AGGARWAL Boeing Wichita Company, Wichita, Kansas 67210 AND JAMES A. HEINEN
More informationA R "! I,,, !~ii ii! A ow ' r.-ii ' i ' JA' V5, 9. MiN, ;
A R "! I,,, r.-ii ' i '!~ii ii! A ow ' I % i o,... V. 4..... JA' i,.. Al V5, 9 MiN, ; Logic and Language Models for Computer Science Logic and Language Models for Computer Science HENRY HAMBURGER George
More informationA Version Space Approach to Learning Context-free Grammars
Machine Learning 2: 39~74, 1987 1987 Kluwer Academic Publishers, Boston - Manufactured in The Netherlands A Version Space Approach to Learning Context-free Grammars KURT VANLEHN (VANLEHN@A.PSY.CMU.EDU)
More information"f TOPIC =T COMP COMP... OBJ
TREATMENT OF LONG DISTANCE DEPENDENCIES IN LFG AND TAG: FUNCTIONAL UNCERTAINTY IN LFG IS A COROLLARY IN TAG" Aravind K. Joshi Dept. of Computer & Information Science University of Pennsylvania Philadelphia,
More informationRefining the Design of a Contracting Finite-State Dependency Parser
Refining the Design of a Contracting Finite-State Dependency Parser Anssi Yli-Jyrä and Jussi Piitulainen and Atro Voutilainen The Department of Modern Languages PO Box 3 00014 University of Helsinki {anssi.yli-jyra,jussi.piitulainen,atro.voutilainen}@helsinki.fi
More informationCOMPUTATIONAL COMPLEXITY OF LEFT-ASSOCIATIVE GRAMMAR
COMPUTATIONAL COMPLEXITY OF LEFT-ASSOCIATIVE GRAMMAR ROLAND HAUSSER Institut für Deutsche Philologie Ludwig-Maximilians Universität München München, West Germany 1. CHOICE OF A PRIMITIVE OPERATION The
More informationContext Free Grammars. Many slides from Michael Collins
Context Free Grammars Many slides from Michael Collins Overview I An introduction to the parsing problem I Context free grammars I A brief(!) sketch of the syntax of English I Examples of ambiguous structures
More informationTowards a MWE-driven A* parsing with LTAGs [WG2,WG3]
Towards a MWE-driven A* parsing with LTAGs [WG2,WG3] Jakub Waszczuk, Agata Savary To cite this version: Jakub Waszczuk, Agata Savary. Towards a MWE-driven A* parsing with LTAGs [WG2,WG3]. PARSEME 6th general
More informationEnumeration of Context-Free Languages and Related Structures
Enumeration of Context-Free Languages and Related Structures Michael Domaratzki Jodrey School of Computer Science, Acadia University Wolfville, NS B4P 2R6 Canada Alexander Okhotin Department of Mathematics,
More informationSome Principles of Automated Natural Language Information Extraction
Some Principles of Automated Natural Language Information Extraction Gregers Koch Department of Computer Science, Copenhagen University DIKU, Universitetsparken 1, DK-2100 Copenhagen, Denmark Abstract
More informationsystems have been developed that are well-suited to phenomena in but is properly contained in the indexed languages. We give a
J. LOGIC PROGRAMMING 1993:12:1{199 1 STRING VARIABLE GRAMMAR: A LOGIC GRAMMAR FORMALISM FOR THE BIOLOGICAL LANGUAGE OF DNA DAVID B. SEARLS > Building upon Denite Clause Grammar (DCG), a number of logic
More informationDeveloping a TT-MCTAG for German with an RCG-based Parser
Developing a TT-MCTAG for German with an RCG-based Parser Laura Kallmeyer, Timm Lichte, Wolfgang Maier, Yannick Parmentier, Johannes Dellert University of Tübingen, Germany CNRS-LORIA, France LREC 2008,
More informationGrade 5 + DIGITAL. EL Strategies. DOK 1-4 RTI Tiers 1-3. Flexible Supplemental K-8 ELA & Math Online & Print
Standards PLUS Flexible Supplemental K-8 ELA & Math Online & Print Grade 5 SAMPLER Mathematics EL Strategies DOK 1-4 RTI Tiers 1-3 15-20 Minute Lessons Assessments Consistent with CA Testing Technology
More informationGACE Computer Science Assessment Test at a Glance
GACE Computer Science Assessment Test at a Glance Updated May 2017 See the GACE Computer Science Assessment Study Companion for practice questions and preparation resources. Assessment Name Computer Science
More informationFocus of the Unit: Much of this unit focuses on extending previous skills of multiplication and division to multi-digit whole numbers.
Approximate Time Frame: 3-4 weeks Connections to Previous Learning: In fourth grade, students fluently multiply (4-digit by 1-digit, 2-digit by 2-digit) and divide (4-digit by 1-digit) using strategies
More informationNatural Language Processing. George Konidaris
Natural Language Processing George Konidaris gdk@cs.brown.edu Fall 2017 Natural Language Processing Understanding spoken/written sentences in a natural language. Major area of research in AI. Why? Humans
More informationAQUA: An Ontology-Driven Question Answering System
AQUA: An Ontology-Driven Question Answering System Maria Vargas-Vera, Enrico Motta and John Domingue Knowledge Media Institute (KMI) The Open University, Walton Hall, Milton Keynes, MK7 6AA, United Kingdom.
More informationModeling Attachment Decisions with a Probabilistic Parser: The Case of Head Final Structures
Modeling Attachment Decisions with a Probabilistic Parser: The Case of Head Final Structures Ulrike Baldewein (ulrike@coli.uni-sb.de) Computational Psycholinguistics, Saarland University D-66041 Saarbrücken,
More informationGrade 6: Correlated to AGS Basic Math Skills
Grade 6: Correlated to AGS Basic Math Skills Grade 6: Standard 1 Number Sense Students compare and order positive and negative integers, decimals, fractions, and mixed numbers. They find multiples and
More informationHyperedge Replacement and Nonprojective Dependency Structures
Hyperedge Replacement and Nonprojective Dependency Structures Daniel Bauer and Owen Rambow Columbia University New York, NY 10027, USA {bauer,rambow}@cs.columbia.edu Abstract Synchronous Hyperedge Replacement
More informationParsing natural language
Rochester Institute of Technology RIT Scholar Works Theses Thesis/Dissertation Collections 1983 Parsing natural language Leonard E. Wilcox Follow this and additional works at: http://scholarworks.rit.edu/theses
More informationCompositional Semantics
Compositional Semantics CMSC 723 / LING 723 / INST 725 MARINE CARPUAT marine@cs.umd.edu Words, bag of words Sequences Trees Meaning Representing Meaning An important goal of NLP/AI: convert natural language
More informationAnalysis of Probabilistic Parsing in NLP
Analysis of Probabilistic Parsing in NLP Krishna Karoo, Dr.Girish Katkar Research Scholar, Department of Electronics & Computer Science, R.T.M. Nagpur University, Nagpur, India Head of Department, Department
More informationChunk Parsing for Base Noun Phrases using Regular Expressions. Let s first let the variable s0 be the sentence tree of the first sentence.
NLP Lab Session Week 8 October 15, 2014 Noun Phrase Chunking and WordNet in NLTK Getting Started In this lab session, we will work together through a series of small examples using the IDLE window and
More informationHighlighting and Annotation Tips Foundation Lesson
English Highlighting and Annotation Tips Foundation Lesson About this Lesson Annotating a text can be a permanent record of the reader s intellectual conversation with a text. Annotation can help a reader
More informationMachine Learning from Garden Path Sentences: The Application of Computational Linguistics
Machine Learning from Garden Path Sentences: The Application of Computational Linguistics http://dx.doi.org/10.3991/ijet.v9i6.4109 J.L. Du 1, P.F. Yu 1 and M.L. Li 2 1 Guangdong University of Foreign Studies,
More informationGRAMMAR IN CONTEXT 2 PDF
GRAMMAR IN CONTEXT 2 PDF ==> Download: GRAMMAR IN CONTEXT 2 PDF GRAMMAR IN CONTEXT 2 PDF - Are you searching for Grammar In Context 2 Books? Now, you will be happy that at this time Grammar In Context
More informationUniversiteit Leiden ICT in Business
Universiteit Leiden ICT in Business Ranking of Multi-Word Terms Name: Ricardo R.M. Blikman Student-no: s1184164 Internal report number: 2012-11 Date: 07/03/2013 1st supervisor: Prof. Dr. J.N. Kok 2nd supervisor:
More informationStatewide Framework Document for:
Statewide Framework Document for: 270301 Standards may be added to this document prior to submission, but may not be removed from the framework to meet state credit equivalency requirements. Performance
More informationOhio s Learning Standards-Clear Learning Targets
Ohio s Learning Standards-Clear Learning Targets Math Grade 1 Use addition and subtraction within 20 to solve word problems involving situations of 1.OA.1 adding to, taking from, putting together, taking
More informationInleiding Taalkunde. Docent: Paola Monachesi. Blok 4, 2001/ Syntax 2. 2 Phrases and constituent structure 2. 3 A minigrammar of Italian 3
Inleiding Taalkunde Docent: Paola Monachesi Blok 4, 2001/2002 Contents 1 Syntax 2 2 Phrases and constituent structure 2 3 A minigrammar of Italian 3 4 Trees 3 5 Developing an Italian lexicon 4 6 S(emantic)-selection
More informationAchim Stein: Diachronic Corpora Aston Corpus Summer School 2011
Achim Stein: Diachronic Corpora Aston Corpus Summer School 2011 Achim Stein achim.stein@ling.uni-stuttgart.de Institut für Linguistik/Romanistik Universität Stuttgart 2nd of August, 2011 1 Installation
More informationThe Interface between Phrasal and Functional Constraints
The Interface between Phrasal and Functional Constraints John T. Maxwell III* Xerox Palo Alto Research Center Ronald M. Kaplan t Xerox Palo Alto Research Center Many modern grammatical formalisms divide
More informationCharacter Stream Parsing of Mixed-lingual Text
Character Stream Parsing of Mixed-lingual Text Harald Romsdorfer and Beat Pfister Speech Processing Group Computer Engineering and Networks Laboratory ETH Zurich {romsdorfer,pfister}@tik.ee.ethz.ch Abstract
More informationChapter 4 - Fractions
. Fractions Chapter - Fractions 0 Michelle Manes, University of Hawaii Department of Mathematics These materials are intended for use with the University of Hawaii Department of Mathematics Math course
More informationSpecifying Logic Programs in Controlled Natural Language
TECHNICAL REPORT 94.17, DEPARTMENT OF COMPUTER SCIENCE, UNIVERSITY OF ZURICH, NOVEMBER 1994 Specifying Logic Programs in Controlled Natural Language Norbert E. Fuchs, Hubert F. Hofmann, Rolf Schwitter
More informationBANGLA TO ENGLISH TEXT CONVERSION USING OPENNLP TOOLS
Daffodil International University Institutional Repository DIU Journal of Science and Technology Volume 8, Issue 1, January 2013 2013-01 BANGLA TO ENGLISH TEXT CONVERSION USING OPENNLP TOOLS Uddin, Sk.
More informationNATURAL LANGUAGE PARSING AND REPRESENTATION IN XML EUGENIO JAROSIEWICZ
NATURAL LANGUAGE PARSING AND REPRESENTATION IN XML By EUGENIO JAROSIEWICZ A THESIS PRESENTED TO THE GRADUATE SCHOOL OF THE UNIVERSITY OF FLORIDA IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE
More informationChinese Language Parsing with Maximum-Entropy-Inspired Parser
Chinese Language Parsing with Maximum-Entropy-Inspired Parser Heng Lian Brown University Abstract The Chinese language has many special characteristics that make parsing difficult. The performance of state-of-the-art
More informationImproved Reordering for Shallow-n Grammar based Hierarchical Phrase-based Translation
Improved Reordering for Shallow-n Grammar based Hierarchical Phrase-based Translation Baskaran Sankaran and Anoop Sarkar School of Computing Science Simon Fraser University Burnaby BC. Canada {baskaran,
More informationDear Teacher: Welcome to Reading Rods! Reading Rods offer many outstanding features! Read on to discover how to put Reading Rods to work today!
Dear Teacher: Welcome to Reading Rods! Your Sentence Building Reading Rod Set contains 156 interlocking plastic Rods printed with words representing different parts of speech and punctuation marks. Students
More informationCommon Core State Standards for English Language Arts
Reading Standards for Literature 6-12 Grade 9-10 Students: 1. Cite strong and thorough textual evidence to support analysis of what the text says explicitly as well as inferences drawn from the text. 2.
More informationFormulaic Language and Fluency: ESL Teaching Applications
Formulaic Language and Fluency: ESL Teaching Applications Formulaic Language Terminology Formulaic sequence One such item Formulaic language Non-count noun referring to these items Phraseology The study
More informationAccurate Unlexicalized Parsing for Modern Hebrew
Accurate Unlexicalized Parsing for Modern Hebrew Reut Tsarfaty and Khalil Sima an Institute for Logic, Language and Computation, University of Amsterdam Plantage Muidergracht 24, 1018TV Amsterdam, The
More informationHindi Aspectual Verb Complexes
Hindi Aspectual Verb Complexes HPSG-09 1 Introduction One of the goals of syntax is to termine how much languages do vary, in the hope to be able to make hypothesis about how much natural languages can
More informationLearning Computational Grammars
Learning Computational Grammars John Nerbonne, Anja Belz, Nicola Cancedda, Hervé Déjean, James Hammerton, Rob Koeling, Stasinos Konstantopoulos, Miles Osborne, Franck Thollard and Erik Tjong Kim Sang Abstract
More information4-3 Basic Skills and Concepts
4-3 Basic Skills and Concepts Identifying Binomial Distributions. In Exercises 1 8, determine whether the given procedure results in a binomial distribution. For those that are not binomial, identify at
More informationWord Stress and Intonation: Introduction
Word Stress and Intonation: Introduction WORD STRESS One or more syllables of a polysyllabic word have greater prominence than the others. Such syllables are said to be accented or stressed. Word stress
More informationObjectives. Chapter 2: The Representation of Knowledge. Expert Systems: Principles and Programming, Fourth Edition
Chapter 2: The Representation of Knowledge Expert Systems: Principles and Programming, Fourth Edition Objectives Introduce the study of logic Learn the difference between formal logic and informal logic
More informationDeveloping a concrete-pictorial-abstract model for negative number arithmetic
Developing a concrete-pictorial-abstract model for negative number arithmetic Jai Sharma and Doreen Connor Nottingham Trent University Research findings and assessment results persistently identify negative
More informationChapter 4: Valence & Agreement CSLI Publications
Chapter 4: Valence & Agreement Reminder: Where We Are Simple CFG doesn t allow us to cross-classify categories, e.g., verbs can be grouped by transitivity (deny vs. disappear) or by number (deny vs. denies).
More informationFirst Grade Curriculum Highlights: In alignment with the Common Core Standards
First Grade Curriculum Highlights: In alignment with the Common Core Standards ENGLISH LANGUAGE ARTS Foundational Skills Print Concepts Demonstrate understanding of the organization and basic features
More informationEmmaus Lutheran School English Language Arts Curriculum
Emmaus Lutheran School English Language Arts Curriculum Rationale based on Scripture God is the Creator of all things, including English Language Arts. Our school is committed to providing students with
More informationELD CELDT 5 EDGE Level C Curriculum Guide LANGUAGE DEVELOPMENT VOCABULARY COMMON WRITING PROJECT. ToolKit
Unit 1 Language Development Express Ideas and Opinions Ask for and Give Information Engage in Discussion ELD CELDT 5 EDGE Level C Curriculum Guide 20132014 Sentences Reflective Essay August 12 th September
More informationUNIVERSITY OF OSLO Department of Informatics. Dialog Act Recognition using Dependency Features. Master s thesis. Sindre Wetjen
UNIVERSITY OF OSLO Department of Informatics Dialog Act Recognition using Dependency Features Master s thesis Sindre Wetjen November 15, 2013 Acknowledgments First I want to thank my supervisors Lilja
More informationThe Smart/Empire TIPSTER IR System
The Smart/Empire TIPSTER IR System Chris Buckley, Janet Walz Sabir Research, Gaithersburg, MD chrisb,walz@sabir.com Claire Cardie, Scott Mardis, Mandar Mitra, David Pierce, Kiri Wagstaff Department of
More information1 st Quarter (September, October, November) August/September Strand Topic Standard Notes Reading for Literature
1 st Grade Curriculum Map Common Core Standards Language Arts 2013 2014 1 st Quarter (September, October, November) August/September Strand Topic Standard Notes Reading for Literature Key Ideas and Details
More informationCS 101 Computer Science I Fall Instructor Muller. Syllabus
CS 101 Computer Science I Fall 2013 Instructor Muller Syllabus Welcome to CS101. This course is an introduction to the art and science of computer programming and to some of the fundamental concepts of
More informationCh VI- SENTENCE PATTERNS.
Ch VI- SENTENCE PATTERNS faizrisd@gmail.com www.pakfaizal.com It is a common fact that in the making of well-formed sentences we badly need several syntactic devices used to link together words by means
More informationIntroducing the New Iowa Assessments Language Arts Levels 15 17/18
Introducing the New Iowa Assessments Language Arts Levels 15 17/18 ITP Assessment Tools Math Interim Assessments: Grades 3 8 Administered online Constructed Response Supplements Reading, Language Arts,
More informationDerivational: Inflectional: In a fit of rage the soldiers attacked them both that week, but lost the fight.
Final Exam (120 points) Click on the yellow balloons below to see the answers I. Short Answer (32pts) 1. (6) The sentence The kinder teachers made sure that the students comprehended the testable material
More informationAGS THE GREAT REVIEW GAME FOR PRE-ALGEBRA (CD) CORRELATED TO CALIFORNIA CONTENT STANDARDS
AGS THE GREAT REVIEW GAME FOR PRE-ALGEBRA (CD) CORRELATED TO CALIFORNIA CONTENT STANDARDS 1 CALIFORNIA CONTENT STANDARDS: Chapter 1 ALGEBRA AND WHOLE NUMBERS Algebra and Functions 1.4 Students use algebraic
More informationThree New Probabilistic Models. Jason M. Eisner. CIS Department, University of Pennsylvania. 200 S. 33rd St., Philadelphia, PA , USA
Three New Probabilistic Models for Dependency Parsing: An Exploration Jason M. Eisner CIS Department, University of Pennsylvania 200 S. 33rd St., Philadelphia, PA 19104-6389, USA jeisner@linc.cis.upenn.edu
More informationContent Language Objectives (CLOs) August 2012, H. Butts & G. De Anda
Content Language Objectives (CLOs) Outcomes Identify the evolution of the CLO Identify the components of the CLO Understand how the CLO helps provide all students the opportunity to access the rigor of
More informationEnhancing Unlexicalized Parsing Performance using a Wide Coverage Lexicon, Fuzzy Tag-set Mapping, and EM-HMM-based Lexical Probabilities
Enhancing Unlexicalized Parsing Performance using a Wide Coverage Lexicon, Fuzzy Tag-set Mapping, and EM-HMM-based Lexical Probabilities Yoav Goldberg Reut Tsarfaty Meni Adler Michael Elhadad Ben Gurion
More informationIntroduction to HPSG. Introduction. Historical Overview. The HPSG architecture. Signature. Linguistic Objects. Descriptions.
to as a linguistic theory to to a member of the family of linguistic frameworks that are called generative grammars a grammar which is formalized to a high degree and thus makes exact predictions about
More informationType Theory and Universal Grammar
Type Theory and Universal Grammar Aarne Ranta Department of Computer Science and Engineering Chalmers University of Technology and Göteborg University Abstract. The paper takes a look at the history of
More informationLearning to Think Mathematically With the Rekenrek
Learning to Think Mathematically With the Rekenrek A Resource for Teachers A Tool for Young Children Adapted from the work of Jeff Frykholm Overview Rekenrek, a simple, but powerful, manipulative to help
More informationReading Grammar Section and Lesson Writing Chapter and Lesson Identify a purpose for reading W1-LO; W2- LO; W3- LO; W4- LO; W5-
New York Grade 7 Core Performance Indicators Grades 7 8: common to all four ELA standards Throughout grades 7 and 8, students demonstrate the following core performance indicators in the key ideas of reading,
More informationABSTRACT. A major goal of human genetics is the discovery and validation of genetic polymorphisms
ABSTRACT DEODHAR, SUSHAMNA DEODHAR. Using Grammatical Evolution Decision Trees for Detecting Gene-Gene Interactions in Genetic Epidemiology. (Under the direction of Dr. Alison Motsinger-Reif.) A major
More informationLinking Task: Identifying authors and book titles in verbose queries
Linking Task: Identifying authors and book titles in verbose queries Anaïs Ollagnier, Sébastien Fournier, and Patrice Bellot Aix-Marseille University, CNRS, ENSAM, University of Toulon, LSIS UMR 7296,
More informationGuidelines for Writing an Internship Report
Guidelines for Writing an Internship Report Master of Commerce (MCOM) Program Bahauddin Zakariya University, Multan Table of Contents Table of Contents... 2 1. Introduction.... 3 2. The Required Components
More informationTarget Language Preposition Selection an Experiment with Transformation-Based Learning and Aligned Bilingual Data
Target Language Preposition Selection an Experiment with Transformation-Based Learning and Aligned Bilingual Data Ebba Gustavii Department of Linguistics and Philology, Uppsala University, Sweden ebbag@stp.ling.uu.se
More informationDigital Fabrication and Aunt Sarah: Enabling Quadratic Explorations via Technology. Michael L. Connell University of Houston - Downtown
Digital Fabrication and Aunt Sarah: Enabling Quadratic Explorations via Technology Michael L. Connell University of Houston - Downtown Sergei Abramovich State University of New York at Potsdam Introduction
More informationParsing with Treebank Grammars: Empirical Bounds, Theoretical Models, and the Structure of the Penn Treebank
Parsing with Treebank Grammars: Empirical Bounds, Theoretical Models, and the Structure of the Penn Treebank Dan Klein and Christopher D. Manning Computer Science Department Stanford University Stanford,
More informationPart I. Figuring out how English works
9 Part I Figuring out how English works 10 Chapter One Interaction and grammar Grammar focus. Tag questions Introduction. How closely do you pay attention to how English is used around you? For example,
More informationWSU Five-Year Program Review Self-Study Cover Page
WSU Five-Year Program Review Self-Study Cover Page Department: Program: Computer Science Computer Science AS/BS Semester Submitted: Spring 2012 Self-Study Team Chair: External to the University but within
More informationWhat Can Neural Networks Teach us about Language? Graham Neubig a2-dlearn 11/18/2017
What Can Neural Networks Teach us about Language? Graham Neubig a2-dlearn 11/18/2017 Supervised Training of Neural Networks for Language Training Data Training Model this is an example the cat went to
More informationTRAITS OF GOOD WRITING
TRAITS OF GOOD WRITING Each paper was scored on a scale of - on the following traits of good writing: Ideas and Content: Organization: Voice: Word Choice: Sentence Fluency: Conventions: The ideas are clear,
More informationOpportunities for Writing Title Key Stage 1 Key Stage 2 Narrative
English Teaching Cycle The English curriculum at Wardley CE Primary is based upon the National Curriculum. Our English is taught through a text based curriculum as we believe this is the best way to develop
More informationLecture 1: Basic Concepts of Machine Learning
Lecture 1: Basic Concepts of Machine Learning Cognitive Systems - Machine Learning Ute Schmid (lecture) Johannes Rabold (practice) Based on slides prepared March 2005 by Maximilian Röglinger, updated 2010
More informationCX 101/201/301 Latin Language and Literature 2015/16
The University of Warwick Department of Classics and Ancient History CX 101/201/301 Latin Language and Literature 2015/16 Module tutor: Clive Letchford Humanities Building 2.21 c.a.letchford@warwick.ac.uk
More informationPowerTeacher Gradebook User Guide PowerSchool Student Information System
PowerSchool Student Information System Document Properties Copyright Owner Copyright 2007 Pearson Education, Inc. or its affiliates. All rights reserved. This document is the property of Pearson Education,
More informationPRODUCT PLATFORM DESIGN: A GRAPH GRAMMAR APPROACH
Proceedings of DETC 99: 1999 ASME Design Engineering Technical Conferences September 12-16, 1999, Las Vegas, Nevada DETC99/DTM-8762 PRODUCT PLATFORM DESIGN: A GRAPH GRAMMAR APPROACH Zahed Siddique Graduate
More informationDependency, licensing and the nature of grammatical relations *
UCL Working Papers in Linguistics 8 (1996) Dependency, licensing and the nature of grammatical relations * CHRISTIAN KREPS Abstract Word Grammar (Hudson 1984, 1990), in common with other dependency-based
More informationOrganizing Comprehensive Literacy Assessment: How to Get Started
Organizing Comprehensive Assessment: How to Get Started September 9 & 16, 2009 Questions to Consider How do you design individualized, comprehensive instruction? How can you determine where to begin instruction?
More informationENGBG1 ENGBL1 Campus Linguistics. Meeting 2. Chapter 7 (Morphology) and chapter 9 (Syntax) Pia Sundqvist
Meeting 2 Chapter 7 (Morphology) and chapter 9 (Syntax) Today s agenda Repetition of meeting 1 Mini-lecture on morphology Seminar on chapter 7, worksheet Mini-lecture on syntax Seminar on chapter 9, worksheet
More informationSubject: Opening the American West. What are you teaching? Explorations of Lewis and Clark
Theme 2: My World & Others (Geography) Grade 5: Lewis and Clark: Opening the American West by Ellen Rodger (U.S. Geography) This 4MAT lesson incorporates activities in the Daily Lesson Guide (DLG) that
More informationEnsemble Technique Utilization for Indonesian Dependency Parser
Ensemble Technique Utilization for Indonesian Dependency Parser Arief Rahman Institut Teknologi Bandung Indonesia 23516008@std.stei.itb.ac.id Ayu Purwarianti Institut Teknologi Bandung Indonesia ayu@stei.itb.ac.id
More information