Contextual Grammars as Generative Models of Natural Languages

Computational Linguistics

Volumn 24, Issue 2, 1998, Pages 245-274

  Marcus, Solomon ^a   Pǎun, Gheorghe ^b   Martín Vide, Carlos ^c  

^a UNIVERSITY OF BUCHAREST   (Romania)

^b INSTITUTE OF MATHEMATICS   (Romania)

^c UNIVERSITAT ROVIRA I VIRGILI   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT FREE GRAMMARS; SYNTACTICS;

ADEQUATE MODELS; CONTEXTUAL GRAMMARS; DEPENDENCE RELATION; EMBEDDED CONSTRUCTIONS; GENERATIVE CAPACITY; GENERATIVE MODEL; NATURAL LANGUAGES; SELECTION PROCEDURES;

CONTEXT FREE LANGUAGES;

EID: 0038503488     PISSN: 08912017     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (56)

1. Aho, Alfred V. 1968. Indexed grammars. An Extension of context-free grammars. Journal of the ACM, 15:647-671.
2. Bar-Hillel, Yehoshua and Eliyahu Shamir. 1964. Finite state languages: Formal representations and adequacy problems. In Yehoshua Bar-Hillel, editor, Language and Information. Addison-Wesley, Reading, MA, pages 87-98.
3. Bǎlǎnescu, Tudor and Marian Gheorghe. 1987. Program tracing and languages of action. Revue roumaine de linguistique - Cahiers de linguistique théorique et appliquée, 32:167-170.
4. Chomsky, Noam. 1964. On the Notion "Rule of Grammar". In Janet A. Fodor and Jerrold J. Katz, editors, The Structure of Language: Readings in the Philosophy of Language. Prentice Hall, Englewood Cliffs, N.J., pages 50-118.
5. Culy, Christopher. 1985. The complexity of the vocabulary of Bambara. Linguistics and Philosophy, 8:345-351.
6. Dassow, Jürgen and Gheorghe Pǎun. 1989. Regulated Rewriting in Formal Language Theory. Springer, Berlin.
7. Ehrenfeucht, Andrzej, Gheorghe Pǎun, and Grzegorz Rozenberg. 1997. On representing recursively enumerable languages by internal contextual languages. Theoretical Computer Science. To appear.
8. Floyd, R. W. 1962. On the non-existence of a phrase-structure grammar for Algol-60. Communications of the ACM, 5:483-484.
9. Gazdar, Gerald and Geoffrey K. Pullum. 1985. Computationally relevant properties of natural languages and their grammars. New Generation Computing, 3:273-306.
10. Grinberg, Dennis, John Lafferty, and Daniel Sleator. 1995. A robust parsing algorithm for link grammars. In Proceedings of the Fourth International Workshop on Parsing Technologies, pages 111-125, Prague/Karlovy Vary.
11. Harrison, Michael. 1978. Introduction to Formal Language Theory. Addison-Wesley, Reading, MA.
12. Hockett, Charles. 1970. The State of the Art. Mouton, The Hague.
13. Ilie, Lucian. 1997a. On computational complexity of contextual languages. Theoretical Computer Science. To appear.
14. Ilie, Lucian. 1997b. The computational complexity of Marcus contextual languages. Submitted.
15. Jančar, Petr, František Mráz, Martin Plátek, Martin Procházka, and Jörg Vogel. 1996. Restarting automata, Marcus grammars and context-free languages. In Jürgen Dassow, Grzegorz Rozenberg, and Arto Salomaa, editors, Developments in Language Theory II. World Scientific, Singapore, pages 102-111.
16. Joshi, Aravind K. 1985. How much context-sensitivity is required to provide structural descriptions: Tree adjoining grammars. In David Dowty, Lauri Karttunen, and Arnold Zwicky, editors, Natural Language Processing: Psycholinguistic, Computational, and Theoretical Perspectives. Cambridge University Press, New York, pages 206-250.
17. Joshi, Aravind K. 1987. An introduction to tree adjoining grammars. In Alexis Manaster Ramer, editor, Mathematics of Language. John Benjamins, Amsterdam, pages 87-114.
18. Joshi, Aravind K., Leon S. Levy, and M. Takahashi. 1975. Tree adjunct grammars. Journal of Computer and Systems Sciences, 10:136-163.
19. Manaster Ramer, Alexis. 1993. Capacity, complexity, construction. Annals of Mathematics and Artificial Intelligence, 8(1-2): Mathematics of language, pages 1-16.
20. Manaster Ramer, Alexis. 1994. Uses and misuses of mathematics in linguistics. X Congreso de Lenguajes Naturales y Lenguajes Formales, Sevilla.
21. Marcus, Solomon. 1967. Algebraic Linguistics. Analytical Models. Academic Press, New York.
22. Marcus, Solomon. 1969. Contextual grammars. Revue roumaine des mathématiques pures et appliquées, 14:1525-1534.
23. Marcus, Solomon, editor. 1978. La sémiotique formelle du folklore. Klincksieck, Paris/Publishing House of the Romanian Academy, Bucharest.
24. Marcus, Solomon. 1979. Linguistics for programming languages. Revue roumaine de linguistique - Cahiers de linguistique théorique et appliquée, 16(1):29-38.
25. Marcus, Solomon, editor. 1981-83. Contextual Ambiguities in Natural and Artificial Languages. Communication and Cognition Monographs, 2 volumes. Ghent.
26. Marcus, Solomon. 1997. Contextual grammars and natural languages. In Grzegorz Rozenberg and Arto Salomaa, editors, Handbook of Formal Languages, volume 2, pages 215-235.
27. Martín-Vide, Carlos. 1997. Natural computation for natural language. Fundamenta Informaticae, 31.2:117-124.
28. Martín-Vide, Carlos, Alexandru Mateescu, Joan Miquel-Vergés, and Gheorghe Pǎun. 1995. Internal contextual grammars: Minimal, maximal and scattered use of selectors. In M. Koppel and Eliyahu Shamir, editors, Proceedings of The Fourth Bar-Ilan Symposium on Foundations of Artificial Intelligence (BISFAI'95), pages 132-142. Ramat Gan/Jerusalem. Also in M. Koppel and Eliyahu Shamir, editors, Proceedings of the fourth Bar-Ilan Symposium on Foundations of Artificial Intelligence. Focusing on Natural Languages and Artificial Intelligence: Philosophical and Computational Aspects. AAAI Press, Menlo Park, CA, 1997, pages 159-168.
29. Martín-Vide, Carlos, Alexandru Mateescu, Joan Miquel-Vergés, and Gheorghe Pǎun. 1995. Internal contextual grammars: Minimal, maximal and scattered use of selectors. In M. Koppel and Eliyahu Shamir, editors, Proceedings of The Fourth Bar-Ilan Symposium on Foundations of Artificial Intelligence (BISFAI'95), pages 132-142. Ramat Gan/Jerusalem. Also in M. Koppel and Eliyahu Shamir, editors, Proceedings of the fourth Bar-Ilan Symposium on Foundations of Artificial Intelligence. Focusing on Natural Languages and Artificial Intelligence: Philosophical and Computational Aspects. AAAI Press, Menlo Park, CA, 1997, pages 159-168.
30. Martín-Vide, Carlos and Gheorghe Pǎun. 1998. Structured contextual grammars. Grammars: To appear.
31. Miquel-Vergés, Joan. 1997. Models Algebraics Analítics del Llenguatge. Un Exemple: les Gramàtiques Contextual; Formalització i Estudi de les Seves Aplicacions. Ph.D. dissertation, Rovira i Virgili University, Tarragona.
32. Olivetti, Convegno. 1970. Linguaggi nella Società e nella Tecnica. Edizzioni di Comunità, Milano.
33. Partee, Barbara H., Alice ter Meulen, and Robert E. Wall. 1990. Mathematical Methods in Linguistics. Kluwer, Dordrecht.
34. Pǎun, Gheorghe. 1976. Languages associated to a dramatic work. Reveu roumaine de linguistique: Cahiers de linguistique théorique et appliquée, 13:605-611.
35. Pǎun, Gheorghe. 1979. A formal linguistic model of action systems. Ars Semeiotica, 2:33-47.
36. Pǎun, Gheorghe. 1982. Contextual Grammars. The Publishing House of the Romanian Academy, Bucharest, in Romanian.
37. Pǎun, Gheorghe. 1985. On some open problems about Marcus contextual grammars. International Journal of Computer Mathematics, 17:9-23.
38. Pǎun, Gheorghe. 1994. Marcus contextual grammars. After 25 years. Bulletin of the EATCS, 52:263-273.
39. Pǎun, Gheorghe. 1997. Marcus Contextual Grammars. Kluwer, Boston, Dordrecht.
40. Pǎun, Gheorghe and Xuan My Nguyen. 1980. On the inner contextual grammars. Revue roumaine des mathématiques pures et appliquées, 25:641-651.
41. Pǎun, Gheorghe, Grzegorz Rozenberg, and Arto Salomaa. 1994. Marcus contextual grammars: Modularity and leftmost derivation. In Gheorghe Pǎun, editor, Mathematical Aspects of Natural and Formal Languages. World Scientific, Singapore, pages 375-392.
42. Pullum, Geoffrey K. 1985. On two recent attempts to show that English is not a CFL. Computational Linguistics, 10:182-186.
43. Pullum, Geoffrey K. 1986. Footloose and context-free. Natural Language and Linguistic Theory, 4(3):409-414.
44. Pullum, Geoffrey K. 1987. Nobody goes around at LSA meetings offering odds. Natural Language and Linguistic Theory, 5(2):303-309.
45. Pullum, Geoffrey K. and Gerald Gazdar. 1982. Natural languages and context-free languages. Linguistics and Philosophy, 4:471-504.
46. Radzinski, Daniel. 1990. Unbounded syntactic copying in Mandarin Chinese. Linguistics and Philosophy, 13:113-127.
47. Rosenkrantz, Daniel J. 1969. Programmed grammars and classes of formal languages. Journal of the ACM, 16:107-131.
48. Rounds, William C., Alexis Manaster Ramer, and Joyce Friedman. 1987. Finding natural languages a home in formal language theory. In Alexis Manaster Ramer, editor, Mathematics of Language. John Benjamins, Amsterdam, pages 375-392.
49. Rozenberg, Grzegorz and Arto Salomaa. 1980. The Mathematical Theory of L Systems. Academic Press, New York.
50. Rozenberg, Grzegorz and Arto Salomaa, editors. 1997. Handbook of Formal Languages, 3 volumes. Springer, Berlin.
51. Salomaa, Arto. 1973. Formal Languages. Academic Press, New York.
52. Savitch, Walter J. 1991. Infinity is in the eyes of the beholder. In C. Georgopoulos and R. Ishihara, editors, Interdisciplinary Approaches to Language: Essays in Honor of S.-Y. Kuroda. Kluwer, Dordrecht, pages 487-500.
53. Savitch, Walter J. 1993. Why it might pay to assume that languages are infinite. Annals of Mathematics and Artificial Intelligence, 8(1-2): Mathematics of language, pages 17-25.
54. Savitch, Walter J., Emmon Bach, William Marsh, and Gila Safran-Naveh, editors. 1987. The Formal Complexity of Natural Language. Kluwer, Dordrecht.
55. Shieber, Stuart M. 1985. Evidence against the context-freeness of natural language. Linguistics and Philosophy, 8:333-343.
56. Sleator, Daniel and D. Temperley. 1991. Parsing English with a link grammar. Technical Report CMU-CS-91-196, School of Computer Science, Carnegie Mellon University, Pittsburgh.