In chart parsing, much of the time is expended to find the edge that satisfies some conditions. So reducing the number of edges properly makes the parser more efficient. In this thesis, new parsing mechanism is introduced which is based on the property 'governer post-positioning principle' and 'No Crossing condition'. No Crossing concept is used in Dependency grammar. The new parsing mechanism is called 'right-corner chart parser' and it is compared with the currently-being used parsing mechanism 'legtcorner chart parser'. As a result we found that new parsing mechanism reduces the number of edges generated and also it reduces parsing time because new parsing mechanism uses headable path instead of searching all the edges generated.
The emperical result shows that the additional edge generated in left corner chart parser is about 10 - 30 percent and right-corner chart parser is more faster than left corner chart parser according to the number of edges generated.
