Tree-adjoining language parsing in o(n6) time

SIAM Journal on Computing

Volumn 25, Issue 4, 1996, Pages 862-873

  Rajasekaran, Sanguthevar ^a  

^a University of Florida   (United States)

Author keywords

Context free grammars; Natural language processing; Parallel algorithms; Parsing; Tree adjoining languages

Indexed keywords

EID: 0040386713     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S009753979326009X     Document Type: Article

References (20)

1. A. AHO AND J. D. ULLMAN, The Theory of Parsing, Translating, and Compiling, vol. 1, Addison-Wesley, Reading, MA, 1984.
2. D. COPPERSMITH AND S. WINOGRAD, Matrix multiplication via arithmetic progressions, in Proc. 19th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 1987, pp. 1-6; J. Symbolic Comput., 9 (1990), pp. 251-280.
3. D. COPPERSMITH AND S. WINOGRAD, Matrix multiplication via arithmetic progressions, in Proc. 19th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 1987, pp. 1-6; J. Symbolic Comput., 9 (1990), pp. 251-280.
4. G. GAZDAR, Applicability of indexed grammars to natural languages, Technical report CSLI-85-34, Center for Study of Language and Information, Stanford University, Stanford, CA, 1985.
5. S. L. GRAHAM, M. A. HARRISON, AND W. L. RUZZO, On line context free language recognition in less than cubic time, in Proc. 8th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 1976, pp. 112-120.
6. 5) recognition algorithm for coupled parenthesis rewriting systems, in Proc. TAG+ Workshop, University of Pennsylvania Press, Philadelphia, 1992.
7. K. HARBUSCH, An efficient parsing algorithm for tree adjoining grammars, in Proc. 28th Meeting of the Association for Computational Linguistics, Morgan Kaufmann, San Francisco, 1990, pp. 284-291.
8. J. JÁ JÁ, An Introduction to Parallel Algorithms, Addison-Wesley, Reading, MA, 1992, p. 248.
9. A. K. JOSHI, How much context-sensitivity is necessary for characterizing structural descriptions: Tree adjoining grammars, in Natural Language Processing: Theoretical, Computational and Psychological Perspective, D. Dowty, L. Karttunen, and A. Zwicky, eds., Cambridge University Press, New York, 1985, pp. 112-133.
10. A. K. JOSHI, L. S. LEVY, AND M. TAKAHASHI, Tree adjunct grammars, J. Comput. System Sci., 10 (1975), pp. 136-163.
11. A. KROCH AND A. K. JOSHI, Linguistic relevance of tree adjoining grammars, Technical Report MS-CIS-85-18, Department of Computer and Information Science, University of Pennsylvania, Philadelphia, 1985.
12. T. NURKKALA AND V. KUMAR, A parallel parsing algorithm for natural language using tree adjoining grammar, in Proc. 8th International Parallel Processing Symposium, IEEE Computer Society Press, Los Alamitos, CA, 1994, pp. 315-320.
13. M. PALIS, S. SHENDE, AND D. S. L. WEI, An optimal linear time parallel parser for tree adjoining languages, SIAM J. Comput., 19 (1990), pp. 1-31.
14. B. H. PARTEE, A. TER MEULEN, AND R. E. WALL, Studies in Linguistics and Philosophy, vol. 30, Kluwer Academic Publishers, Norwell, MA, 1990.
15. G. SATTA, Tree adjoining grammar parsing and Boolean matrix multiplication, in Proc. 32nd Meeting of the Association for Computational Linguistics, Morgan Kaufmann, San Francisco, 1994.
16. G. SATTA, personal communication, September 1993.
17. Y. SCHABES AND A. K. JOSHI, An Earley-type parsing algorithm for tree adjoining grammars, in Proc. 26th Meeting of the Association for Computational Linguistics, Morgan Kaufmann, San Francisco, 1988, pp. 258-269.
18. M. STEEDMAN, Dependency and coordination in the grammar of Dutch and English, Language, 61 (1985), pp. 523-568.
19. L. G. VALIANT, General context-free recognition in less than cubic time, J, Comput. System Sci., 10 (1975), pp. 308-315.
20. K. VIJAYASHANKER AND A. K. JOSHI, Some computational properties of tree adjoining grammars, in Proc. 23rd Meeting of the Association for Computational Linguistics, Morgam Kaufmann, San Francisco, 1985, pp. 82-93.