Abstract
The paper deals with a parser for dependency grammars. An intuitive and clear representation of the grammar is introduced: the formalism, that originates from the ID/LP constituency grammar, expresses the constraints of well-formedness of the sentences via two tables of relations of immediate dominance and linear precedence for pairs of syntactic categories. The tables are then compiled in order to generate information structures, called diamonds, that guide the parsing process, whose overall control strategy is described by an algorithm of navigation among the diamond structures. In the paper the grammar for a fragment of Italian is presented: this natural language, because of its high degree of freedom in the sentential order, reveals to be suitable for a dependency analysis.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Barton G.E., Berwick R.C., Ristad E.S., Computational Complexity and Natural Language, The MIT Press, Cambridge, Mass., 1987.
Earley J., An Efficient Context-Free Parsing Algorithm, Communications of the ACM 13 (2), 1970.
Eisele A., Dorre J., A Lexical Functional Grammar System in Prolog, Proceedings COLING 86, Bonn, 1986.
Gazdar G., Klein E., Pullum G., Sag I., Generalizad Phrase Structure Grammar, Basil Blackwell, Oxford, 1985.
Hudson R., Word Grammar, Basil Blackwell, Oxford, 1984.
Kac M.B., Manaster-Ramer A., Parsing Without (Much) Phrase Structure, Proceedings COLING 86, Bonn, 1986.
Lesmo L., Lombardo V., A Dependency Syntax for the Surface Structure of Sentences, to appear in proceedings of the WOCFAI Conference, July 1991.
Lesmo L., Torasso P., A Flexible Natural Language Parser based on a two-level Representation of Syntax, Proc. of the 1st Conference EACL, Pisa, Italy, 1983, pp.114–121.
Mel'cuk I., Dependency Syntax: Theory and Practice, State University of New York Press, Albany, NY, 1987.
Nelimarkka E., Jappinen H., Lehtola A., Parsing an Inflectional Free-Word-Order Language with Two-Way Finite Automata, ECAI-84: Advances in Artificial Intelligence, North Holland, 1984.
Pollard C.J., Generalized Phrase Structure Grammars, Head Grammars, and Natural Language, Ph.D. Thesis, Stanford University, 1984.
Sgall P., Haijcova E., Panevova J., The Meaning of the Sentence in its Semantic and Pragmatic Aspects, D. Reidel Publishing Company, 1986.
Sgall P., Panevova J., Dependency Syntax — A Challenge, Theoretical Linguistics, vol.15, No. 1/2, 1989.
Shieber S.M., Direct Parsing of ID/LP Grammars, Technical Note 291R, SRI International, November 1983 (also in Linguistics and Philosophy, vol.7, issue2).
Warren D.H.D., Pereira F.C.N., Definite Clause Grammars for Language Analysis — A Survey of the Formalism and a Comparison with Augmented Transition Networks, in Artificial Intelligence 13, 1980.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lombardo, V. (1991). Parsing dependency grammars. In: Ardizzone, E., Gaglio, S., Sorbello, F. (eds) Trends in Artificial Intelligence. AI*IA 1991. Lecture Notes in Computer Science, vol 549. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54712-6_241
Download citation
DOI: https://doi.org/10.1007/3-540-54712-6_241
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54712-9
Online ISBN: 978-3-540-46443-3
eBook Packages: Springer Book Archive