Computational semantics in type theory
This paper aims to show how Montague-style grammars can be completely formalized and thereby declaratively implemented by using the Grammatical Framework GF. The implementation covers the fundamental operations of Montague’s PTQ model: the construction of analysis trees, the linearization of trees i...
Kaydedildi:
| Yayımlandı: | URI:https://journals.openedition.org/msh, |
|---|---|
| Yazar: | |
| Materyal Türü: | Article ou chapitre numérique |
| Dil: | Anglais |
| Baskı/Yayın Bilgisi: |
Mathématiques et sciences humaines
2006
|
| Konular: | |
| Online Erişim: | Accès Université d'Orléans et IFPM Accès Université d'Orléans et IFPM |