An efficient context-free parsing algorithm
Communications of the ACM
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Theory of Syntactic Recognition for Natural Languages
Theory of Syntactic Recognition for Natural Languages
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
A parsing algorithm that extends phrases
Computational Linguistics
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
D-theory: talking about talking about trees
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Stroing logical form in a shared-packed forest
Computational Linguistics
Critical tokenization and its properties
Computational Linguistics
Computational lexicons: the neat examples and the odd exemplars
ANLC '92 Proceedings of the third conference on Applied natural language processing
Ambiguity preserving machine translation using packed representations
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Syntactic graphs and constraint satisfaction
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Structural disambiguation with constraint propagation
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Transforming syntactic graphs into semantic graphs
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
JAUNT: a constraint solver for disjunctive feature structures
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 4
| Hi-index | 0.00 |
In this paper, we present a new method of representing the surface syntactic structure of a sentence. Trees have usually been used in linguistics and natural language processing to represent syntactic structures of a sentence. A tree structure shows only one possible syntactic parse of a sentence, but in order to choose a correct parse, we need to examine all possible tree structures one by one. Syntactic graph representation makes it possible to represent all possible surface syntactic relations in one directed graph (DG). Since a syntactic graph is expressed in terms of a set of triples, higher level semantic processes can access any part of the graph directly without navigating the whole structure. Furthermore, since a syntactic graph represents the union of all possible syntactic readings of a sentence, it is fairly easy to focus on the syntactically ambiguous points. In this paper, we introduce the basic idea of syntactic graph representation and discuss its various properties. We claim that a syntactic graph carries complete syntactic information provided by a parse forest---the set of all possible parse trees.