Hi
I just took a quiz and have some questions.
My understanding is that we have to compute the minimum edit distance for all the words in the vocabulary, so if we have a large vocabulary, it’s going to take a while, right?
I just took a quiz. It said that the computational time depends only on the cost of operation and the two words being considered.
This makes me confused. Could someone clarify this for me?
It is not wrong to say that on a word level (and not the whole vocab), the computation time is depending on the cost of operation and the two words. If the same is repeated on the whole vocab, then the total computation scales accordingly. Can you please share the link in which this question was asked?
Yes, thanks for your reply.
It is the question asked in the week 1 quiz.
Can I share it? If I am not mistaken, the content of the quiz or lab can not be shared around here.
please share it to me privately.
@DavidBetterFellow Please let other learners know here if you were able to solve your query and if so, what was your final understanding of it.
The computation time mostly consists of computing the edits - it grows exponentially with longer words and more edits allowed (for example, the number edit candidates might be on the magnitudes higher than the initial vocabulary).
Comparing the edits with the vocabulary takes way less time if done efficiently (making use of efficient sort).
Cheers