Abstract
Given a context free language, and an input string, language edit distance measures minimum number of insertions, deletions and substitutions required to map the string to any valid member of the language. In this talk, I will tell you what I have learnt playing with this problem: upper bounds, lower bounds, and their implications.