Сложность по памяти
Related Papers
Polynomial Time and Space Shift-Reduce Parsing of Arbitrary Context-free Grammars.
We introduce an algorithm for designing a predictive left to right shift-reduce non-deterministic push-down machine corresponding to an arbitrary unrestricted context-free grammar and an algorithm for efficiently driving this machine …...
Using Brackets to Improve Search for Statistical Machine Translation
We propose a method to improve search time and space complexity in statistical machine translation architectures, by employing linguistic bracketing information on the source language sentence. It is one of …...
Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems
We study the problem of finding the best head- driven parsing strategy for Linear Context- Free Rewriting System productions. A head- driven strategy must begin with a specified righthand-side nonterminal …...
A Formal Hierarchy of RNN Architectures
AbstractWe develop a formal hierarchy of the expressive capacity of RNN architectures. The hierarchy is based on two formal properties: space complexity, which measures the RNN’s memory, and rational recurrence, …...
The Development and Assessment of Pattern Matching Algorithms Used by ZEE: A Filipino Sign Language (FSL) Dictionary and English-Learning App
“The Filipino Sign Language Act” of RA 11106 states the declaration of Filipino Sign Language (FSL) as the National Sign Language of Filipino deaf citizens. However, the lack of awareness …...