Algorithms for generation

Xem 1-20 trên 160 kết quả Algorithms for generation
  • We discuss algorithms for generation within the Lambek Theorem Proving Framework. Efficient algorithms for generation in this framework take a semantics-driven strategy. This strategy can be modeled by means of rules in the calculus that are geared to generation, or by means of an algorithm for the Theorem Prover. The latter possibility enables processing of a bidirectional calculus. Therefore Lambek Theorem Proving is a natural candidate for a 'uniform' architecture for natural language parsing and generation.

    pdf7p bungio_1 03-05-2013 36 1   Download

  • This paper describes an algorithm for generating quantifier scopings. The algorithm is designed to generate only logically non-redundant scopings and to partially order the scopings with a given :default scoping first. Removing logical redundancy is not only interesting per se, but also drastically reduces the processing time. The input and output formats are described through a few access and construction functions. Thus, the algorithm is interesting for a modular linguistic theory, which is flexible with respect to syntactic and semantic framework. ...

    pdf6p buncha_1 08-05-2013 28 1   Download

  • We present an algorithm for the generation of sentences from the semantic representations of Unification Categorial Grammar. We discuss a variant of Shieber's semantic monotonicity requirement and its utility in our algorithm. We indicate how the algorithm may be extended to other grammars obeying the same requirement. Appendices contain a full listing of the program and a trace of execution of the algorithm.

    pdf8p buncha_1 08-05-2013 20 1   Download

  • Most algorithms dedicated to the generation of referential descriptions widely suffer from a fundamental problem: they make too strong assumptions about adjacent processing components, resulting in a limited coordination with their perceptive and linguistics data, that is, the provider for object descriptors and the lexical expression by which the chosen descriptors is ultimately realized.

    pdf8p bunthai_1 06-05-2013 25 2   Download

  • Existing algorithms for generating referential descriptions to sets of objects have serious deficits: while incremental approaches may produce ambiguous and redundant expressions, exhaustive searches are computationally expensive. Mediating between these extreme control regimes, we propose a best-first searching algorithm for uniquely identifying sets of objects. We incorporate linguistically motivated preferences and several techniques to cut down the search space. Preliminary results show the effectiveness of the new algorithm. ...

    pdf4p bunthai_1 06-05-2013 31 1   Download

  • We present an algorithm for generating strings from logical form encodings that improves upon previous algorithms in that it places fewer restrictions on the class of grammars to which it is applicable. In particular, unlike an Earley deduction generator (Shieber, 1988), it allows use of semantically nonmonotonic grammars, yet unlike topdown methods, it also permits left-recursion. The enabling design feature of the algorithm is its implicit traversal of the analysis tree for the string being generated in a semantic-head-driven fashion. ...

    pdf11p bungio_1 03-05-2013 35 1   Download

  • Lots of publications are presented to solve these problems. In this paper, a conventional P&O algorithm, a modified MPPT algorithm and a fuzzy MPPT algorithm for variable speed wind turbine using permanent magnet synchronous generator (PMSG) are tested and compared in the terms of complexity, speed responses and the ability to acquire the maximal energy output.

    pdf6p everydaywish 24-12-2018 12 0   Download

  • Bilingual lexicons are fundamental resources. Modern automated lexicon generation methods usually require parallel corpora, which are not available for most language pairs. Lexicons can be generated using non-parallel corpora or a pivot language, but such lexicons are noisy. We present an algorithm for generating a high quality lexicon from a noisy one, which only requires an independent corpus for each language.

    pdf10p hongdo_1 12-04-2013 24 2   Download

  • a new sentence realization framework for text-to-text applications. This framework uses IDL-expressions as a representation formalism, and a generation mechanism based on algorithms for intersecting IDL-expressions with probabilistic language models. We present both theoretical and empirical results concerning the correctness and efficiency of these algorithms.

    pdf9p bunbo_1 17-04-2013 36 2   Download

  • We present an algorithm for generating referring expressions in open domains. Existing algorithms work at the semantic level and assume the availability of a classification for attributes, which is only feasible for restricted domains. Our alternative works at the realisation level, relies on WordNet synonym and antonym sets, and gives equivalent results on the examples cited in the literature and improved results for examples that prior approaches cannot handle.

    pdf8p bunbo_1 17-04-2013 26 1   Download

  • This paper describes algorithms which rerank the top N hypotheses from a maximum-entropy tagger, the application being the recovery of named-entity boundaries in a corpus of web data. The first approach uses a boosting algorithm for ranking problems. The second approach uses the voted perceptron algorithm. Both algorithms give comparable, significant improvements over the maximum-entropy baseline. The voted perceptron algorithm can be considerably more efficient to train, at some cost in computation on test examples.

    pdf8p bunmoc_1 20-04-2013 21 1   Download

  • The lexicalist approach to Machine Translation offers significant advantages in the development of linguistic descriptions. However, the Shake-and-Bake generation algorithm of (Whitelock, 1992) is NPcomplete. We present a polynomial time algorithm for lexicalist MT generation provided that sufficient information can be transferred to ensure more determinism.

    pdf7p bunmoc_1 20-04-2013 29 1   Download

  • Previous work in generating explanations from advicegiving systems has demonstrated that a cooperative system can and should infer the immediate goals and plans of an utterance (or discourse segment) and formulate a response in light of these goals and plans. The claim of this paper is that a cooperative response may also have to address a user's overall goals, plans, and preferences among those goals and plans. A n algorithm is introduced that generates user-specific responses by reasoning about the goals, plans and preferences hypothesized about a user. ...

    pdf6p bungio_1 03-05-2013 23 1   Download

  • We describe a system of reversible grammar in which, given a logic-grammar specification of a natural language, two efficient PROLOGprograms are derived by an off-line compilation process: a parser and a generator for this language. The centerpiece of the system is the inversion algorithm designed to compute the generator code from the parser's PROLOG code, using the collection of minimal sets of essential arguments (MSEA) for predicates.

    pdf8p bungio_1 03-05-2013 50 1   Download

  • Study on neutron – gamma pulse shape discrimination algorithms for scintillation detector. The four neutron - gamma pulsed shape discrimination algorithms fortheodel NE213 scintillation detector by using digital signal processing were developed. In this study, a pulse generator, pulse digitizer and neutron - gamma pulsed shape discrimination algorithms are simulated in Matlab, Simulink software.

    pdf12p lehasiphuong 22-05-2018 16 1   Download

  • In this paper, a genetic algorithm for making music compositions is presented. Position based representation of rhythm and relative representation of pitches, based on measuring relation from starting pitch, allow for a flexible and robust way for encoding music compositions. This approach includes a pre-defined rhythm applied to initial population, giving good starting solutions.

    pdf21p vinguyentuongdanh 19-12-2018 20 1   Download

  • This paper proposes an interactive control algorithm for seamless transfer of three-phase grid-connected converter between grid-tide mode and stand-alone mode. In order to archive a smooth transfer between two modes, the voltage controller and current controller are designed to generate the output voltage reference of PWM with no interrupted transition during islanding operation and grid connected operation.

    pdf10p sansan2 26-05-2018 12 0   Download

  • The aim of this paper is to present a new simplex-type algorithm for the Linear Programming Problem. The Primal-Dual method is a Simplex-type pivoting algorithm that generates two paths in order to converge to the optimal solution.

    pdf10p vinguyentuongdanh 19-12-2018 22 0   Download

  • Ray Tracing is an algorithm for generating photo-realistic pictures of the 3D scenes, given scene description, lighting condition and viewing parameters as inputs. The algorithm is inherently convenient for parallelization and the simplest parallelization scheme is for the shared-memory parallel machines (multiprocessors). This paper presents two implementations of the algorithm developed by the authors for alike machines, one using the POSIX threads API and another one using the OpenMP API.

    pdf11p vinguyentuongdanh 20-12-2018 20 0   Download

  • This paper presents an important phase of our new approach for summarizing the given Vietnamese paragraph. The central of this phase is an algorithm for computing verbal relationships in the process of generating the Vietnamese paragraph from the logical expression of discourse representation structure (DRS), which is the first-order logic expressions without explicit quantifiers, and represents the meaning as well as reflects the potential contexts of a given discourse or a sequence of sentences.

    pdf12p vititan2711 13-08-2019 3 0   Download


368 tài liệu
1102 lượt tải

p_strKeyword=Algorithms for generation

nocache searchPhinxDoc


Đồng bộ tài khoản