Parsing as natural deduction

Xem 1-6 trên 6 kết quả Parsing as natural deduction
  • The logic behind parsers for categorial grammars can be formalized in several different ways. Lambek Calculus (LC) constitutes an example for a natural deduction 1 style parsing method. In natural language processing, the task of a parser usually consists in finding derivations for all different readings of a sentence. The original Lambek Calculus, when it is used as a parser/theorem prover, has the undesirable property of allowing for the derivation of more than one proof for a reading of a sentence, in the general case. ...

    pdf8p bungio_1 03-05-2013 29 1   Download

  • We present a unified view of many translation algorithms that synthesizes work on deductive parsing, semiring parsing, and efficient approximate search algorithms. This gives rise to clean analyses and compact descriptions that can serve as the basis for modular implementations. We illustrate this with several examples, showing how to build search spaces for several disparate phrase-based search strategies, integrate non-local features, and devise novel models.

    pdf9p bunthai_1 06-05-2013 37 1   Download

  • By exploring the relationship between parsing and deduction, a new and more general view of chart parsing is obtained, which encompasses parsing for grammar formalisms based on unification, and is the basis of the Earley Deduction proof procedure for definite clauses. The efficiency of this approach for an interesting class of grammars is discussed. 1. I n t r o d u c t i o n The aim of this paper is to explore the relationship between parsing and deduction. The basic notion, which goes back to Kowaiski (Kowalski, 1980} and Colmerauer {Colmeraucr, 1978), h'zs seen a very...

    pdf8p bungio_1 03-05-2013 25 0   Download

  • Recent work has seen the emergence of a common framework for parsing categorial grammar (CG) formalisms that fall within the 'type-logical' tradition (such as the Lambek calculus and related systems), whereby some method of linear logic theorem proving is used in combination with a system of labelling that ensures only deductions appropriate to the relevant grammatical logic are allowed. The approaches realising this framework, however, have not so far addressed the task of incremental parsing - - a key issue in earlier work with 'flexible' categorial grammars.

    pdf8p bunthai_1 06-05-2013 40 2   Download

  • In this paper* I will argue for a model of grammatical processing that is based on uniform processing and knowledge sources. The main feature of this model is to view parsing and generation as two strongly interleaved tasks performed by a single parametrized deduction process. It will be shown that this view supports flexible and efficient natural language processing.

    pdf6p buncha_1 08-05-2013 29 2   Download

  • This paper discusses a sequence of deductive parsers, called PAD1 - PAD5, that utilize an a x i o m a t i z a t i o n of the p r i n c i p l e s a n d parameters of GB theory, including a restricted transformational component (Move-a). PAD2 uses an inference control strategy based on the "freeze" predicate of Prolog-II, while PAD3 - 5 utilize the Unfold-Fold transformation to transform the original axiomatization into a form that functions as a recursive descent Prolog parser for the fragment. INTRODUCTION In this paper I...

    pdf8p bungio_1 03-05-2013 40 1   Download



p_strKeyword=Parsing as natural deduction

nocache searchPhinxDoc


Đồng bộ tài khoản