text stringlengths 27 323k | source stringclasses 14
values | __index_level_0__ int64 0 212k |
|---|---|---|
Question: Consider the following contains function defined on Iterable (in particular, it accepts both Vector and List). def contains[A](l: Iterable[A], elem: A): Boolean = val n = l.size if n <= 5 then for i <- l do if i == elem then return true false else val (p0, p1) = parallel( ... | preferences m1 | 0 |
Question: What is the asymptotic work of <code>parGroupyBy2</code>?, Answer: $\Theta(n)$ | preferences m1 | 1 |
Question: We have a collection of rectangles in a plane, whose sides are aligned with the coordinate axes. Each rectangle is represented by its lower left corner $(x_1,y_1)$ and its upper right corner $(x_2,y_2)$. All coordinates are of type Long. We require $x_1 \le x_2$ and $y_1 \le y_2$. Define a case class Rectangl... | preferences m1 | 2 |
Question: Which of the following scheduler policies are preemptive?, Answer: ['STCF (Shortest Time to Completion First)', 'RR (Round Robin)'] | preferences m1 | 3 |
Question: Which of the following are correct implementation for acquire function ? Assume 0 means UNLOCKED and 1 means LOCKED. Initially l->locked = 0., Answer: ['c \n void acquire(struct lock *l)\n {\n for(;;)\n if(xchg(&l->locked, 1) == 0)\n return;\n }'] | preferences m1 | 4 |
Question: In this week's lecture, you have been introduced to the aggregate method of ParSeq[A] (and other parallel data structures). It has the following signature: def aggregate[B](z: B)(f: (B, A) => B, g: (B, B) => B): B Discuss, as a group, what aggregate does and what its arguments represent. Consider the paralle... | preferences m1 | 5 |
Question: Freshly graduated from EPFL, you have been hired as contractors for a successful and rapidly growing bank. The bank has been experiencing problems with their money management system recently, which is written in Scala, and so they hired the best and brightest young engineer they could find: you! The system ha... | preferences m1 | 6 |
Question: In which of the following cases does JOS acquire the big kernel lock?, Answer: ['Processor traps in user mode', 'Initialization of application processor'] | preferences m1 | 7 |
Question: There are N philosphers sitting around a circular table eating spaghetti and discussing philosphy. The problem is that each philosopher needs two forks to eat, and there are only $N$ forks, one between each pair of philosophers. We want to design an algorithm that the philosophers can use, that ensures that n... | preferences m1 | 8 |
Question: In an x86 multiprocessor with JOS, how many Bootstrap Processors (BSP) is it possible to have at most? And how many Application Processors (AP) at most?, Answer: ['BSP: 1, AP: infinite'] | preferences m1 | 9 |
Question: In this week's lecture, you have been introduced to the aggregate method of ParSeq[A] (and other parallel data structures). It has the following signature: def aggregate[B](z: B)(f: (B, A) => B, g: (B, B) => B): B Discuss, as a group, what aggregate does and what its arguments represent. Under which conditio... | preferences m1 | 10 |
Question: We have a collection of rectangles in a plane, whose sides are aligned with the coordinate axes. Each rectangle is represented by its lower left corner $(x_1,y_1)$ and its upper right corner $(x_2, y_2)$. All coordinates are of type Long. We require $x_1 \le x_2$ and $y_1 \le y_2$. Define a function hull that... | preferences m1 | 11 |
Question: In this week's lecture, you have been introduced to the aggregate method of ParSeq[A] (and other parallel data structures). It has the following signature: def aggregate[B](z: B)(f: (B, A) => B, g: (B, B) => B): B Discuss, as a group, what aggregate does and what its arguments represent. Consider the paralle... | preferences m1 | 12 |
Question: Assume a user program executes following tasks. Select all options that will use a system call., Answer: ['Read the user\'s input "Hello world" from the keyboard.', 'Write "Hello world" to a file.', 'Send "Hello world" to another machine via Network Interface Card.'] | preferences m1 | 13 |
Question: What is the content of the inode?, Answer: ['File mode', 'Hard links counter', 'File size', 'Index structure for data blocks'] | preferences m1 | 14 |
Question: In x86, what are the possible ways to transfer arguments when invoking a system call? For example, in the following code, string and len are sys_cputs’s arguments., Answer: ['Stack', 'Registers'] | preferences m1 | 15 |
Question: What is the worst case complexity of listing files in a directory? The file system implements directories as hash-tables., Answer: ['$O(number of direntries in the directory)$'] | preferences m1 | 16 |
Question: In this week's lecture, you have been introduced to the aggregate method of ParSeq[A] (and other parallel data structures). It has the following signature: def aggregate[B](z: B)(f: (B, A) => B, g: (B, B) => B): B Discuss, as a group, what aggregate does and what its arguments represent. Implement aggregate... | preferences m1 | 17 |
Question: Consider an operation we will call scanRight1 that, given a function $f$ of two arguments, and a sequence $a_1, \ldots, a_N$, computes a sequence $b_1, \ldots, b_N$ such that: $b_N = a_N$ $b_i = f(a_{i}, b_{i+1})$, for $0 < i < N$ Define similarly scanLeft1 in a manner similar to scanRight1: Given a functio... | preferences m1 | 18 |
Question: As a group, write a function called minMax, which should take a non-empty array as input and return a pair containing the smallest and the largest element of the array. def minMax(a: Array[Int]): (Int, Int) = ??? Now write a parallel version of the function. You may use the constructs task and/or parallel, a... | preferences m1 | 19 |
Question: In this week's lecture, you have been introduced to the aggregate method of ParSeq[A] (and other parallel data structures). It has the following signature: def aggregate[B](z: B)(f: (B, A) => B, g: (B, B) => B): B Discuss, as a group, what aggregate does and what its arguments represent. Consider the paralle... | preferences m1 | 20 |
Question: In this week's lecture, you have been introduced to the aggregate method of ParSeq[A] (and other parallel data structures). It has the following signature: def aggregate[B](z: B)(f: (B, A) => B, g: (B, B) => B): B Discuss, as a group, what aggregate does and what its arguments represent. Consider the paralle... | preferences m1 | 21 |
Question: Imagine that the data structure you are given, instead of an Array[A], is one called ParSeq[A]. This class offers the two following methods, which work in parallel: def map[B](f: A => B): ParSeq[B] def reduce(f: (A, A) => A): A Can you write the following minMax function in terms of map and/or reduce operati... | preferences m1 | 22 |
Question: In JOS, suppose one Env sends a page to another Env. Is the page copied?, Answer: ['No'] | preferences m1 | 23 |
Question: In JOS and x86, please select all valid options for a system call., Answer: ['In user mode, before and after a system call instruction(such as int 0x30), the stack pointer(esp in x86) stays the same.'] | preferences m1 | 24 |
Question: Concatenating two conc-trees of heights $h_1$ and $h_2$ yields a conc-tree with
height $h$ where, Answer: $|h - \max(h_1, h_2)| \leq 1$ | preferences m1 | 25 |
Question: What are the drawbacks of non-preemptive scheduling compared to preemptive scheduling?, Answer: ['It can lead to starvation especially for those real-time tasks', 'Bugs in one process can cause a machine to freeze up', 'It can lead to poor response time for processes'] | preferences m1 | 26 |
Question: Select valid answers about file descriptors (FD):, Answer: ['FD is usually used as an argument for read and write.', 'FDs are preserved after fork() and can be used in the new process pointing to the original files.'] | preferences m1 | 27 |
Question: What is the default block size for a traditional file system, e.g. ext3/4?, Answer: ['4096 bytes'] | preferences m1 | 28 |
Question: Suppose a file system used only for reading immutable files in random fashion. What is the best block allocation strategy?, Answer: ['Continuous allocation'] | preferences m1 | 29 |
Question: Consider the following contains function defined on Iterable (in particular, it accepts both Vector and List). def contains[A](l: Iterable[A], elem: A): Boolean = val n = l.size if n <= 5 then for i <- l do if i == elem then return true false else val (p0, p1) = parallel( ... | preferences m1 | 30 |
Question: Consider the following contains function defined on Iterable (in particular, it accepts both Vector and List). def contains[A](l: Iterable[A], elem: A): Boolean = val n = l.size if n <= 5 then for i <- l do if i == elem then return true false else val (p0, p1) = parallel( ... | preferences m1 | 31 |
Question: Which of the following operations would switch the user program from user space to kernel space?, Answer: ['Dividing integer by 0.', 'Invoking read() syscall.', 'Jumping to an invalid address.'] | preferences m1 | 32 |
Question: We have a collection of rectangles in a plane, whose sides are aligned with the coordinate axes. Each rectangle is represented by its lower left corner $(x_1,y_1)$ and its upper right corner $(x_2,y_2)$. All coordinates are of type Long. We require $x_1 \le x_2$ and $y_1 \le y_2$. How can the result be comput... | preferences m1 | 33 |
Question: Consider an operation we will call scanRight1 that, given a function $f$ of two arguments, and a sequence $a_1, \ldots, a_N$, computes a sequence $b_1, \ldots, b_N$ such that: $b_N = a_N$ $b_i = f(a_{i}, b_{i+1})$, for $0 < i < N$ Define similarly scanLeft1 in a manner similar to scanRight1: Given a function... | preferences m1 | 34 |
Question: What is the complexity of concatenation of two conc-trees with heights $h_1$ and
$h_2$?, Answer: $\Theta(|h_1 - h_2|)$ | preferences m1 | 35 |
Question: What property does the function f passed to reduce need to satisfy in order to have the same result regardless on how reduce groups the applications of the operation f to the elements of the data structure? Prove that your function f indeed satisfies that property., Answer: The function f must be associative.... | preferences m1 | 36 |
Question: To support very large scale neural networks in limited amount of memory, one may want to use floating point numbers with very few bits. Here we consider substantially simplified operations on such numbers, Float8. A value Float8(mant,exp) represents the non-negative integer mant * 2^exp. We call mant a mantis... | preferences m1 | 37 |
Question: We have a collection of rectangles in a plane, whose sides are aligned with the coordinate axes. Each rectangle is represented by its lower left corner $(x_1,y_1)$ and its upper right corner $(x_2,y_2)$. All coordinates are of type Long. We require $x_1 \le x_2$ and $y_1 \le y_2$. Define an operation hull2 th... | preferences m1 | 38 |
Question: Review the notion of depth seen in the lecture. What does it represent? Below is a formula for the depth of a divide and conquer algorithm working on an array segment of size $L$, as a function of $L$. The values $c$, $d$ and $T$ are constants. We assume that $L>0$ and $T>0$. $$ D(L) = \begin{cases} c \cdot ... | preferences m1 | 39 |
Question: In this week's lecture, you have been introduced to the aggregate method of ParSeq[A] (and other parallel data structures). It has the following signature: def aggregate[B](z: B)(f: (B, A) => B, g: (B, B) => B): B Discuss, as a group, what aggregate does and what its arguments represent. Implement aggregate ... | preferences m1 | 40 |
Question: Which flag prevents user programs from reading and writing kernel data?, Answer: ['PTE_U'] | preferences m1 | 41 |
Question: In JOS, after finishing the execution of a user-level page fault handler, how is the program control flow transferred back to the program? (You may get insights from the code snippet of _pagefault_upcall.), Answer: ['The control flow will be transferred to Env that caused the page fault directly.'] | preferences m1 | 42 |
Question: What is the content of the superblock in the JOS file system?, Answer: ['Total number of blocks on disk', 'Magic number identifying the file system', "Node with the root directory ('/')"] | preferences m1 | 43 |
Question: Consider an operation we will call scanRight1 that, given a function $f$ of two arguments, and a sequence $a_1, \ldots, a_N$, computes a sequence $b_1, \ldots, b_N$ such that: $b_N = a_N$ $b_i = f(a_{i}, b_{i+1})$, for $0 < i < N$ Define similarly scanLeft1 in a manner similar to scanRight1: Given a functio... | preferences m1 | 44 |
Question: Freshly graduated from EPFL, you have been hired as contractors for a successful and rapidly growing bank. The bank has been experiencing problems with their money management system recently, which is written in Scala, and so they hired the best and brightest young engineer they could find: you! The system ha... | preferences m1 | 45 |
Question: In which of the following cases does the TLB need to be flushed?, Answer: ['Deleting a page from the page table.', 'Changing the read/write permission bit in the page table.'] | preferences m1 | 46 |
Question: Select all valid answers about UNIX-like shell., Answer: ['The shell is a program, that runs in user-space.', 'The shell is a program, which reads from standard input.', 'The shell is a user interface for UNIX-like systems.'] | preferences m1 | 47 |
Question: Review the notion of depth seen in the lecture. What does it represent? Below is a formula for the depth of a divide and conquer algorithm working on an array segment of size $L$, as a function of $L$. The values $c$, $d$ and $T$ are constants. We assume that $L>0$ and $T>0$. $$ D(L) = \begin{cases} c \cdot... | preferences m1 | 48 |
Question: In x86, select all synchronous exceptions?, Answer: ['Divide error', 'Page Fault'] | preferences m1 | 49 |
Question: To support very large scale neural networks in limited amount of memory, one may want to use floating point numbers with very few bits. Here we consider substantially simplified operations on such numbers, Float8. A value Float8(mant,exp) represents the non-negative integer mant * 2^exp. We call mant a mantis... | preferences m1 | 50 |
Question: Once paging is enabled, load instruction / CR3 register / Page Table entry uses Virtual or Physical address?, Answer: ['Virtual / Physical / Physical'] | preferences m1 | 51 |
Question: Which of the execution of an application are possible on a single-core machine?, Answer: ['Concurrent execution'] | preferences m1 | 52 |
Question: Which of the following lock acquisition orders (locks are acquired from left to right), for thread 1 (T1) and thread 2 (T2), will result in a deadlock ? Assume that A, B, C, D are lock instances., Answer: ['T1: A,B,C,D T2: D,C,B,A', 'T1: A,B,C,D T2: E,B,A,F'] | preferences m1 | 53 |
Question: There are N philosphers sitting around a circular table eating spaghetti and discussing philosphy. The problem is that each philosopher needs two forks to eat, and there are only $N$ forks, one between each pair of philosophers. We want to design an algorithm that the philosophers can use, that ensures that n... | preferences m1 | 54 |
Question: In an x86 multiprocessor system with JOS, select all the correct options. Assume every Env has a single thread., Answer: ['Two Envs could run on two different processors simultaneously.', 'One Env could run on two different processors at different times.'] | preferences m1 | 55 |
Question: Freshly graduated from EPFL, you have been hired as contractors for a successful and rapidly growing bank. The bank has been experiencing problems with their money management system recently, which is written in Scala, and so they hired the best and brightest young engineer they could find: you! The system ha... | preferences m1 | 56 |
Question: In this week's lecture, you have been introduced to the aggregate method of ParSeq[A] (and other parallel data structures). It has the following signature: def aggregate[B](z: B)(f: (B, A) => B, g: (B, B) => B): B Discuss, as a group, what aggregate does and what its arguments represent. Discuss the implemen... | preferences m1 | 57 |
Question: Consider the following contains function defined on Iterable (in particular, it accepts both Vector and List). def contains[A](l: Iterable[A], elem: A): Boolean = val n = l.size if n <= 5 then for i <- l do if i == elem then return true false else val (p0, p1) = parallel( ... | preferences m1 | 58 |
Question: In JOS, suppose a value is passed between two Envs. What is the minimum number of executed system calls?, Answer: ['2'] | preferences m1 | 59 |
Question: What strace tool does?, Answer: ['It prints out system calls for given program. These systems calls are called only for that particular instance of the program.'] | preferences m1 | 60 |
Question: Consider the following grammar:
S -> NP VP
NP -> Det N
VP -> VBe Adj
NP -> NP PP
VP -> V
N -> Adj N
VP -> VP PP
Adj -> Adj PP
V -> VBe
Adj -> Ving
PP -> Prep NP
and the following lexicon:
at:Prep is:VBe old:Adj
black:Adj looking:Ving the:Det
cat:N mouse:N under:Prep
former:Adj nice:Adj with:Prep
The abov... | preferences m1 | 61 |
Question: The goal of this question is to illustrate how to use transducers to implement a simplified version of the conjugation of English verbs. We will restrict to the conjugated forms corresponding to the indicative mode and the present tense.
The idea is to build a transducer corresponding to the composition of th... | preferences m1 | 62 |
Question: According to your knowledge of English, split the following sentence into words and punctuation:
M. O'Connel payed $ 12,000 (V.T.A. not included) with his credit card.
Which of these words won't usually be in a standard lexicon? Justify your answer. Assuming separators are: whitespace, quote ('), full-stop/p... | preferences m1 | 63 |
Question: Consider the following context-free grammar \(G\) (where \(\text{S}\) is the top-level symbol):
\(R_{01}: \text{S} \rightarrow \text{NP VP}\)
\(R_{02}: \text{NP} \rightarrow \text{NP0}\)
\(R_{03}: \text{NP} \rightarrow \text{Det NP0}\)
\(R_{04}: \text{NP0} \rightarrow \text{N}\)
\(R_{05}: \text{NP0} \rightar... | preferences m1 | 64 |
Question: Explain the difference between inflectional and derivational morphology. Illustrate your explanation with concrete examples in English or French., Answer: inflectional morphology: no change in the grammatical category (e.g. give, given, gave, gives ) derivational morphology: change in category (e.g. process, ... | preferences m1 | 65 |
Question: Select the answer that correctly describes the differences between formal and natural languages. , Answer: ['Formal languages are by construction explicit and non-ambiguous while natural languages are implicit and ambiguous'] | preferences m1 | 66 |
Question: You have been hired to evaluate an email monitoring system aimed at detecting potential security issues. The targeted goal of the application is to decide whether a given email should be further reviewed or not. You have been given the results of three different systems that have been evaluated on the same pa... | preferences m1 | 67 |
Question: In an automated email router of a company, we want to make the distinction between three kind of
emails: technical (about computers), financial, and the rest ('irrelevant'). For this we plan to use a
Naive Bayes approach.
What is the main assumption made by Naive Bayes classifiers? Why is it 'Naive'?
We will... | preferences m1 | 68 |
Question: Which of the following are parameters involved in the choice made by an order-1 HMM model for PoS tagging knowing that its output isthis/Pron is/V a/Det good/Adj question/Nand that neither "is" nor "question" can be adjectives, and that "question" can also not be a determiner.(Penalty for wrong ticks.), Answe... | preferences m1 | 69 |
Question: For each of the sub-questions of this question (next page), tick/check the corresponding box if the presented sentence is correct
at the corresponding level (for a human). There will be a penalty for wrong boxes ticked/checked.Some sentences is hard understand to., Answer: ['lexical'] | preferences m1 | 70 |
Question: You have been hired to evaluate an email monitoring system aimed at detecting potential security issues. The targeted goal of the application is to decide whether a given email should be further reviewed or not. You have been given the results of three different systems that have been evaluated on the same pa... | preferences m1 | 71 |
Question: Select the morpho-syntactic categories that do not carry much semantic content and are thus usually filtered-out from indexing., Answer: ['Determiners\xa0', 'Conjunctions'] | preferences m1 | 72 |
Question: Consider the following CFG
\(\text{S} \rightarrow \text{NP VP PNP}\)
\(\text{NP} \rightarrow \text{Det N}\)
\(\text{NP} \rightarrow \text{Det Adj N}\)
\(\text{VP} \rightarrow \text{V}\)
\(\text{VP} \rightarrow \text{Aux Ving}\)
\(\text{VP} \rightarrow \text{VP NP}\)
\(\text{VP} \rightarrow \text{VP PNP}\)
\(... | preferences m1 | 73 |
Question: Give well chosen examples of applications that can be evaluated with the single metric derived from Precision/Recall and illustrate:
• a situation where more weight should be given to Precision;
• a situation where more weight should be given to Recall., Answer: Precision is prefered when very large amount of... | preferences m1 | 74 |
Question: The company finally decides to implement a hybrid model consisting of a 4-gram character model combined (independently) with a 3-gram word model.How many parameters would such a hybrid model have in total?Provide the answer in the form 10^A + 10^B (for instance, write "10^7 + 10^9")., Answer: ['answer should ... | preferences m1 | 75 |
Question: Give some concrete examples of NLP applications that might benefit from the semantic vectorial representations., Answer: Any NLP application that requires the assessment of the semantic proximity between textual entities (text, segments, words, ...) might benefit from the semantic vectorial representation. In... | preferences m1 | 76 |
Question: Consider the following lexicon \(L\):
boy : Adj, N
boys : N
blue : Adj, N
drink : N, V
drinks : N, V
Nice : Adj, N
When using an order-1 HMM model (using \(L\)) to tag the word sequence:"Nice boys drink blue drinks"does the tag of drink depend on the tag of nice?
, Answer: ['no, the hypotheses mak... | preferences m1 | 77 |
Question: Up to which linguistic processing level can each of the following sentences be considered as correct? The glass broke its leg, I no go rain, The cook put cherry stones in the cake, Cars flow beautifully; syntactic, pragmatic, syntactic, semantic, lexical, Answer: [['Cars flow beautifully', 'syntactic'], ['The... | preferences m1 | 78 |
Question: Describe the main principles of the standard vector space model for semantics., Answer: The standard approach to vector semantics can be decomposed into two mains steps:
\begin{itemize}
\item the indexing (or desequalization) phase: during this phase, the documents for which a vectorial semantic representa... | preferences m1 | 79 |
Question: You are responsible for a project aiming at providing on-line recommendations to the customers of
a on-line book selling company.
The general idea behind this recommendation system is to cluster books according to both customers
and content similarities, so as to propose books similar to the books already bou... | preferences m1 | 80 |
Question: If there are {t} PoS tags, what is the maximum number of (not necessarily free) parameters the probabilistic model needs to consider to determine the best possible PoS tag sequence given a word sequence of length {w}, subjected to the limited lexical conditioning and limited scope for syntactic dependencies (... | preferences m1 | 81 |
Question: Select the statements that are true.A penalty will be applied to any incorrect answers selected., Answer: ['Information retrieval is the selection of documents relevant to a query from an unstructured collection of documents.', 'Different IR systems can differ in the way they represent documents, represent qu... | preferences m1 | 82 |
Question:
Your aim is to evaluate a movie review analysis system, the purpose of which is to determine whether a review is globally positive or negative.
For each movie review, such a system outputs one of the following classes: positive and negative.
To perform your evaluation, you collect a large set of reviews and ... | preferences m1 | 83 |
Question: You have been publishing a daily column for the Gazette over the last few years and have recently reached a milestone --- your 1000th column! Realizing you'd like to go skiing more often, you decide it might be easier to automate your job by training a story generation system on the columns you've already wri... | preferences m1 | 84 |
Question: For each of the following pairs, what kind of morphology is involved? cat+N => cats, break+V => breakable , freeze+V => frozen , translate+V => translation, modify+V => modifies ; inflectional, inflectional, derivational, inflectional, derivational, Answer: [['break+V => breakable\xa0', 'derivational'], ['fre... | preferences m1 | 85 |
Question: The first annotator rated {a} reviews as positive and the rest as negative. The second annotator rated {b} reviews as positive and the rest as negative. 80 reviews were rated as positive by both annotators. Compute the quality of the above reference using Cohen's Kappa.Give your answer as a numerical value to... | preferences m1 | 86 |
Question: You have been publishing a daily column for the Gazette over the last few years and have recently reached a milestone --- your 1000th column! Realizing you'd like to go skiing more often, you decide it might be easier to automate your job by training a story generation system on the columns you've already wri... | preferences m1 | 87 |
Question: Consider the following context-free grammar \(G\) (where \(\text{S}\) is the top-level symbol):
\(R_{01}: \text{S} \rightarrow \text{NP VP}\)
\(R_{02}: \text{NP} \rightarrow \text{NP0}\)
\(R_{03}: \text{NP} \rightarrow \text{Det NP0}\)
\(R_{04}: \text{NP0} \rightarrow \text{N}\)
\(R_{05}: \text{NP0} \rightar... | preferences m1 | 88 |
Question: Select all statements that are true.A penalty will be applied for any wrong answers., Answer: ['The analyzer functionality of a parser determines the set of all possible associated syntactic structures for any syntactically correct sentence.', 'The recognizer functionality of a parser decides if a given seque... | preferences m1 | 89 |
Question: The edit distance between “piece” and “peace” is(Penalty for wrong ticks), Answer: ['2, if considering insertion and deletion only', '2, if considering insertion, deletion and substitution', '2, if considering insertion, deletion, transposition and substitution'] | preferences m1 | 90 |
Question: It is often desirable to be able to express the performance of an NLP system in the form of a
single number, which is not the case when the Precision/Recall framework is used.
Indicate what scores can be used to convert Precision/Recall measures into a unique number.
For each score, give the corresponding for... | preferences m1 | 91 |
Question: Consider an HMM Part-of-Speech tagger, the tagset of which contains, among others: DET, N, V, ADV and ADJ, and some of the parameters of which are:
$$
\begin{gathered}
P_{1}(\mathrm{a} \mid \mathrm{DET})=0.1, \quad P_{1}(\text { accurately } \mid \mathrm{ADV})=0.1, \quad P_{1}(\text { computer } \mid \mathrm... | preferences m1 | 92 |
Question: What are the different types of morphologies that can be considered? Briefly describe the main differences between them., Answer: inflectional morphology: no change in the grammatical category (e.g. give, given, gave, gives ) derivational morphology: change in category (e.g. process, processing, processable, ... | preferences m1 | 93 |
Question: Consider the following context-free grammar, where S is the top-level symbol, upper-case letters denotes non-terminals and lower case letters denotes terminals:S → T A
S → B A
S → A B
S → b
A → A C
A → a
T → A B
B → b
C → c
Except the first one, the next questions are based on filling the cells of the ch... | preferences m1 | 94 |
Question: In the above, what is the chance agreement between the two annotators?Give your answer as a numerical value to three decimal places., Answer: ['(({a}*{b})/(1000*1000))+((1000-{a})*(1000-{b}))/(1000*1000)'] | preferences m1 | 95 |
Question: You have been hired to evaluate an email monitoring system aimed at detecting potential security issues. The targeted goal of the application is to decide whether a given email should be further reviewed or not. Give four standard measures usually considered for the evaluation of such a system? Explain their ... | preferences m1 | 96 |
Question: Consider the following toy corpus: the cat cut the hat
What is the probability of the following sequences, if the parameters are estimated using MLE
(maximum-likelihood estimation) on the above corpus (make use of a calculator or even a
short program):
- cutthechat
- cut the chat
Fully justify your answer., A... | preferences m1 | 97 |
Question: Select which statements are true about the CYK algorithm.A penalty will be applied for any incorrect answers., Answer: ['Its time complexity is \\( O(n^3) \\), where\xa0\\( n \\) is the length of sequence of words to be parsed.', 'The Context-Free Grammar used with the CYK algorithm has to be converted into e... | preferences m1 | 98 |
Question: Select all statements that are true.A penalty will be applied for any wrong answers., Answer: ['Phrase-structure grammars are relatively better suited for fixed-order languages than free-order languages.', 'Dependency grammars describe functional dependencies between words in a sequence.', 'Any context-free g... | preferences m1 | 99 |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 5