Báo cáo khoa học: "An Optimal-Time Binarization Algorithm for Linear Context-Free Rewriting Systems with Fan-Out Two" ppt

... incorrectness have been given before by Kinyon (1997). There seems to be no straightforward way to correct the algorithm. We therefore developed an alternative to the algorithm from Schabes and ... from the stack, but this information is merely popped without investigation. Thereby, the algorithm fails to perform the necessary matching of the elementary tree with regard to the...

Ngày tải lên: 20/02/2014, 18:20

... An Efficient Generation Algorithm for Lexicalist MT Victor Poznafiski, John L. Beaven &: Pete Whitelock * SHARP Laboratories of Europe Ltd. Oxford Science Park, Oxford OX4 4GA United Kingdom ... Shake-and-Bake generation algorithm of (Whitelock, 1992) is NP- complete. We present a polynomial time algorithm for lexicalist MT generation pro- vided that sufficient information...

Ngày tải lên: 20/02/2014, 22:20

... pow- erful than linear context-free rewriting systems (LCFRS) (Vijay-Shanker et al., 1987). LCFRS is unable to describe certain natural language phe- nomena that RCGs actually can deal with. One example ... of the form A i (α 1 , . . . , α dim(A i ) ) with A i ∈ N and α j ∈ (T ∪ V ) ∗ for 1 ≤ j ≤ dim(A i ). Central to RCGs is the notion of ranges on strings. Definition 2. For ev...

Ngày tải lên: 08/03/2014, 01:20

... with positive score are included. The algorithm then loops over each context (CONTEXTS is the set of all contexts): for r, w ′  in CONTEXTS: WLIST = set of all w where w, r, w ′  exists for ... in (CTX) We have made a number of runs with different values of MIN for BNC, OEC and Itwac and present details for some representative ones in Table 1. For the BNC, the number of pa...

Ngày tải lên: 31/03/2014, 01:20

... extending the CKY algorithm for context-free grammars to TAGs. As a precondition for that analysis, it has to be proven that each TAG can be transformed into two form, a normal form re- stricting ... normal-form is defined as a precondition for a new and more efficient parsing algorithm. This form is more restricted than the two form, and is closely related to the Chomsky no...

Ngày tải lên: 31/03/2014, 18:20

... good references for the development of the NiuTrans toolkit. While our toolkit includes all necessary components as provided within the above systems, we have additional goals for this project, ... two reordering models for the phrase-based system, or a Synchronous Context-free/ Tree-substitution Grammar (SCFG/STSG) for the hierarchical phrase-based and syntax-based systems...

Ngày tải lên: 19/02/2014, 20:20

... block of the table summarizes the per- formance of the systems with ILP. We were first con- cerned with how well ILP works for the mention- pair model, compared with the normally used algo- rithm ... discriminative learning algorithm. During resolution, an input document is processed from the first mention to the last. For each encountered mention m j , a test instance is formed f...

Ngày tải lên: 20/02/2014, 09:20

... currently tagging other genres with the same information. We will then use this infor- mation and the thesaurus to build a parsing model that combines syntactic and semantic information. We will also ... words with a familiarity greater than or equal to five on a seven point scale (Kasahara et al., 2004). This gives 28,000 words in all, with 46,000 different senses. Defini- tion sentences...

Ngày tải lên: 20/02/2014, 12:20

... additional parameter into the recursion formula for DP. In the following, we will explain this method in detail. 2.3 Recursion Formula for DP In the DP formalism, the search process is described ... words we have to force the algorithm to cover all input string positions. Different strategies to solve this problem are possible: For example, we can in- troduce a reward for...

Ngày tải lên: 20/02/2014, 18:20

... machines with shared-memory architecture. We propose an efficient programming envi- ronment for developing parallel NLP systems on shared-memory parallel machines, called the Parallel Substrate for ... i := O; forall z E F do create uarae-concat¢~atoT'-Rmb age~| J~f i; N, ~= s*lve(x); i := i + 1; forellend for j := 0 to i do R := R U (Wait-lor-result(J~fj));...

Ngày tải lên: 20/02/2014, 18:20