Computational Linguistics - Applied Linguistics (Linguistics in the Real World) - Linguistics Previous Year Questions

The assumption that the probability of occurrence of a word in a string depends ONLY on the preceding word is called a ______ assumption.

In a context-free grammar, the symbols that correspond to words in a language are called ______ symbols.

Levenshtein distance is used to measure the minimum edit distance between two strings by counting the minimum number of editing operations (such as, insertions, deletions, substitutions) required to transform one string to another. Consider an alternative version of the Levenshtein distance in which each insertion and each deletion has a cost of 1 and substitutions are not allowed.
Based on this alternative version, the Levenshtein distance between the strings, word and work is _____ (Answer in integer).

In a given collection of documents, let \(N\) be the total number of documents and let \(d\) be the number of documents in which the term \(t\) occurs.
Which ONE of the following fractions is used to define the inverse document frequency (idf) of the term \(t\)?