Constituency Parsing. Computational Linguistics: Jordan Boyd-Graber University of Maryland INTRO / CHART PARSING
|
|
- Jasper Montgomery
- 5 years ago
- Views:
Transcription
1 Constituency Parsing Computational Linguistics: Jordan Boyd-Graber University of Maryland INTRO / CHART PARSING Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 1 / 24
2 Motivation A More Grounded Syntax Theory A central question in linguistics is how do we know when a sentence is grammatical? Chomsky s generative grammars attempted to mathematically formalize this question Linguistic phrases contained a universal, hierarchical structure formalized as parse trees Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 2 / 24
3 Motivation A More Grounded Syntax Theory A central question in linguistics is how do we know when a sentence is grammatical? Chomsky s generative grammars attempted to mathematically formalize this question Linguistic phrases contained a universal, hierarchical structure formalized as parse trees Today A formalization Foundation of all computational syntax Learnable from data Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 2 / 24
4 Context Free Grammars Context Free Grammars Definition N: finite set of non-terminal symbols Σ: finite set of terminal symbols R: productions of the form X Y 1...Y n, where X N, Y (N Σ) S: a start symbol within N Examples of non-terminals: np for noun phrase vp for verb phrase Often correspond to multiword syntactic abstractions Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 3 / 24
5 Context Free Grammars Context Free Grammars Definition N: finite set of non-terminal symbols Σ: finite set of terminal symbols R: productions of the form X Y 1...Y n, where X N, Y (N Σ) S: a start symbol within N Examples of terminals: dog play the Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 3 / 24
6 Context Free Grammars Context Free Grammars Definition N: finite set of non-terminal symbols Σ: finite set of terminal symbols R: productions of the form X Y 1...Y n, where X N, Y (N Σ) S: a start symbol within N Examples of productions: n dog np n np adj n Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 3 / 24
7 Context Free Grammars Context Free Grammars Definition N: finite set of non-terminal symbols Σ: finite set of terminal symbols R: productions of the form X Y 1...Y n, where X N, Y (N Σ) S: a start symbol within N In NLP applications, by convention we use S as the start symbol Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 3 / 24
8 Context Free Grammars Flexibility of CFG Productions Unary rules: nn man Mixing terminals and nonterminals on RHS: np Congress Vt the pooch np the nn Empty terminals np ε adj ε Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 4 / 24
9 Context Free Grammars Derivations A derivation is a sequence of strings s1...s T where s1 S, the start symbol st Σ : i.e., the final string is only terminals si, i > 1, is derived from s i 1 by replacing some non-terminal X in s i 1 and replacing it by some β, where x β R. Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 5 / 24
10 Context Free Grammars Derivations A derivation is a sequence of strings s1...s T where s1 S, the start symbol st Σ : i.e., the final string is only terminals si, i > 1, is derived from s i 1 by replacing some non-terminal X in s i 1 and replacing it by some β, where x β R. Example: parse tree Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 5 / 24
11 Context Free Grammars Example Derivation Productions s np vp vp AdvP vz Det the nn dot vz barked. s 1 = np Det nn np AdjP nn Det a nn cat vz ran. S vp vz np pro Det an nn mouse vz sat. Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 6 / 24
12 Context Free Grammars Example Derivation Productions s np vp vp AdvP vz Det the nn dot vz barked. s 2 = np Det nn np AdjP nn Det a nn cat vz ran. S vp vz np pro Det an nn mouse vz sat. VP Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 6 / 24
13 Context Free Grammars Productions sexample np Derivation vp vp AdvP vz Det the nn dot vz barked. s 3 = np Det nn np AdjP nn Det a nn cat vz ran. S vp vz np pro Det an nn mouse vz sat. VP Det NN Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 6 / 24
14 Context Free Grammars Productions s np vp vp Example AdvP Derivation vz Det the nn dot vz barked. s 4 = np Det nn np AdjP nn Det a nn cat vz ran. S vp vz np pro Det an nn mouse vz sat. VP Det NN the Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 6 / 24
15 Context Free Grammars Productions s np vp vp Example AdvP Derivation vz Det the nn dot vz barked. s 5 = np Det nn np AdjP nn Det a nn cat vz ran. S vp vz np pro Det an nn mouse vz sat. VP Det NN the cat Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 6 / 24
16 Context Free Grammars Productions s np vp vp Example AdvP Derivation vz Det the nn dot vz barked. s 6 = np Det nn np AdjP nn Det a nn cat vz ran. S vp vz np pro Det an nn mouse vz sat. VP Det NN VZ the cat Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 6 / 24
17 Context Free Grammars Productions s np vp vp Example AdvP Derivation vz Det the nn dot vz barked. s 7 = np Det nn np AdjP nn Det a nn cat vz ran. S vp vz np pro Det an nn mouse vz sat. VP Det NN VZ the cat sat Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 6 / 24
18 s 7 = Context Free Grammars S Example Derivation VP Det NN VZ the cat sat Ambiguous Yields The yield of a parse tree is the collection of terminals produced by the parse tree. Given a yield s. Parsing / Decoding Given, a yield s and a grammar G, determine the set of parse trees that could have produced that sequence of terminals: T G (s). Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 6 / 24
19 s 7 = Context Free Grammars S Example Derivation VP Det NN VZ the cat sat Ambiguous Yields The yield of a parse tree is the collection of terminals produced by the parse tree. Given a yield s. Parsing / Decoding Given, a yield s and a grammar G, determine the set of parse trees that could have produced that sequence of terminals: T G (s). Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 6 / 24
20 Context Free Grammars S Ambiguity Vt Example sentence: The man saw the dog with the telescope Grammatical: TG (s) > 0 Ambiguous: TG (s) > 1 DT the VP NN man saw DT NN IN the dog with PP DT NN S S the telescope DT the VP NN man Vt saw PP S DT NN the dog IN with DT NN Which should we prefer? the telescope DT the NN man Vt saw VP DT the NN dog VP IN with PP DT the NN telescope Figure 3: Two parse trees (derivations) for the sentence the man saw the dog with the telescope, underthecfginfigure1. VP DT NN VP PP the man Computational Linguistics: Jordan VtBoyd-Graber IN UMD 5 Constituency Parsing 7 / 24
21 Context Free Grammars S Ambiguity Vt Example sentence: The man saw the dog with the telescope Grammatical: TG (s) > 0 Ambiguous: TG (s) > 1 DT the VP NN man saw DT NN IN the dog with PP DT NN S S the telescope DT the NN man Vt saw S DT the VP NN dog IN with PP DT the Which should we prefer? NN telescope One is more probable VP than the other Add DT NN probabilities! VP PP the man Computational Linguistics: Jordan VtBoyd-Graber IN UMD 5 Constituency Parsing 7 / 24 DT the NN man Vt saw VP DT the NN dog VP IN with PP DT the NN telescope Figure 3: Two parse trees (derivations) for the sentence the man saw the dog with the telescope, underthecfginfigure1.
22 Probabilistic Context Free Grammars Goals What we want is a probability distribution over possible parse trees t T G (s) t,p(t) 0 p(t) = 1 (1) Rest of this lecture: t T G (s) How do we define the function p(t) (paramterization) How do we learn p(t) from data (estimation) Given a sentence, how do we find the possible parse trees (parsing / decoding) Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 8 / 24
23 Probabilistic Context Free Grammars Parameterization: Defining Score Function Parametrization For every production α β, we assume we have a function q(α β) We consider it a conditional probability of β (LHS) being derived from α (RHS) q(α β) = 1 (2) α β R:α=X The total probability of a tree t {α1 β 1...α n β n } is n p(t) = q(α i β i ) (3) i=1 Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 9 / 24
24 Probabilistic Context Free Grammars Estimation Estimation Get a bunch of grad students to make parse trees for a million sentences Mitch Markus: Penn Treebank (Wall Street Journal) To compute the conditional probability of a rule, q(np Det adj nn) Count(np Det adj nn) Count(np) Where Count is the number of times that derivation appears in the sentences Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 10 / 24
25 Probabilistic Context Free Grammars Estimation Estimation Get a bunch of grad students to make parse trees for a million sentences Mitch Markus: Penn Treebank (Wall Street Journal) To compute the conditional probability of a rule, q(np Det adj nn) Count(np Det adj nn) Count(np) Where Count is the number of times that derivation appears in the sentences Why no smoothing? Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 10 / 24
26 Dynamic Programming Like for dependency parsing, we build a chart to consider all possible subtrees First, however, we ll just consider whether a sentence is grammatical or not Build up a chart with all possible derivations of spans Then see entry with start symbol over the entire sentence: those are all grammatical parses Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 11 / 24
27 CYK Algorithm (deterministic) Assumptions Assumes binary grammar (not too difficult to extend) and no recursive rules Given sentence w of length N, grammar (N,Σ,R,S) Initialize array C[s, t, n] as array of booleans, all false ( ) Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 12 / 24
28 CYK Algorithm (deterministic) Assumptions Assumes binary grammar (not too difficult to extend) and no recursive rules Given sentence w of length N, grammar (N,Σ,R,S) Initialize array C[s, t, n] as array of booleans, all false ( ) for i = 0...N do for For each production r j N a w i do set C[i,i,a] Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 12 / 24
29 CYK Algorithm (deterministic) Assumptions Assumes binary grammar (not too difficult to extend) and no recursive rules Given sentence w of length N, grammar (N,Σ,R,S) Initialize array C[s, t, n] as array of booleans, all false ( ) for i = 0...N do for For each production r j N a w i do set C[i,i,a] for l = 2...n (length of span) do for s = 1...N l + 1 (start of span) do for k = 1...l 1 (pivot within span) do for each production r α βγ do if C[s,s + l,α] then C[s,s + l,α] C[s,s + k 1,β] C[s + k,s + l,γ] Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 12 / 24
30 Chart Parsing Book the flight through Houston Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 13 / 24
31 Chart Parsing Book the flight through Houston Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 13 / 24
32 Chart Parsing Det P N 3 4 N 5 Book the flight through Houston Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 13 / 24
33 Chart Parsing Det P N 0 V 1 2 N 3 4 N 5 Book the flight through Houston Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 13 / 24
34 Chart Parsing Det P N 0 V 1 2 N 3 4 N 5 Book the flight through Houston Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 13 / 24
35 Chart Parsing VP Det P N 0 V 1 2 N 3 4 N 5 Book the flight through Houston Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 13 / 24
36 Chart Parsing S VP Det P N 0 V 1 2 N 3 4 N 5 Book the flight through Houston Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 13 / 24
37 Chart Parsing S VP Det P N 0 V 1 2 N 3 4 N 5 Book the flight through Houston Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 13 / 24
38 Chart Parsing S VP Det P N 0 V 1 2 N 3 4 N 5 Book the flight through Houston Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 13 / 24
39 Chart Parsing S DP VP Det P N 0 V 1 2 N 3 4 N 5 Book the flight through Houston Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 13 / 24
40 Chart Parsing PP S DP VP Det P N 0 V 1 2 N 3 4 N 5 Book the flight through Houston Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 13 / 24
41 Chart Parsing PP S DP VP Det P N 0 V 1 2 N 3 4 N 5 Book the flight through Houston Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 13 / 24
42 Chart Parsing S PP S DP VP Det P N 0 V 1 2 N 3 4 N 5 Book the flight through Houston Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 13 / 24
43 Chart Parsing DP S PP S DP VP Det P N 0 V 1 2 N 3 4 N 5 Book the flight through Houston Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 13 / 24
44 Chart Parsing S DP S PP S DP VP Det P N 0 V 1 2 N 3 4 N 5 Book the flight through Houston Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 13 / 24
45 Complexity? Chart has n 2 cells Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 14 / 24
46 Complexity? Chart has n 2 cells Each cell has n options Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 14 / 24
47 Complexity? Chart has n 2 cells Each cell has n options Times the number of productions G Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 14 / 24
48 Complexity? Chart has n 2 cells Each cell has n options Times the number of productions G Thus, O(n 3 G ) Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 14 / 24
49 How to deal with PCFG ambiguity In addition to keeping track of non-terminals in cell, also include max probability of forming non-terminal from sub-trees C[s,s + k,α] max(c[s,s + k,α],c[s,s + l 1,β] C[s + l,s + k,γ]) The score associated with S in the top of the chart is the best overall parse-tree (given the yield) Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 15 / 24
50 Recap Hierarchical syntax model: context free grammar Probabilistic interpretation: learn from data to solve ambiguity In class (next time): Work through example to resolve ambiguity Scoring a sentence Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 16 / 24
51 A pcfg Assume the following grammar s np vp 1.0 v sleeps 0.4 vp v np 0.7 v saw 0.6 vp vp pp 0.2 nn man 0.1 vp v 0.1 nn woman 0.1 np dt nn 0.2 nn telescope 0.3 np np pp 0.8 nn dog 0.5 pp p np 1.0 dt the 1.0 p with 0.6 p in 0.4 Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 17 / 24
52 Evaluating the probability of a sentence What is the probability of the parse S VP DT NN V the dog sleeps Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 18 / 24
53 Evaluating the probability of a sentence 1.0 det the 0.5 n dog 1.0 v sleeps 0.1 vp v 0.2 np dt n 1.0 = s np vp Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 18 / 24
54 Span 0 1. C[8,8,nn] = ln(0.3) = C[7,7,dt] = ln(1.0) = C[6,6,p] = ln(0.6) = C[5,5,nn] = ln(0.5) = C[4,4,dt] = ln(1.0) = C[3,3,v] = ln(0.6) = C[3,3,vp] = ln(0.6) + ln(0.1) = C[2,2,nn] = ln(0.1) = C[1,1,dt] = ln(1.0) = 0.0 Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 19 / 24
55 Span 1 1. C[1,2,np] = 0.0 +ln( 2.3 C[1,1,DT] C[2,2,NN] )+ln( 0.2 np dt n ) = = 3.9 Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 20 / 24
56 Span 1 1. C[1,2,np] = 0.0 +ln( 2.3 C[1,1,DT] C[2,2,NN] )+ln( 0.2 np dt n ) = = C[4,5,np] = 0.0 C[4,4,DT] +.69 C[5,5,NN] +ln( 0.2 ) = = 2.3 np dt n Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 20 / 24
57 Span 1 1. C[1,2,np] = 0.0 +ln( 2.3 C[1,1,DT] C[2,2,NN] )+ln( 0.2 np dt n ) = = C[4,5,np] = 0.0 C[4,4,DT] +.69 C[5,5,NN] +ln( 0.2 ) = = 2.3 np dt n 3. C[7,8,np] = 0.0 C[7,7,DT] C[8,8,NN] +ln( 0.2 ) = = 2.8 np dt n Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 20 / 24
58 Span 2 1. C[1,3,s] = 3.9 C[1,2,] C[3,3,VP] +ln( 1.0 ) = 6.7 s np vp Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 21 / 24
59 Span 2 1. C[1,3,s] = 3.9 C[1,2,] 2. C[3, 5, vp] = 0.5 C[3,3,V] C[3,3,VP] C[4,5,] +ln( 1.0 ) = 6.7 s np vp +ln( 0.7 ) = = 3.2 vp v np Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 21 / 24
60 Span 2 1. C[1,3,s] = 3.9 C[1,2,] 2. C[3, 5, vp] = 0.5 C[3,3,V] 3. C[6,8,pp] = 0.51 C[6,6,P] C[3,3,VP] C[4,5,] C[7,8,] +ln( 1.0 ) = 6.7 s np vp +ln( 0.7 ) = = 3.2 vp v np +ln( 1.0 ) = = 3.3 pp p np Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 21 / 24
61 Span 4 1. C[1,5,s] = 3.9 C[1,2,] C[3,5,VP] +ln( 1.0 ) = 7.1 s np vp Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 22 / 24
62 Span 4 1. C[1,5,s] = 3.9 C[1,2,] 2. C[4, 8, np] = 2.3 C[4,5,] C[3,5,VP] C[6,8,PP] +ln( 1.0 ) = 7.1 s np vp +ln( 0.8 ) = = 5.8 np np pp Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 22 / 24
63 Span 5 C[3, 8,vp] = max( (4) 3.2 C[3,5,VP] C[6,8,PP] + 1.6, (5) vp vp pp ) (6) C[3,3,V] C[4,8,] vp v np = max( 8.1, 6.7) = 6.7 (7) Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 23 / 24
64 Span 7 1. C[1,8,s] = = 10.6 C[1,2,] C[3,8,VP] Computational Linguistics: Jordan Boyd-Graber UMD Constituency Parsing 24 / 24
Grammars & 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 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 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 informationCS 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 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 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 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 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 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 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 information1/20 idea. We ll spend an extra hour on 1/21. based on assigned readings. so you ll be ready to discuss them in class
If we cancel class 1/20 idea We ll spend an extra hour on 1/21 I ll give you a brief writing problem for 1/21 based on assigned readings Jot down your thoughts based on your reading so you ll be ready
More informationPrediction of Maximal Projection for Semantic Role Labeling
Prediction of Maximal Projection for Semantic Role Labeling Weiwei Sun, Zhifang Sui Institute of Computational Linguistics Peking University Beijing, 100871, China {ws, szf}@pku.edu.cn Haifeng Wang Toshiba
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 informationBasic Syntax. Doug Arnold We review some basic grammatical ideas and terminology, and look at some common constructions in English.
Basic Syntax Doug Arnold doug@essex.ac.uk We review some basic grammatical ideas and terminology, and look at some common constructions in English. 1 Categories 1.1 Word level (lexical and functional)
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 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 informationConstruction Grammar. University of Jena.
Construction Grammar Holger Diessel University of Jena holger.diessel@uni-jena.de http://www.holger-diessel.de/ Words seem to have a prototype structure; but language does not only consist of words. What
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 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 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 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 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 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 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 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 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 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 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 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 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 informationLanguage Acquisition Fall 2010/Winter Lexical Categories. Afra Alishahi, Heiner Drenhaus
Language Acquisition Fall 2010/Winter 2011 Lexical Categories Afra Alishahi, Heiner Drenhaus Computational Linguistics and Phonetics Saarland University Children s Sensitivity to Lexical Categories Look,
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 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 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 informationEfficient Normal-Form Parsing for Combinatory Categorial Grammar
Proceedings of the 34th Annual Meeting of the ACL, Santa Cruz, June 1996, pp. 79-86. Efficient Normal-Form Parsing for Combinatory Categorial Grammar Jason Eisner Dept. of Computer and Information Science
More informationLNGT0101 Introduction to Linguistics
LNGT0101 Introduction to Linguistics Lecture #11 Oct 15 th, 2014 Announcements HW3 is now posted. It s due Wed Oct 22 by 5pm. Today is a sociolinguistics talk by Toni Cook at 4:30 at Hillcrest 103. Extra
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 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 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 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 informationTheoretical Syntax Winter Answers to practice problems
Linguistics 325 Sturman Theoretical Syntax Winter 2017 Answers to practice problems 1. Draw trees for the following English sentences. a. I have not been running in the mornings. 1 b. Joel frequently sings
More informationA Minimalist Approach to Code-Switching. In the field of linguistics, the topic of bilingualism is a broad one. There are many
Schmidt 1 Eric Schmidt Prof. Suzanne Flynn Linguistic Study of Bilingualism December 13, 2013 A Minimalist Approach to Code-Switching In the field of linguistics, the topic of bilingualism is a broad one.
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 informationLTAG-spinal and the Treebank
LTAG-spinal and the Treebank a new resource for incremental, dependency and semantic parsing Libin Shen (lshen@bbn.com) BBN Technologies, 10 Moulton Street, Cambridge, MA 02138, USA Lucas Champollion (champoll@ling.upenn.edu)
More informationConstraining X-Bar: Theta Theory
Constraining X-Bar: Theta Theory Carnie, 2013, chapter 8 Kofi K. Saah 1 Learning objectives Distinguish between thematic relation and theta role. Identify the thematic relations agent, theme, goal, source,
More informationLanguage and Computers. Writers Aids. Introduction. Non-word error detection. Dictionaries. N-gram analysis. Isolated-word error correction
Spelling & grammar We are all familiar with spelling & grammar correctors They are used to improve document quality They are not typically used to provide feedback L245 (Based on Dickinson, Brew, & Meurers
More information2/15/13. POS Tagging Problem. Part-of-Speech Tagging. Example English Part-of-Speech Tagsets. More Details of the Problem. Typical Problem Cases
POS Tagging Problem Part-of-Speech Tagging L545 Spring 203 Given a sentence W Wn and a tagset of lexical categories, find the most likely tag T..Tn for each word in the sentence Example Secretariat/P is/vbz
More informationAn Introduction to the Minimalist Program
An Introduction to the Minimalist Program Luke Smith University of Arizona Summer 2016 Some findings of traditional syntax Human languages vary greatly, but digging deeper, they all have distinct commonalities:
More informationAdapting Stochastic Output for Rule-Based Semantics
Adapting Stochastic Output for Rule-Based Semantics Wissenschaftliche Arbeit zur Erlangung des Grades eines Diplom-Handelslehrers im Fachbereich Wirtschaftswissenschaften der Universität Konstanz Februar
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 informationWhat is NLP? CS 188: Artificial Intelligence Spring Why is Language Hard? The Big Open Problems. Information Extraction. Machine Translation
C 188: Artificial Intelligence pring 2006 What is NLP? Lecture 27: NLP 4/27/2006 Dan Klein UC Berkeley Fundamental goal: deep understand of broad language Not just string processing or keyword matching!
More informationArgument structure and theta roles
Argument structure and theta roles Introduction to Syntax, EGG Summer School 2017 András Bárány ab155@soas.ac.uk 26 July 2017 Overview Where we left off Arguments and theta roles Some consequences of theta
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 informationThe Structure of Relative Clauses in Maay Maay By Elly Zimmer
I Introduction A. Goals of this study The Structure of Relative Clauses in Maay Maay By Elly Zimmer 1. Provide a basic documentation of Maay Maay relative clauses First time this structure has ever been
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 informationCase government vs Case agreement: modelling Modern Greek case attraction phenomena in LFG
Case government vs Case agreement: modelling Modern Greek case attraction phenomena in LFG Dr. Kakia Chatsiou, University of Essex achats at essex.ac.uk Explorations in Syntactic Government and Subcategorisation,
More informationSom and Optimality Theory
Som and Optimality Theory This article argues that the difference between English and Norwegian with respect to the presence of a complementizer in embedded subject questions is attributable to a larger
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 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 informationDomain Adaptation for Parsing
Domain Adaptation for Parsing Barbara Plank CLCG The work presented here was carried out under the auspices of the Center for Language and Cognition Groningen (CLCG) at the Faculty of Arts of the University
More informationTowards a Machine-Learning Architecture for Lexical Functional Grammar Parsing. Grzegorz Chrupa la
Towards a Machine-Learning Architecture for Lexical Functional Grammar Parsing Grzegorz Chrupa la A dissertation submitted in fulfilment of the requirements for the award of Doctor of Philosophy (Ph.D.)
More informationGeneration of Referring Expressions: Managing Structural Ambiguities
Generation of Referring Expressions: Managing Structural Ambiguities Imtiaz Hussain Khan and Kees van Deemter and Graeme Ritchie Department of Computing Science University of Aberdeen Aberdeen AB24 3UE,
More informationA Grammar for Battle Management Language
Bastian Haarmann 1 Dr. Ulrich Schade 1 Dr. Michael R. Hieb 2 1 Fraunhofer Institute for Communication, Information Processing and Ergonomics 2 George Mason University bastian.haarmann@fkie.fraunhofer.de
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 informationThe CYK -Approach to Serial and Parallel Parsing
The CYK -Approach to Serial and Parallel Parsing Anton Nijholt Traditional parsing methods for general context-free grammars have been re-investigated in order to see whether they can be adapted to a parallel
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 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 informationThe presence of interpretable but ungrammatical sentences corresponds to mismatches between interpretive and productive parsing.
Lecture 4: OT Syntax Sources: Kager 1999, Section 8; Legendre et al. 1998; Grimshaw 1997; Barbosa et al. 1998, Introduction; Bresnan 1998; Fanselow et al. 1999; Gibson & Broihier 1998. OT is not a theory
More informationNatural Language Processing: Interpretation, Reasoning and Machine Learning
Natural Language Processing: Interpretation, Reasoning and Machine Learning Roberto Basili (Università di Roma, Tor Vergata) dblp: http://dblp.uni-trier.de/pers/hd/b/basili:roberto.html Google scholar:
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 informationThe stages of event extraction
The stages of event extraction David Ahn Intelligent Systems Lab Amsterdam University of Amsterdam ahn@science.uva.nl Abstract Event detection and recognition is a complex task consisting of multiple sub-tasks
More informationPseudo-Passives as Adjectival Passives
Pseudo-Passives as Adjectival Passives Kwang-sup Kim Hankuk University of Foreign Studies English Department 81 Oedae-lo Cheoin-Gu Yongin-City 449-791 Republic of Korea kwangsup@hufs.ac.kr Abstract The
More informationPROBLEMS IN ADJUNCT CARTOGRAPHY: A CASE STUDY NG PEI FANG FACULTY OF LANGUAGES AND LINGUISTICS UNIVERSITY OF MALAYA KUALA LUMPUR
PROBLEMS IN ADJUNCT CARTOGRAPHY: A CASE STUDY NG PEI FANG FACULTY OF LANGUAGES AND LINGUISTICS UNIVERSITY OF MALAYA KUALA LUMPUR 2012 PROBLEMS IN ADJUNCT CARTOGRAPHY: A CASE STUDY NG PEI FANG SUBMITTED
More informationLanguage Evolution, Metasyntactically. First International Workshop on Bidirectional Transformations (BX 2012)
Language Evolution, Metasyntactically First International Workshop on Bidirectional Transformations (BX 2012) Vadim Zaytsev, SWAT, CWI 2012 Introduction Every language document employs its own We focus
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 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 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 informationA Computational Evaluation of Case-Assignment Algorithms
A Computational Evaluation of Case-Assignment Algorithms Miles Calabresi Advisors: Bob Frank and Jim Wood Submitted to the faculty of the Department of Linguistics in partial fulfillment of the requirements
More informationMorphosyntactic and Referential Cues to the Identification of Generic Statements
Morphosyntactic and Referential Cues to the Identification of Generic Statements Phil Crone pcrone@stanford.edu Department of Linguistics Stanford University Michael C. Frank mcfrank@stanford.edu Department
More informationWords come in categories
Nouns Words come in categories D: A grammatical category is a class of expressions which share a common set of grammatical properties (a.k.a. word class or part of speech). Words come in categories Open
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 informationCS Machine Learning
CS 478 - Machine Learning Projects Data Representation Basic testing and evaluation schemes CS 478 Data and Testing 1 Programming Issues l Program in any platform you want l Realize that you will be doing
More informationEAGLE: an Error-Annotated Corpus of Beginning Learner German
EAGLE: an Error-Annotated Corpus of Beginning Learner German Adriane Boyd Department of Linguistics The Ohio State University adriane@ling.osu.edu Abstract This paper describes the Error-Annotated German
More informationFeature-Based Grammar
8 Feature-Based Grammar James P. Blevins 8.1 Introduction This chapter considers some of the basic ideas about language and linguistic analysis that define the family of feature-based grammars. Underlying
More informationSecond Exam: Natural Language Parsing with Neural Networks
Second Exam: Natural Language Parsing with Neural Networks James Cross May 21, 2015 Abstract With the advent of deep learning, there has been a recent resurgence of interest in the use of artificial neural
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 informationIn search of ambiguity
In search of ambiguity DONALD G. MacKAY, MASSACHUSETTS INSTITUTE OF TECHNOLOGY THOMAS G. BEVER, HARI'ARD UNIVERSITY] A study of the time required for Ss to perceive the two meanings of ambiguous sentences,
More informationThe Structure of Multiple Complements to V
The Structure of Multiple Complements to Mitsuaki YONEYAMA 1. Introduction I have recently been concerned with the syntactic and semantic behavior of two s in English. In this paper, I will examine the
More informationEdIt: A Broad-Coverage Grammar Checker Using Pattern Grammar
EdIt: A Broad-Coverage Grammar Checker Using Pattern Grammar Chung-Chi Huang Mei-Hua Chen Shih-Ting Huang Jason S. Chang Institute of Information Systems and Applications, National Tsing Hua University,
More informationThe Strong Minimalist Thesis and Bounded Optimality
The Strong Minimalist Thesis and Bounded Optimality DRAFT-IN-PROGRESS; SEND COMMENTS TO RICKL@UMICH.EDU Richard L. Lewis Department of Psychology University of Michigan 27 March 2010 1 Purpose of this
More informationAgree or Move? On Partial Control Anna Snarska, Adam Mickiewicz University
PLM, 14 September 2007 Agree or Move? On Partial Control Anna Snarska, Adam Mickiewicz University 1. Introduction While in the history of generative grammar the distinction between Obligatory Control (OC)
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 informationControl and Boundedness
Control and Boundedness Having eliminated rules, we would expect constructions to follow from the lexical categories (of heads and specifiers of syntactic constructions) alone. Combinatory syntax simply
More informationProbabilistic Latent Semantic Analysis
Probabilistic Latent Semantic Analysis Thomas Hofmann Presentation by Ioannis Pavlopoulos & Andreas Damianou for the course of Data Mining & Exploration 1 Outline Latent Semantic Analysis o Need o Overview
More informationThe College Board Redesigned SAT Grade 12
A Correlation of, 2017 To the Redesigned SAT Introduction This document demonstrates how myperspectives English Language Arts meets the Reading, Writing and Language and Essay Domains of Redesigned SAT.
More informationPre-Processing MRSes
Pre-Processing MRSes Tore Bruland Norwegian University of Science and Technology Department of Computer and Information Science torebrul@idi.ntnu.no Abstract We are in the process of creating a pipeline
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 informationIBAN LANGUAGE PARSER USING RULE BASED APPROACH
IBAN LANGUAGE PARSER USING RULE BASED APPROACH Chia Yong Seng Master ofadvanced Information Technology 2010 P.t
More informationOn the Polynomial Degree of Minterm-Cyclic Functions
On the Polynomial Degree of Minterm-Cyclic Functions Edward L. Talmage Advisor: Amit Chakrabarti May 31, 2012 ABSTRACT When evaluating Boolean functions, each bit of input that must be checked is costly,
More information6.863J Natural Language Processing Lecture 12: Featured attraction. Instructor: Robert C. Berwick
6.863J Natural Language Processing Lecture 12: Featured attraction Instructor: Robert C. Berwick berwick@ai.mit.edu The Menu Bar Administrivia: 3a due Friday; Lab 3b out Weds; due after vacation Agenda:
More information