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...
Shranjeno v:
| izdano v: | URI:https://journals.openedition.org/msh, |
|---|---|
| Glavni avtor: | |
| Format: | Article ou chapitre numérique |
| Jezik: | Anglais |
| Izdano: |
Mathématiques et sciences humaines
2006
|
| Teme: | |
| Online dostop: | Accès Université d'Orléans et IFPM Accès Université d'Orléans et IFPM |