Catálogo de publicaciones - libros
Logical Aspects of Computational Linguistics: 5th International Conference, LACL 2005, Bordeaux, France, April 28-30, 2005, Proceedings
Philippe Blache ; Edward Stabler ; Joan Busquets ; Richard Moot (eds.)
En conferencia: 5º International Conference on Logical Aspects of Computational Linguistics (LACL) . Bordeaux, France . April 28, 2005 - April 30, 2005
Resumen/Descripción – provisto por la editorial
No disponible.
Palabras clave – provistas por la editorial
Artificial Intelligence (incl. Robotics); Mathematical Logic and Formal Languages; Language Translation and Linguistics
Disponibilidad
| Institución detectada | Año de publicación | Navegá | Descargá | Solicitá |
|---|---|---|---|---|
| No detectada | 2005 | SpringerLink |
Información
Tipo de recurso:
libros
ISBN impreso
978-3-540-25783-7
ISBN electrónico
978-3-540-31953-5
Editor responsable
Springer Nature
País de edición
Reino Unido
Fecha de publicación
2005
Información sobre derechos de publicación
© Springer-Verlag Berlin Heidelberg 2005
Tabla de contenidos
doi: 10.1007/11422532_21
The Expressive Power of Restricted Fragments of English
Allan Third
Taking the notion of of a language to mean its ability to distinguish different situations, we define four simple fragments of English based on the syntactic constructions they contain, and characterise their expressive power via translation into first-order logic. We also describe the circumstances under which an arbitrary first-order formula can be translated back into an English sentence of each fragment. This work is an extension of the semantic complexity results of Pratt-Hartmann [2] and Pratt-Hartmann [3].
- LACL | Pp. 317-329
doi: 10.1007/11422532_22
The Complexity and Generative Capacity of Lexicalized Abstract Categorial Grammars
Ryo Yoshinaka; Makoto Kanazawa
Previous studies have shown that some well-known classes of grammars can be simulated by (de Groote 2001) in straightforward ways. These classes of grammars all generate subclasses of the PTIME languages. While the exact generative capacity of the class of ACGs and the complexity of its universal membership problem are both unknown, we show that the universal membership problem for the class of ACGs is NP-complete and the languages generated by lexicalized ACGs form a subclass of NP which includes some NP-complete languages.
- LACL | Pp. 330-346
doi: 10.1007/11422532_23
More Algebras for Determiners
R. Zuber
Some new algebras, which are possible denotations for various determiners, are studied. One of them is the algebra of generalised cardinal quantifiers which is a sub-algebra of conservative quantifiers and which contains cardinal, co-cardinal and proportional quantifiers. In addition some non-conservative quantifiers are studied (symmetric, contrapositional and fixed points with respect to the post-complement). It is shown that co-intersective quantifiers are contrapositional. The analysis is extended to quantifiers of higher types.
- LACL | Pp. 347-362