University of Toronto, Department of Computer Science CSC 485H/2501H: Computational linguistics, Fall 2022 Assignment 1 

Due date: 23:59 on Friday, October 7, 2022. Late assignments will not be accepted without a valid medical certificate or other documentation of an emergency. This assignment is worth 33% (CSC 485) or 25% (CSC 2501) of your final grade. Read the whole assignment carefully. Type the written parts of your submission in no less than 12pt font. What you turn in must be your own work. You may not work with anyone else on any of the problems in this assignment. If you need assistance, contact the instructor or TA for the assignment. Any clarifications to the problems will be posted on the Piazza forum for the class. You will be responsible for taking into account in your solutions any information that is posted there, or discussed in class, so you should check the page regularly between now and the due date. The starter code directory for this assignment is accessible on Teaching Labs machines at the path /u/csc485h/fall/pub/a1/. In this handout, code files we refer to are located in that directory. When implementing code, make sure to read the docstrings carefully as they provide im- portant instructions and implementation details. Fill in your name, student number, and UTORid on the relevant lines at the top of each Python file that you submit. (Do not add new lines; just replace the NAME, NUMBER, and UTORid placeholders.) 1. Transition-based dependency parsing (42 marks) Dependency grammars posit relationships between head words and their modifiers. These rela- tionships constitute trees where each word depends on exactly one parent: either another word or, for the head of the sentence, a dummy symbol, ROOT. The first part of this assignment concerns a parser that builds a parse incrementally. At each step, the state of the parse is represented by: A stack of words that are currently being processed. A buffer of words yet to be processed. A list of dependencies predicted by the parser. Initially, the stack only contains ROOT, the dependencies list is empty, and the buffer contains all words of the sentence in order. At each step, the parser advances by applying a transition to the parse until its buffer is empty and the stack is of size 1. The following transitions can be applied: SHIFT: removes the first word from the buffer and pushes it onto the stack. LEFT-ARC: marks the second-from-top item (i.e., second-most recently added word) on the stack as a dependant of the first item and removes the second item from the stack. RIGHT-ARC:marksthetopitem(i.e.,mostrecentlyaddedword)onthestackasadependant of the second item and removes the first item from the stack. (a) (4marks)CompletethesequenceoftransitionsneededforparsingthesentenceToaskthose questions is to answer them with the dependency tree shown below. At each step, indicate the state of the stack and the buffer, as well as which transition to apply at this step, including what, if any, new dependency to add. The first four steps are provided to get you started. mark root csubj dobj det those xcomp mark dobj Transition SHIFT SHIFT LEFT-ARC SHIFT ROOT Step Stack 0 [ROOT] To ask questions is to answer New dep ask mark To them Buffer 1 [ROOT, To] 2 [ROOT, To, ask] 3 [ROOT, ask] 4 [ROOT, ask, those] [To, ask, those, questions, is, to, answer, them] [ask, those, questions, is, to, answer, them] [those, questions, is, to, answer, them] [those, questions, is, to, answer, them] [questions, is, to, answer, them] 2 Algorithm 1: Minibatch dependency parsing input :alistofsentencestobeparsedandamodel,whichmakesparserdecisions. Initialize a list of partial_parses, one for each sentence in sentences; Initialize a shallow copy of partial_parses called unfinished_parses; while unfinished_parses is not empty do Use the first batch_size parses in unfinished_parses as a minibatch; Use the model to predict the next transition for each partial parse in the minibatch; Perform a parse step on each partial parse in the minibatch with its predicted transition; Remove those parses that are completed from unfinished_parses; end return The arcs for each (now completed) parse in partial_parses. (b) (1 mark) A sentence containing n words will be parsed in how many steps, in terms of n? (Exact, not asymptotic.) Briefly explain why. Next, you will implement a transition-based dependency parser that uses a neural network as a classifier to decide which transition to apply at a given partial parse state. A partial parse state is collectively defined by a sentence buffer as above, a stack as above with any number of items on it, and a set of correct dependency arcs for the sentence. (c) (6 marks) Implement the complete and parse_step methods in the PartialParse class in parse.py. These implement the transition mechanism of the parser. Also implement get_ n_rightmost_deps and get_n_leftmost_deps. You can run basic (non-exhaustive) tests by running python3 test_parse.py. (d) (6marks)Ournetworkwillpredictwhichtransitionshouldbeappliednexttoapartialparse. In principle, we could use the network to parse a single sentence simply by applying pre- dicted transitions until the parse is complete. However, neural networks run much more efficiently when making predictions about minibatches of data at a time; in this case, that means predicting the next transition for many different partial parses simultaneously. We can parse sentences in minibatches according to algorithm 1. Implement this algorithm in the minibatch_parse function in parse.py. You can run basic (non-exhaustive) tests by running python3 test_parse.py. Training your model to predict the right transitions will require you to have a notion of how well it performs on each training example. The parsers ability to produce a good dependency tree for a sentence is measured using an attachment score. This is the percentage of words in the sentence that are assigned as a dependant of the correct head. The unlabelled attachment score (UAS) considers only this, while the labelled attachment score (LAS) considers the label on the dependency relation as well. While this is ultimately the score we want to maximize, it is difficult to use this score to improve our model on a continuing basis. Instead, we will use the models per-transition accuracy (per partial parse) as a proxy for the parsers attachment score, so we will need the correct transitions. But the data set just provides sentences and corresponding dependency arcs. You must therefore implement an oracle that, given 3 a partial parse and a set of correct, final target dependency arcs, provides the next transition to take to advance the partial parse towards the final solution set of dependencies. The classifier will later be trained to try to predict the correct transition by minimizing the error in its predictions versus the transitions provided by the oracle. (e) (12 marks) Implement your oracle in the get_oracle method of parse.py. You can run basic tests by running python3 test_parse.py. The last step is to construct and train a neural network to predict which transition should be applied next, given the state of the stack, buffer, and dependencies. First, the model extracts a feature vector representing the current state. The function that extracts the features that we will use has been implemented for you in data.py. This feature vector consists of a list of tokens (e.g., the last word in the stack, first word in the buffer, dependant of the second-to-last word in the stack if there is one, etc.). They can be represented as a list of integers: [w1,w2,...,wm] where m is the number of features and each 0 wi < |V | is the index of a token in the vocabulary (|V | is the vocabulary size). Using pre-trained word embeddings (i.e., word vectors), our network will first look up the embedding for each word and concatenate them into a single input vector: xw =[Lw0 ;Lw1 ;...;Lwm]Rdm where L R|V |d is an embedding matrix where each row Li is the vector for the i-th word and the semicolon represents concatenation. The embeddings for tags (xt ) and arc-labels (xl ) are generated in a similar fashion from their own embedding matrices. The three vectors are then concatenated together: x=[xw;xt ;xl] From the combined input, we then compute our prediction probabilities as: h = max(xWh +bh,0) y = softmax(hWo +bo). The function for h is called the rectified linear unit (ReLU) function: ReLU (z) = max (z, 0). The objective function for this network (i.e., the value we will aim to minimize) with parame- ters is the cross-entropy loss: Nc J()=CE(y,y)=yilogyi i=1 To compute the loss for the training set, we average this J() across all training examples. (f) (13 marks) In model.py, implement the neural network classifier governing the dependency parser by filling in the appropriate sections; they are marked by BEGIN and END comments. You will train and evaluate the model on a corpus of English Web text that has been annotated with Universal Dependencies. Run python3 train.py to train your model and compute 4 predictions on the test data. With everything correctly implemented, you should be able to get an LAS of around 80% on both the validation and test sets (with the best-performing model out of all of the epochs at the end of training). 2. Graph-based dependency parsing (58 marks) The transition-based mechanism above is limited to only being able to parse projective depen- dency trees. A projective dependency tree is one in which the edges can be drawn above the words without crossing other edges when the words, preceded by ROOT, are arranged in linear order. Equivalently, every word forms a contiguous substring of the sentence when taken together with its descendants. The tree in the above figure was projective. The tree below is not projective. root ROOT John npadvmod dobj saw a dog relcl yesterday nsubj nsubj which was attr a Yorkshire Terrier (a) (3 marks) Why is the parsing mechanism described above insufficient to generate non- projective dependency trees? (b) (8 marks) Implement the is_projective function in graphalg.py. You can run some basic tests based on the trees in the handout by running python3 graphalg.py. Run the count_projective.py script and report the result. (c) (4 marks) A related concept to projectivity is gap degree. The gap degree of a word in a dependency tree is the least k for which the subsequence consisting of the word and its descendants (both direct and indirect) is entirely comprised of k + 1 maximally contiguous substrings. Equivalently, the gap degree of a word is the number of gaps in the subsequence formed by the word and all of its descendants, regardless of the size of the gaps. The gap degree of a dependency tree is the greatest gap degree of any word in the tree. What is the gap degree of each of the two trees above? Show your work. Unlike the transition-based parser above, in this part of the assignment you will be imple- menting a graph-based parser that doesnt have the same limitation for non-projective trees. In particular, you will be implementing an edge-factored parser, which learns to score possible edges such that the correct edges should receive higher scores than incorrect edges. A sentence containing n words has a dependency graph with n + 1 vertices (with the one extra vertex being for ROOT); there are therefore (n + 1)2 possible edges. 5 In this assignment, the vertices for the sentence words (including ROOT) will each be repre- sented as vectors of size p. The vertices for the entire sentence can then be represented as a matrix S R(n+1)p.1 Assume that ROOT is placed before the first word in the sentence. The model you are to implement has two components: an arc scorer and a label scorer. The arc scorer produces a single score for each vertex pair; the label scorer produces |R| scores for each vertex pair, where R is the set of dependency relations (det, dobj, etc.). The arc scores allow selecting an edge, after which the label score can be used to select a dependency relation for that edge. Let ai j denote the arc score for dependency edge from vertex j to vertex i. Note the ordering! It may be different from what youre used to: ai j is a score corresponding to j being the head of i; in other words, ai j corresponds to an edge from vertex j to vertex i. Then the matrix A with elements ai j = [A]i j is defined as: DA = MLPAd(S) HA = MLPAh(S) aij =[DA]iWA([HA]j)T+[HA]jbA MLPa,d and MLPa,h are (separate) Multi-Layer Perceptron layers that transform the original input sentence matrix S to a smaller dimensionality dA < p. For this assignment, we will be using MLPs with one hidden layer and one output layer, both of width dA, along with Rectified Linear Unit (ReLU) activation and dropout for each layer. WA and bA are trainable parameters. Lastly, for each word i in the sentence, we can compute the probability of word j being its head with softmax and then use cross-entropy as the loss function Jh for training: hi =softmax(aij) n Jh =CE(h,h)=hiloghi i=1 (d) (6marks)Implementcreate_arc_layersandscore_arcsingraphdep.py.Youwillneed to determine the appropriate dimensions for WA and bA, as well as how to implement the arc score calculations for the batched sentence tensors. You should be able to do this entirely with PyTorch tensor operations; using a loop for this question will result in a penalty. (e) (1 mark) For effective, stable training, especially for deeper networks, it is important to initialize weight matrices carefully. A standard initialization strategies for ReLU layers is called Kaiming initialization2. For a given layers weight matrix W of dimension m n, where m is the number of input units to the layer and n is the number of units in the layer, Kaiming initialization samples values Wi j from a Gaussian distribution with mean = 0 and variance 2 = 2/m. However, it is common to instead sample from a uniform distribution U (a, b) with lower bound a and upper bound b; in fact, the create_ methods in graphdep.py direct you to 1Beware that the vectors are computed differently compared to Part 1. There, we used word2vec; here we use BERT, a contextual representation model that provides a vector representation for a word in context of a sentence; in other words, the same word will have different vector representations depending on the sentence it appears in. 2Also referred to as He initialization. 6 initialize some parameters according to a uniform distribution. Derive the values of a and b that yield a uniform distribution U (a, b) with the mean and variance given above. The label scorer proceeds in a similar manner, but is a bit more complex. Let li j R|R| denote a vector of scores, one for each possible dependency relation r R. We use similar MLPs as for the arc scorer (but with different dimensionality), and then compute the score vector as: DL = MLPLd(S) HL = MLPLh(S) lij = [DL]iWL([HL]j)T +[HL]jWLh +[DL]iWLd +bL WL is a third-order tensor, WLh and WLd are matrices, and bL is a vector so that li j is a vector as defined above. The MLPs for the label scorer have the same structure as for the arc scorer (two hidden layers, ReLU activations and dropout for each), but we use a smaller dimensionality dL < dA < p. To compute prediction probabilities, we can again use softmax and then use cross-entropy loss for training: rij =softmax(lij) nn Jr =CE(r,r)=rijlogrij i=1 j=0 The two parts are trained together, such that the whole model has loss function J = Jh + Jr. (f) (8marks)Implementcreate_label_layersandscore_labelsingraphdep.py.Asabove, you will need to determine the appropriate dimensions for the trainable parameters and how to implement the label score calculations for the batched sentence tensors. You should be able to do this entirely with PyTorch tensor operations; using a loop for this question will result in a penalty. (g) (2 marks) In the arc scorer, the score function includes a term that has HA but not DA, but there isnt a term that has the opposite inclusions (DA but not HA). For the label scorer, both are included. Why does it not make sense to include a term just for DA, but it does for DL? (h) (2 marks) In standard classification problems, we typically multiply the input by a weight matrix and add a per-class bias to produce a class score for the given input. Why do we have to multiply WA and WL by (transformed versions of) the input twice in this case? (i) (2 marks) There are some constraints on which arcs and arc-label combinations are possible. Implement these constraints in mask_possible in graphdep.py. Finally, how do we make our final predictions given an input sentence? Since we know that we our desired answer has a tree structure, and since the parsing model is trained to increase the scores assigned to the correct edges, we can use a maximum spanning tree algorithm to select the set of arcs. Then, for each arc from i to j, we can use argmax over li j to predict the dependency relation. 7 (j) (4 marks) Why do we need to use a maximum spanning tree algorithm to make the final arc prediction? Why cant we just use argmax, like we would in a typical classification scenario, and like we do for the dependency relations? What happens if we use argmax instead? (k) (12 marks) Finish the rest of the implementation: is_single_root_tree and single_ root_mst in graphalg.py. You can refer to the pseudocode in the third edition of the Juraf- sky & Martin textbook to guide your implementation.3 As in part 1, you will train and evaluate the model on a corpus of English Web text that has been annotated with Universal Dependencies. Run python3 train.py to train your model and compute predictions on the test data. With everything correctly implemented, you should be able to get an LAS of around 82% on both the validation and test sets (with the best-performing model out of all of the peochs at the end of training).4 (l) (6 marks) Find at least three example sentences where the transition-based parser gives a different parse than the graph-based parser, but both parses are wrong as judged by the annotation in the corpus. For each example, argue for which of the two parses you prefer. Notes While debugging, you may find it useful to run your training code with the --debug flag, like so: $ python3 train.py --debug This will cause the code to run over a small subset of the data so that each training epoch takes less time. Remember to change the setting back prior to submission, and before doing your final run. Training should run within 15 hours on a CPU, but may be a bit faster or slower depending on the specific CPU. A GPU is much faster, taking around 510 minutes or lessagain, with some variation depending on the specific GPU. Via ssh to teach.cs.toronto.edu, you can run your model on a GPU-equipped machine. The starter code directory includes a gpu-train.sh script that will run the relevant com- mand to run your train.py file, assuming the latter is in your current working directory (i.e., assuming that you run your the command while your shell was in the same directory as train.py). Note that the GPU machines are shared resources, so there may be limits on how long your code is allowed to run. 3The name of the relevant algorithm is Chu-Liu-Edmonds; the pseudocode is given in Fig. 14.13 in the dependency parsing chapter, which you can download here. 4Keep in mind that the two parsers use different word vectors, so the LAS values that the two parsers get arent directly comparable. 8 The gpu-train.sh script should be sufficient; it takes care of submitting and running the job to the cluster-management software. If you like, you are free to manage this yourself; see the documentation online at the relevant page on the Teaching Labs site. The partition you can use for this class is csc485. Note: Remote GPU access via slurm is currently unavailable on teach.cs as of the re- lease of this assignment due to an ongoing system upgrade. We will make an announce- ment on Piazza if this changes. If you are accessing the labs in person, the Teaching Labs FAQ page lists the labs that have GPU-equipped machines. Keep in mind that your mark is based on your implementation, not (directly) on the LAS your implementation achieves. Getting the same LAS as mentioned above doesnt guarantee full marks; nor does getting a LAS lower than that mentioned guarantee that marks will be docked. The end result can vary based on differences in environment (hardware or software) so this number is approximate! (But the further away your LAS, the more likely it is that you have an error in your implementation.) Exceptforis_single_root_treeandsingle_root_mst,makesurethatallofyourchanges occur within BEGIN and END boundary comments. Do not add any extra package or mod- ule imports and do not modify any other parts of the files other than to fill your details in at the top of the file as instructed on the front page of this assignment handout. You may alter other parts of the code as needed for debugging, but make sure that you revert any such changes for your final run and submission. You will be better off with partially complete implementations that work but are sometimes incorrect than you will with an almost-complete implementation that Python cant run. Keep this in mind for your final submission. Also, make sure your submitted files are importable in Python (i.e., make sure that import graphalg and import graphdep dont yield errors). What to submit Submission is electronic and can be done from any Teaching Labs machine using the submit command: $ submit -c <course> -a A1 <filename-1> ... <filename-n> where <course> is csc485h or csc2501h depending on which course youre registered in, and <filename-1> to <filename-n> are the n files you are submitting. The files you are to submit are as follows: a1written.pdf: a PDF document containing your written answers as applicable for each question. 9 This PDF must also include a typed copy of the Student Conduct declaration as on the last page of this assignment handout. Type the declaration as it is and sign it by typing your name. model.py: the (entire) model.py file with your implementations filled in. parse.py: the (entire) parse.py file with your implementations filled in. graphalg.py: the (entire) graphalg.py file with your implementations filled in. graphdep.py: the (entire) graphdep.py file with your implementations filled in. weights-q1.pt and weights-q2.pt: the weights file produced by your models final runs. Again, except for is_single_root_tree and single_root_mst, ensure that there are no changes outside the BEGIN and END boundary comments provided other than filling in your de- tails at the top of the file; you will lose marks if there are. Do not change or remove the boundary comments either. 10 Appendix A PyTorch You will be using PyTorch to implement components of your neural dependency parser. PyTorch is an open-source library for numerical computation that provides automatic differentiation, making the back-propagation aspect of neural networks easier. Computation is done in units of tensors; the storage of and operations on tensors is provided in both CPU and GPU implementations, making it simple to switch between the two. We recommend trying some of the tutorials on the official PyTorch site to get up to speed on PyTorchs mechanics. In particular, the Tensors and nn module sections of the Learning PyTorch with Examples tutorial will be most relevant for this assignment. If you want to run this code on your own machine, you can install the torch package via pip3, or any of the other installation options available on the PyTorch site. Make sure to use PyTorch version 1.9. You will also need to install the conllu and transformers packages. Make sure to consult the PyTorch documentation as needed. The API documentation for torch, torch.nn, torch.nn.functional, and torch.Tensor will be useful while implementing the code in this assignment. 11 CSC 485H/2501H, Fall 2022: Assignment 1 Family name: First name: Student #: Date: I declare that this assignment, both my paper and electronic submissions, is my own work, and is in accordance with the University of Toronto Code of Behaviour on Academic Matters and the Code of Student Conduct. Signature: