Given a string σ over alphabet Σ and a grammar G defined over the same alphabet, how many minimum number of repairs: insertions, deletions and substitutions are required to map σ into a valid member of G ? We consider this basic question, the language edit distance problem, in this work. The language edit distance problem has several applications ranging from error-correction in databases, compiler optimization, natural language processing to computational biology etc. In this talk we investigate how to design near-linear time algorithms for the language edit distance problem with respect to one of the fundamental context free languages, the Dyck language.