Abstract
In this paper, we propose a feature-based Korean grammar utilizing the learned constraint rules in order to improve parsing efficiency. The proposed grammar consists of feature structures, feature operations, and constraint rules; and it has the following characteristics. First, a feature structure includes several features to express useful linguistic information for Korean parsing. Second, a feature operation generating a new feature structure is restricted to the binary-branching form which can deal with Korean properties such as variable word order and constituent ellipsis. Third, constraint rules improve efficiency by preventing feature operations from generating spurious feature structures. Moreover, these rules are learned from a Korean treebank by a decision tree learning algorithm. The experimental results show that the feature-based Korean grammar can reduce the number of candidates by a third of candidates at most and it runs 1.5 ∼ 2 times faster than a CFG on a statistical parser.
Original language | English |
---|---|
Pages (from-to) | 69-89 |
Number of pages | 21 |
Journal | Computational Intelligence |
Volume | 21 |
Issue number | 1 |
DOIs | |
Publication status | Published - 2005 Feb |
Keywords
- Constraint rules
- Korean grammar
- Natural language processing
- Parsing algorithm
ASJC Scopus subject areas
- Computational Mathematics
- Artificial Intelligence