Formal languages
An efficient context-free parsing algorithm
Communications of the ACM
An efficient context-free parsing algorithm
An efficient context-free parsing algorithm
Coping with syntactic ambiguity or how to put the block in the box on the table
Computational Linguistics
On the complexity of ID/LP parsing 1
Computational Linguistics
Automated theorem proving: A logical basis (Fundamental studies in computer science)
Automated theorem proving: A logical basis (Fundamental studies in computer science)
Sentential semantics for propositional attitudes
Computational Linguistics
GPSG parsing, bidirectional charts, and connection graphs
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
| Hi-index | 0.00 |
An efficient algorithm is described for parsing a dialect of generalized phrase structure grammar (GPSG). A practical parsing system, based on the algorithm, is presented. The dialect of GPSG which the parsing system accepts is smaller, but considerably "purer" (closer to the original definition of GPSG) and mathematically "cleaner" than that which is accepted by other practical parsing systems. In particular, the parsing system correctly implements feature co-occurrence restrictions, subject only to the restriction that the FCR set can be expressed in clausal form as a set of Horn clauses.