The question reads:
Using K. Oflazer 1996 spelling error correction algorithm presented in class, the
correction of some input string X with a threshold θ = 2 will visit at least...
I think the correct answer would be the 3 options bellow:
- all the strings in the lexicon that are at distance 1 from X
- all the strings in the lexicon that are at distance 2 from X
- all the strings in the lexicon that are at distance 3 from X
, because there is no "early stopping", and only after looking at "distance 3" strings can the algorithm know that any string derived from those would have distance > θ, thus ending its execution. Is this correct?
Thank you!