intTypePromotion=1
ADSENSE

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

Chia sẻ: Nhung Nhung | Ngày: | Loại File: PDF | Số trang:8

32
lượt xem
1
download
 
  Download Vui lòng tải xuống để xem tài liệu đầy đủ

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.

Chủ đề:
Lưu

Nội dung Text: Báo cáo khoa học: "Memory-Efficient and Thread-Safe Quasi-Destructive Graph Unification"

ADSENSE

CÓ THỂ BẠN MUỐN DOWNLOAD

 

Đồng bộ tài khoản
2=>2