<< Prev | - Up - | Next >> |
So far, we've looked at pure context-free grammars in which categories are atoms. In contemporary computational linguistics however, most grammars are feature-based that is, they have categories that are feature terms (rather than atoms). In this section, we discuss first, how to implement feature-based grammars (also called, unification-based grammars as unification is the main operation used for comparing and combining categories) and second, how to implement a chart parser for such grammars.
<< Prev | - Up - | Next >> |