ACM Home Page
Please provide us with feedback. Feedback
W-grammar
Full text PdfPdf (329 KB)
Source ACM Annual Conference/Annual Meeting archive
Proceedings of the 1969 24th national conference table of contents
Pages: 511 - 518  
Year of Publication: 1969
Authors
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 19,   Citation Count: 8
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/800195.805957
What is a DOI?

ABSTRACT

A new type of grammars is presented here, called W-grammars. It is shown how they can be used in translation processes. Examples are taken from the fields of algebraic manipulation and computational linguistics.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
SINTZOFF, M., Existence of a Van Wijngaarden syntax for every recursive enumerable set, Annales de la Société Scientifique de Bruxelles, Bruxelles, 81, II (1967), pp. 115-118.
3
 
4
CHOMSKY, N., Three models for the description of language, I.R.E. Transactions on Information Theory, vol. IT-2, Proceedings of the Symposium on Information Theory, Sept. 1956.
 
5
GOPNIK, M., Relative Clauses, Richerche sur la traduction automatique, onzième rapport semestriel, Université de Montréal et Conseil National de la recherche, Montréal, October 1968.
 
6
Recherche sur la traduction automatique, douziéme rapport semestriel, Université de Montréal et Conseil National de la Recherche, Montréal 1969. (In preparation)


Collaborative Colleagues:
Guy de Chastellier: colleagues
Alain Colmerauer: colleagues