Name
Abstract | ||
|---|---|---|
In order to resolve the problem of low accuracy in Chinese natural language parsing introduced by the lack of complete grammar rules set, a Binary Combinatorial Grammar (BCG) for describing natural language through binary relations between constituents is proposed, which can depict complicated syntactic structures by a very small number of binary relations between head words and their hierarchical combinations. Based on the Binary Combinatorial Grammar, a parsing algorithm for Chinese natural language is proposed which takes operator precedence computing as its basic ideas. Four basic operations and one extended operation are defined in the algorithm. The order of combinatorial operations in parsing is controlled according to the priority between adjacent binary relations, and eventually the recognition of chunks and whole syntactic structures is achieved. The validity of the grammar and the parsing algorithm is proved by the analysis of the space complexity and the time complexity. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/ISDA.2006.253708 | ISDA (2) |
Keywords | Field | DocType |
binary relation,binary relations,computational complexity,space complexity,grammars,time complexity,natural language processing,natural language | Top-down parsing language,Top-down parsing,S-attributed grammar,Computer science,Algorithm,Bottom-up parsing,Parsing expression grammar,Artificial intelligence,Natural language processing,Parser combinator,Parsing,Mildly context-sensitive grammar formalism | Conference |
Volume | Issue | ISBN |
2 | null | 0-7695-2528-8 |
Citations | PageRank | References |
4 | 0.48 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiao Yang | 1 | 8 | 1.60 |
| Jiancheng Wan | 2 | 23 | 5.23 |
| Yongbo Qiao | 3 | 4 | 0.48 |