I'm trying to understand "Edit Distance of Weighted Automata" by Mehryar Mohri: [83], [93] and [99] at http://www.cs.nyu.edu/~mohri/pub/ (they are virtually identical so which of them doesn't matter).

Could anyone help me understand the main differences between the algorithm for the tropical semiring and that for the probabilistic semiring?

Right now I could, maybe, basically explain what happens, but I can't explain the idea behind it. Thank you so much!

  • 3
    $\begingroup$ While this is not homework in the literal sense, it's the same in spirit. You have to make a presentation and you're asking for help "solving" it. Normally, this would be grounds for closing: however, you do have a very specific concrete question in the second paragraph. I'd recommend rephrasing the question to focus attention on that aspect (not on "summarizing the algorithm"), in which case it's a reasonable question to ask. $\endgroup$ – Suresh Venkat Jan 19 '11 at 21:19
  • $\begingroup$ I didn't know that homework is grounds for closing here. Other SE sites even have a "homework" tag. But yes, I'll edit it, thanks for the notice. $\endgroup$ – Felix Dombek Jan 19 '11 at 21:21
  • 2
    $\begingroup$ this site is for research-level questions, the policy is similar to MathOverflow. People asking homework level questions are directed to Math.SE and they are acceptable there. $\endgroup$ – Kaveh Jan 20 '11 at 0:47
  • $\begingroup$ I think the question is more focused and more reasonable now. $\endgroup$ – Suresh Venkat Jan 20 '11 at 4:16

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.