Báo cáo khoa học: "Memory-Efficient and Thread-Safe Quasi-Destructive Graph Unification"

In terms of both speed and memory consumption, graph unification remains the most expensive component of unification-based grammar parsing. We present a technique to reduce the memory usage of unification algorithms considerably, without increasing execution times. Also, the proposed algorithm is thread-safe, providing an efficient algorithm for parallel processing as well.

Bấm vào đây để xem trước nội dung
TÀI LIỆU MỚI ĐĂNG
3    3    0    22-06-2021