We present a novel exact solution to the approximate string matching problem in the context of translation memories, where a text segment has to be matched against a large corpus, while allowing for errors. We use suffix arrays to detect exact n-gram matches, A* search heuristics to discard matches and A* parsing to validate candidate segments. The method outperforms the canonical baseline by a factor of 100, with average lookup times of 4.3\u2013247ms for a segment in a realistic scenario.<\/p>","protected":false},"excerpt":{"rendered":"
We present a novel exact solution to the approximate string matching problem in the context of translation memories, where a text segment has to be matched against a large corpus, while allowing for errors. We use suffix arrays to detect exact n-gram matches, A* search heuristics to discard matches and A* parsing to validate candidate … \uacc4\uc18d\ub428<\/a><\/p>","protected":false},"featured_media":0,"template":"","class_list":["post-3326","paper","type-paper","status-publish","hentry"],"acf":[],"_links":{"self":[{"href":"https:\/\/www-staging.systransoft.com\/kr\/wp-json\/wp\/v2\/paper\/3326","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www-staging.systransoft.com\/kr\/wp-json\/wp\/v2\/paper"}],"about":[{"href":"https:\/\/www-staging.systransoft.com\/kr\/wp-json\/wp\/v2\/types\/paper"}],"wp:attachment":[{"href":"https:\/\/www-staging.systransoft.com\/kr\/wp-json\/wp\/v2\/media?parent=3326"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}