Tabular parsing and algebraic transformations

Theoretical Computer Science

Volumn 293, Issue 2, 2003, Pages 365-389

  Schneider, Karl Michael ^a  

^a UNIVERSITY OF PASSAU   (Germany)

Author keywords

Algebra; Linear indexed grammars; Parser construction; Tabular parsing; Transformation

Indexed keywords

ALGEBRA; ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL TRANSFORMATIONS;

TABULAR PARSING;

CONTEXT FREE GRAMMARS;

EID: 0037421582     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00352-8     Document Type: Conference Paper

References (24)

1. M. Alonso, J. Graña, M. Vilares, E. de la Clergerie, New tabular algorithms for LIG parsing, in: Proc. 6th Int. Workshop on Parsing Technologies, IWPT 2000, Trento, 2000, pp. 29-40.
2. M. Alonso, E. de la Clergerie, D. Cabrero, Tabulation of automata for tree adjoining languages, in: Proc. 6th Meeting on Mathematics of Language, MOL 6, Orlando, Florida, 1999, pp. 127-141.
3. Gazdar G. Applicability of indexed grammars to natural languages. Reyle U., Rohrer C. Natural Language Parsing and Linguistic Theory. 1988;69-94 D. Reidel, Dordrecht.
4. Grätzer G. Universal Algebra. 2nd Edition:1979;Springer, New York.
5. Gusfield D. Algorithms on Strings, Trees, and Sequences. Computer Science and Computational Biology. 1997;Cambridge University Press, Cambridge.
6. Höft H. A characterization of strong homomorphisms. Colloq. Math. 28(2):1973;189-193.
7. Joshi A.K., Schabes Y. Tree-adjoining grammars. Rozenberg G., Salomaa A. Handbook of Formal Languages, Vol. 3, Chap. 2. 1997;69-123 Springer, Berlin.
8. M. Kay, Guides and oracles for linear-time parsing, in: Proc. 6th Internat. Workshop on Parsing Technologies, IWPT 2000, Trento, 2000, pp. 6-9.
9. Lang B. Recognition can be harder than parsing. Comput. Intell. 10(4):1994;486-494.
10. Martelli A., Montanari U. On the foundations of dynamic programming. Rinaldi S. Topics in Combinatorial Optimization. CISM Courses and Lectures. Vol. 175:1975;145-163 Springer, Wien.
11. M.-J. Nederhof, Linguistic parsing and program transformations, Ph. d. Thesis, Katholieke Universiteit Nijmegen, Nijmegen, 1994.
12. M.-J. Nederhof, Models of tabulation for TAG parsing, in: Proc. 6th Meeting on Mathematics of Language, MOL, Vol. 6, Orlando, FL, pp. 143-158.
13. F.C.N. Pereira, D.H.D. Warren, Parsing as deduction, in: Proc. 21st Ann. Meeting of the Association for Computational Linguistics, (ACL'83), 1983, pp. 137-144.
14. Schmidt J. A homomorphism theorem for partial algebras. Colloq. Math. 21(1):1970;5-21.
15. Shieber S.M. Evidence against the context-freeness of natural language. Linguist. Philos. 8:1985;333-343.
16. Shieber S.M., Schabes Y., Pereira F.C.N. Principles and implementation of deductive parsing. J. Logic Program. 24(1-2):1995;3-36.
17. Sikkel K. Parsing Schemata, Proefschrift, Universiteit Twente. 1993;Enschede, The Netherlands.
18. Sikkel K. Parsing schemata and correctness of parsing algorithms. Theoret. Comput. Sci. 199(1-2):1998;87-103.
19. Slłomiński J. On mappings between quasi-algebras. Colloq. Math. 15(1):1966;25-44.
20. Sl*omiński J. On systems of mappings between models. Colloq. Math. 17(2):1967;247-268.
21. Vijay-Shanker K., Weir D.J. Polynomial parsing of extensions of context-free grammars. Tomita M. Current Issues in Parsing Technology. 1991;191-206 Kluwer, Dordrecht.
22. Vijay-Shanker K., Weir D.J. Parsing some constrained grammar formalisms. Comput. Linguist. 19(4):1993;591-636.
23. Vijay-Shanker K., Weir D.J. The equivalence of four extensions of context-free grammars. Math. Systems Theory. 27:1994;511-545.
24. Wojdylło B. Remarks on lattices of congruence relations of quasi-algebras. Colloquium Mathematicum. 27(2):1973;187-191.