Abstract
The paper illustrates the suitability of the dependency approach in practical applications of NLP. We introduce a compact representation called dependency graph, produced by an all-path left-to-right parser for a dependency grammar. The dependency graph keeps all the syntactic trees of a sentence in a single structure, thus allowing an economy of representation and an easier comparison between the alternative paths for the semantic processor.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Baggia P., Gerbino E., Giachin E., Rullent C., Real-time linguistic analysis for continuous speech understanding, Proceedings of ANLP 92, Trento (Italy), 1992, pp. 33–39.
Church K., Patil R., Coping with Syntactic Ambiguity or How to Put the Block in the Box on the Table, Computational Linguistics 8-4, 1982, pp. 139–149.
Church K., Gale W., Hanks P., Hindle D., Parsing, word associations, and predicate-argument relations, Proceedings of the International Workshop on Parsing Technology, CMU, 1989.
Proceedings of the Symposium on Discontinuous Constituency, Institute for Language Technology and Artificial Intelligence, Tilburg University, Tilburg, The Netherlands, January 25–27, 1990.
Gaifman H., Dependency Systems and Phrase Structure Systems, Information and Control 8, 1965, pp. 304–337.
Giachin E., Rullent C., Real-time linguistic analysis for continuous speech understanding, Proceedings of IJCAI 89, Detroit, 1989.
Jacobs P. S., Parsing Run Amok: Relation-Driven Control for Text Analysis, Proceedings of AAAI 92, San Jose' (CA), 1992, pp. 315–321.
Jacobs P. S., Rau L.F., Innovations in Text Interpretation, Artificial Intelligence 63, 1993, pp. 143–192.
Johnson R., King M., des Tombe L., EUROTRA: a Multilingual System under Development, Computational Linguistics 11-3, 1985, pp. 155–169.
Kay M., Algorithm schemata and data structures in syntactic processing, in Readings in Natural Language Processing, edited by B. J. Grosz, K. Sparck-Jones, and B. L. Webber, pp. 35–70, 1995. Morgan Kaufmann.
Kittredge R., Polguere A., Dependency Grammars for Bilingual Text Generation: Inside FoG's Stratificational Models, Proc. of the Int. Conf. on Current Issues in Comp. Linguistics, 1991, pp. 318–330.
Lesmo L., Lombardo V., The assignment of grammatical relations in natural language processing, Proceedings of COLING 92, Nantes, 1992, pp. 1090–1094.
Lombardo V., Parsing and Recovery, to appear in Proc. 17th Annual Meeting of the Cognitive Science Society, Pittsburgh, July 1995.
Lombardo V., Barbero C., Syntactic Trees and Compact Representations in Natural Language Processing, Proceedings of the 6th International Conference on AI: Methodology, Systems, Applications, Sofia, Bulgaria, 1994, pp. 333–342.
Lombardo V., Lesmo L., A Compact Syntactic Representation, in Martin-Vide C. (editor), Current Issues in Mathematical Linguistics, Elsevier Science B.V., 1994, pp. 191–200.
MacWhinney B., Bates E., Kliegl R., Cue validity and sentence interpretation in English, German and Italian, Journal of Verbal Learning and Verbal Behavior 23, 1984, pp. 127–150.
Maruyama H., Structural Disambiguation with Constraint Propagation, Proceedings of ACL 90, 1990, pp. 31–38.
Matthews P. H., Syntax, Cambridge University Press, 1981.
Maxwell J.T., Kaplan R.M., The Interface between Phrasal and Functional Constraints, Computational Linguistics, December 1993.
Mel'cuk I., Dependency Syntax: Theory and Practice, NYSU Press, New York, 1988.
Rainbow O., Korelsky T., Applied Text Generation, Proceedings of ANLP 92, Trento (Italy), 1992, pp. 40–47.
Renzi L., Grande Grammatica Italiana di Consultazione, Bologna:Il Mulino, 1988.
Seo J., Simmons R. F., Syntactic Graphs: A representation for the Union of All Ambiguous Parse Trees, Computational Linguistics 15/1, 1989, pp. 19–32.
Sgall P., Haijcova E., Panevova J., The Meaning of the Sentence in its Semantic and Pragmatic Aspects, D. Reidel Publishing Company, 1986.
Stock O., Parsing with Flexibility, Dynamic Strategies, and Idioms in Mind, Computational Linguistics 15, 1989, pp. 1–18.
Tesniere L., Elements de syntaxe structurale, Klincksieck, Paris, 1959.
Tomita M., An Efficient Augmented-Context-Free Parsing Algorithm, Computational Linguistics 13, 1987, pp. 31–46.
Wiren M., A Comparison of Rule-Invocation Strategies in Context-free Chart Parsing, Proceedings of EACL 87, 1987, pp. 226–233.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barbero, C., Lombardo, V. (1995). Dependency graphs in natural language processing. In: Gori, M., Soda, G. (eds) Topics in Artificial Intelligence. AI*IA 1995. Lecture Notes in Computer Science, vol 992. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60437-5_11
Download citation
DOI: https://doi.org/10.1007/3-540-60437-5_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60437-2
Online ISBN: 978-3-540-47468-5
eBook Packages: Springer Book Archive