Constituent parsing

Abstract

In the previous chapters, we used Prolog’s built-in search mechanism and the DCG notation to parse sentences and constituents. This search mechanism has drawbacks, however. To name some of them: its depth-first strategy does not handle left-recursive rules well, and backtracking is sometimes inefficient. In addition, if DCGs are appropriate to describe constituents, we haven’t seen means to parse dependencies until now.