{"id":{"repo_id":"cadiz","oai_identifier":"oai:rodin.uca.es:10498/14777"},"canonical_url":"https://search.dev.ndltd.org/etd/cadiz/oai:rodin.uca.es:10498/14777","repository":{"repo_id":"cadiz","name":"Universidad de Cadiz","base_url":"https://rodin.uca.es/oai/request"},"display":{"title":"Investigaciones sobre gramáticas categoriales: Algoritmos de parsing y equivalencia entre formalismos","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Jiménez Millán, José Antonio"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":["Frías Delgado, Antonio","Gadeschi Díaz, María Esther"],"committee_chairs":[],"committee_members":[],"year":2003,"date_issued":"2003-01-01T00:00:00Z","date_published":"2003-01-01T00:00:00Z","updated_at":"2026-07-24T01:29:34Z","subjects":["language, linguistics","computer science","lingüística","informática"],"languages":["spa"],"rights":["Attribution-NonCommercial-NoDerivs 3.0 Unported","info:eu-repo/semantics/openAccess"],"rights_urls":["http://creativecommons.org/licenses/by-nc-nd/3.0/"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/10498/14777","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Frías Delgado, Antonio","Gadeschi Díaz, María Esther"]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Lenguajes y Sistemas Informáticos"]},{"key":"dc:creator","label":"Author","values":["Jiménez Millán, José Antonio"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2012-06-20T12:54:37Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2012-06-20T12:54:37Z"]},{"key":"dc:date.issued","label":"Date","values":["2003-01-01T00:00:00Z"]},{"key":"dc:type","label":"Dc Type","values":["doctoral thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["language, linguistics","computer science","lingüística","informática"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["spa"]},{"key":"dc:rights","label":"Dc Rights","values":["Attribution-NonCommercial-NoDerivs 3.0 Unported","info:eu-repo/semantics/openAccess"]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://creativecommons.org/licenses/by-nc-nd/3.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/10498/14777"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:source","label":"Dc Source","values":["Dissertation Abstracts International, Volume: 64-04, Section: A, page: 1235"]},{"key":"dc:title","label":"Title","values":["Investigaciones sobre gramáticas categoriales: Algoritmos de parsing y equivalencia entre formalismos"]}]}],"canonical_facts":{"dc:contributor.advisor":["Frías Delgado, Antonio","Gadeschi Díaz, María Esther"],"dc:contributor.other":["Lenguajes y Sistemas Informáticos"],"dc:creator":["Jiménez Millán, José Antonio"],"dc:date.accessioned":["2012-06-20T12:54:37Z"],"dc:date.available":["2012-06-20T12:54:37Z"],"dc:date.issued":["2003-01-01T00:00:00Z"],"dc:description.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."],"dc:format":["application/pdf"],"dc:identifier.uri":["http://hdl.handle.net/10498/14777"],"dc:language.iso":["spa"],"dc:rights":["Attribution-NonCommercial-NoDerivs 3.0 Unported","info:eu-repo/semantics/openAccess"],"dc:rights.uri":["http://creativecommons.org/licenses/by-nc-nd/3.0/"],"dc:source":["Dissertation Abstracts International, Volume: 64-04, Section: A, page: 1235"],"dc:subject":["language, linguistics","computer science","lingüística","informática"],"dc:title":["Investigaciones sobre gramáticas categoriales: Algoritmos de parsing y equivalencia entre formalismos"],"dc:type":["doctoral thesis"]},"updated_at":"2026-07-24T01:29:34Z"}