The Experts below are selected from a list of 2226 Experts worldwide ranked by ideXlab platform

Hasida Kôiti - One of the best experts on this subject based on the ideXlab platform.

  • emergent parsing and generation with Generalized Chart
    International Conference on Computational Linguistics, 1994
    Co-Authors: Hasida Kôiti
    Abstract:

    A new, flexible inference method for Horn logic program is proposed. It is also a drastic generalization of Chart parsing, partial instantiation of clauses in a program roughly corresponding to ares in a Chart. Chartlike parsing and semantic-head-driven generation emerge from this method. With a parsimouious instantiation scheme for ambiguity packing, the parsing complexity reduces to that of standard Chart-based algorithms.

  • Emergent Parsing and Generation with Generalized Chart
    arXiv: Computation and Language, 1994
    Co-Authors: Hasida Kôiti
    Abstract:

    A new, flexible inference method for Horn logic program is proposed, which is a drastic generalization of Chart parsing, partial instantiations of clauses in a program roughly corresponding to arcs in a Chart. Chart-like parsing and semantic-head-driven generation emerge from this method. With a parsimonious instantiation scheme for ambiguity packing, the parsing complexity reduces to that of standard Chart-based algorithms.

  • COLING - Emergent parsing and generation with Generalized Chart
    Proceedings of the 15th conference on Computational linguistics -, 1994
    Co-Authors: Hasida Kôiti
    Abstract:

    A new, flexible inference method for Horn logic program is proposed. It is also a drastic generalization of Chart parsing, partial instantiation of clauses in a program roughly corresponding to ares in a Chart. Chartlike parsing and semantic-head-driven generation emerge from this method. With a parsimouious instantiation scheme for ambiguity packing, the parsing complexity reduces to that of standard Chart-based algorithms.

Yasuharu Den - One of the best experts on this subject based on the ideXlab platform.

  • Generalized Chart algorithm an efficient procedure for cost based abduction
    Meeting of the Association for Computational Linguistics, 1994
    Co-Authors: Yasuharu Den
    Abstract:

    We present an efficient procedure for cost-based abduction, which is based on the idea of using Chart parsers as proof procedures. We discuss in detail three features of our algorithm --- goal-driven bottom-up derivation, tabulation of the partial results, and agenda control mechanism --- and report the results of the preliminary experiments, which show how these features improve the computational efficiency of cost-based abduction.

  • ACL - Generalized Chart ALGORITHM: AN EFFICIENT PROCEDURE FOR COST-BASED ABDUCTION
    Proceedings of the 32nd annual meeting on Association for Computational Linguistics -, 1994
    Co-Authors: Yasuharu Den
    Abstract:

    We present an efficient procedure for cost-based abduction, which is based on the idea of using Chart parsers as proof procedures. We discuss in detail three features of our algorithm --- goal-driven bottom-up derivation, tabulation of the partial results, and agenda control mechanism --- and report the results of the preliminary experiments, which show how these features improve the computational efficiency of cost-based abduction.

Alexander Koller - One of the best experts on this subject based on the ideXlab platform.

  • Generalized Chart constraints for efficient PCFG and TAG parsing.
    arXiv: Computation and Language, 2018
    Co-Authors: Stefan Grünewald, Sophie Henning, Alexander Koller
    Abstract:

    Chart constraints, which specify at which string positions a constituent may begin or end, have been shown to speed up Chart parsers for PCFGs. We generalize Chart constraints to more expressive grammar formalisms and describe a neural tagger which predicts Chart constraints at very high precision. Our constraints accelerate both PCFG and TAG parsing, and combine effectively with other pruning techniques (coarse-to-fine and supertagging) for an overall speedup of two orders of magnitude, while improving accuracy.

  • ACL (2) - Generalized Chart constraints for efficient PCFG and TAG parsing
    Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers), 2018
    Co-Authors: Stefan Grünewald, Sophie Henning, Alexander Koller
    Abstract:

    Chart constraints, which specify at which string positions a constituent may begin or end, have been shown to speed up Chart parsers for PCFGs. We generalize Chart constraints to more expressive grammar formalisms and describe a neural tagger which predicts Chart constraints at very high precision. Our constraints accelerate both PCFG and TAG parsing, and combine effectively with other pruning techniques (coarse-to-fine and supertagging) for an overall speedup of two orders of magnitude, while improving accuracy.

A. Osman Akan - One of the best experts on this subject based on the ideXlab platform.

  • SPREAD CALCULATION IN COMPOSITE GUTTER SECTIONS. TECHNICAL NOTE
    Journal of Transportation Engineering-asce, 2000
    Co-Authors: A. Osman Akan
    Abstract:

    A Generalized Chart is presented to determine the spread in composite gutters given the gutter discharge. The use of this Chart eliminates the tedious trial-and-error calculations to determine the spread in routine pavement drainage problems. The Chart is also different from those available in the literature in the sense that it is limited neither to a specific unit system nor to specific gutter dimensions. The use of the Chart is demonstrated through a practical application.

  • Spread Calculation in Composite Gutter Sections
    Journal of Transportation Engineering, 2000
    Co-Authors: A. Osman Akan
    Abstract:

    A Generalized Chart is presented to determine the spread in composite gutters given the gutter discharge. The use of this Chart eliminates the tedious trial-and-error calculations to determine the spread in routine pavement drainage problems. The Chart is also different from those available in the literature in the sense that it is limited neither to a specific unit system nor to specific gutter dimensions. The use of the Chart is demonstrated through a practical application.

Stefan Grünewald - One of the best experts on this subject based on the ideXlab platform.

  • Generalized Chart constraints for efficient PCFG and TAG parsing.
    arXiv: Computation and Language, 2018
    Co-Authors: Stefan Grünewald, Sophie Henning, Alexander Koller
    Abstract:

    Chart constraints, which specify at which string positions a constituent may begin or end, have been shown to speed up Chart parsers for PCFGs. We generalize Chart constraints to more expressive grammar formalisms and describe a neural tagger which predicts Chart constraints at very high precision. Our constraints accelerate both PCFG and TAG parsing, and combine effectively with other pruning techniques (coarse-to-fine and supertagging) for an overall speedup of two orders of magnitude, while improving accuracy.

  • ACL (2) - Generalized Chart constraints for efficient PCFG and TAG parsing
    Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers), 2018
    Co-Authors: Stefan Grünewald, Sophie Henning, Alexander Koller
    Abstract:

    Chart constraints, which specify at which string positions a constituent may begin or end, have been shown to speed up Chart parsers for PCFGs. We generalize Chart constraints to more expressive grammar formalisms and describe a neural tagger which predicts Chart constraints at very high precision. Our constraints accelerate both PCFG and TAG parsing, and combine effectively with other pruning techniques (coarse-to-fine and supertagging) for an overall speedup of two orders of magnitude, while improving accuracy.