|
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)
|
CITED BY 8
|
|
|
|
|
|
|
|
|
|
|
|
|
|
André Dugas , Myrna Gopnik , Brian Harris , Jean-Pierre Paillet, Le projet de traduction automatique à l'Université de Montreal, Proceedings of the 1969 conference on Computational linguistics, p.1-10, September 01-04, 1969, Sång-Säby, Sweden
|
|
|
|
|
|
|
|
|
|
|