• español
    • English
  • Login
  • English 
    • español
    • English

UniversidaddeCádiz

Área de Biblioteca, Archivo y Publicaciones
Communities and Collections
View Item 
  •   RODIN Home
  • Producción Científica
  • Tesis
  • View Item
  •   RODIN Home
  • Producción Científica
  • Tesis
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Investigaciones sobre gramáticas categoriales: Algoritmos de parsing y equivalencia entre formalismos

Thumbnail
Identificadores

URI: http://hdl.handle.net/10498/14777

URL: http://proquest.umi.com/pqdweb?did=765642451&Fmt=2&clientId=47941&RQT=309&VName=PQD

Files
31482193.pdf (1.623Mb)
Statistics
View statistics
Share
Export
Export reference to MendeleyRefworksEndNoteBibTexRIS
Metadata
Show full item record
Alternative title
Investigations on categorial grammars: Parsing algorithms and equivalence of formalisms
Author/s
Jiménez Millán, José Antonio
Date
2003-01-01
Advisor
Frías Delgado, Antonio; Gadeschi Díaz, María Esther
Department
Lenguajes y Sistemas Informáticos
Source
Dissertation Abstracts International, Volume: 64-04, Section: A, page: 1235
Abstract
This work is the outcome of a research in the use of Categorial Grammars (CG) for the description and parsing of natural and formal languages.Our work has focused on those aspects we found problematic facing the practical application of CG, such as: (a) a strong equivalence of Context Free Grammars (CFG) and CG, (b) lack of descriptive power of CG, (c) the existence of multiple systems of semantic labelling for the Lambek Calculus (LC) and thus, lack of precise definition for the spurious ambiguity, (d) efficiency and robustness of parsing algorithms.We start dealing with the possible use of LC in CFG, and we conclude that this is possible. This is proved by the introduction of one algebraic model and the derivation of the LC thereAnother way of looking at the above results is to think we have built another CG theory by the addition of axioms to the LC. We call CG⪯ to this system, and it results in one unified theory for CFG and CG.Next, we discuss the implications of using LC in CFG, as well as its advantages and disadvantages.With respect to the existence of multiple systems of labelling for the LC, we introduce two versions for the calculus in Natural Deduction (ND) for CG. Using one of these variants is how we demostrate the Inversion Principle and the Curry-Howard isomorphism for the ND calculus. Then, we introduce two new conversion algorithms between the proofs in LC and the deductions in ND and thus, we get one semantic labelling in LC. We propose this labelling as the definition of equality in proofs and, therefore, as the definition of spurious ambiguity.Finally, we introduce two different parsing algorithms: one for the calculus in ND---the only one we know to be complete and which generates only deductions in normal forms---and another one for the LC---being also complete and free of spurious ambiguity.This second algorithm is specially interesting as it owns some top-down steps. Then, we discuss the possibility of using it as the kernel of an abductive semi-robust parser; abductive in the sense of Kakas and Kowalski.
Subjects
language, linguistics; computer science; lingüística; informática
Collections
  • Tesis [313]
  • Tesis Ing. Inf. [15]
Attribution-NonCommercial-NoDerivs 3.0 Unported
This work is under a Creative Commons License Attribution-NonCommercial-NoDerivs 3.0 Unported

Browse

All of RODINCommunities and CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

LoginRegister

Statistics

View Usage Statistics

Información adicional

AboutDeposit in RODINPoliciesGuidelinesRightsLinksStatisticsNewsFrequently Asked Questions

RODIN is available through

OpenAIREOAIsterRecolectaHispanaEuropeanaBaseDARTOATDGoogle Academic

Related links

Sherpa/RomeoDulcineaROAROpenDOARCreative CommonsORCID

RODIN está gestionado por el Área de Biblioteca, Archivo y Publicaciones de la Universidad de Cádiz

Contact informationSuggestions