A context free grammar G is said to be ambiguous ,if there exists some w belongs to L(G) that has at least 2 distinct derivation trees.
If every grammar that generate L is ambiguous then language is called inherently ambiguous ...eg for inherently grammar is L= {a^nb^nc^m}∪{a^nb^mc^m}
http://infolab.stanford.edu/~ullman/ialc/slides/slides7.pdf