Information-based syntax and semantics: Vol. 1: fundamentals
Information-based syntax and semantics: Vol. 1: fundamentals
Dependency Unification Grammar
COLING '86 Proceedings of the 11th coference on Computational linguistics
An efficient natural language processing system specially designed for the Chinese language
Computational Linguistics
Review of "Natural language parsing systems" by Leonard Bolc. Springer-Verlag 1987.
Computational Linguistics
The complexity of recognition of linguistically adequate dependency grammars
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Concurrent lexicalized dependency parsing: the ParseTalk model
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
Concurrent lexicalized dependency parsing: a behavioral view on ParseTalk events
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
On the acquisition of conceptual definitions via textual modelling of meaning paraphrases
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 4
Semiautomatic interactive multilingual style analysis (SIMSA)
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 1
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
Word order and discontinuities in dependency grammar
Acta Cybernetica
| Hi-index | 0.00 |
A parser is an algorithm that assigns a structural description to a string according to a grammar. It follows from this definition that there are three general issues in parser design: the structure to be assigned, the type of grammar, the recognition algorithm. Common parsers employ phrase structure descriptions, rule-based grammars, and derivation or transition oriented recognition. The following choices result in a new parser: The structure to be assigned to the input is a dependency tree with lexical, morpho-syntactic and functional-syntactic information associated with each node and coded by complex categories which are subject to unification. The grammar is lexicalized, i.e. the syntactical relationships are stated as part of the lexical descriptions of the elements of the language. The algorithm relies on the slot and filler principle in order to draw up complex structures. It utilizes a well-formed substring table (chart) which allows for discontinuous segments.