Skip to content
ml-recall

#longest-common-subsequence

1 question from NLP Fundamentals

Timed test

1 question · 1 min · score and explanations at the end

Take a test
Q 1 / 1Score 0 / 0

Question 1: Short answer

hardAI-checkedNLP Fundamentals

In one version of Levenshtein distance, insertions and deletions cost 1 and a substitution costs 2 (copying an identical letter costs 0). What is the distance between "listen" and "silent" under these costs?

a whole number