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

Tài liệu Báo cáo khoa học: "An alternative LR algorithm for TAGs" docx

... 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 part to ... alternative LR algorithm for TAGs Mark-Jan Nederhof DFKI Stuhlsatzenhausweg 3 D-66123 Saarbr/icken, Germany E-marl: nederhof@dfki.de Abstract We present a new LR algorithm for tree- adjoining...

Tài liệu Báo cáo khoa học: "An Efficient Generation Algorithm for Lexicalist MT" ppt

... 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 can be transferred ... them for grammatical well-formedness. If they are well-formed, the system halts indicating success. If not, another permutation is tried and the process repeated. The complexity of this algorithm...

Báo cáo khoa học: "An Earley Parsing Algorithm for Range Concatenation Grammars" potx

... pow-erful than linear context-free rewriting systems (LCFRS) (Vijay-Shanker et al., 1987). LCFRS isunable to describe certain natural language phe-nomena that RCGs actually can deal with. Oneexample ... ofthe form Ai(α1, . . . , αdim(Ai)) with Ai∈ N andαj∈ (T ∪ V )∗ for 1 ≤ j ≤ dim(Ai).Central to RCGs is the notion of ranges onstrings.Deﬁnition 2. For every w = w1. . . wn with wi∈ ... clause S(aXb) → S(X) signiﬁes that S istrue for a part of the input if this part starts with ana, ends with a b, and if, furthermore, S is also true for the part between a and b.Deﬁnition 1....

Báo cáo khoa học: "An efﬁcient algorithm for building a distributional thesaurus (and other Sketch Engine developments)" pdf

... with positivescore 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 differentvalues of MIN for BNC, OEC and Itwac and presentdetails for some representative ones in Table 1. For the BNC, the number of partitions that ... the context vector. Thenumber of types increases with the corpus size, and(Ravichandran et al., 2005) propose heuristics for thesaurus building without undertaking the completecalculation. The...

Báo cáo khoa học: "AN EFFICIENT PARSING ALGORITHM FOR TREE ADJOINING GRAMMARS" potx

... 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 normal form for ... extending the context-free CKY algorithm (see, e.g., [Hopcroft, Ullman 79]) to an- alyze TAGs as well. As for the context-free anal- ysis with CKY, the grammar is required in nor- mal form as a...

Tài liệu Báo cáo khoa học: "An Open Source Toolkit for Phrase-based and Syntax-based Machine Translation" docx

... 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. Then, an n-gram ... This algorithm is actually the same as that used in parsing with bracketing transduction grammars. z Decoding as parsing (or string-based decoding). This mode is designed for decoding with...

Tài liệu Báo cáo khoa học: "An Entity-Mention Model for Coreference Resolution with Inductive Logic Programming" pdf

... block of the table summarizes the per-formance of the systems with ILP. We were ﬁrst 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 isprocessed from the ﬁrst mention to the last. For eachencountered mention mj, a test instance is formed for each preceding ... maleperson and cannot co-refer with “she”.The entity-mention model based on Eq. (2) per-forms coreference resolution at an entity-level. For simplicity, the framework considered for the entity-mention...

Tài liệu Báo cáo khoa học: "An Implemented Description of Japanese: The Lexeed Dictionary and the Hinoki Treebank" ppt

... currently tagging other genres with the same information. We will then use this infor-mation and the thesaurus to build a parsing modelthat combines syntactic and semantic information.We will also ... words with a familiaritygreater than or equal to ﬁve on a seven pointscale (Kasahara et al., 2004). This gives 28,000words in all, with 46,000 different senses. Deﬁni-tion sentences for these ... “golf”Figure 1: Entry for the Word doraib¯a “driver” (with English glosses)grammar in tandem with the treebank, as part ofour research into natural language...

Tài liệu Báo cáo khoa học: "ADP based Search Algorithm for Statistical Machine Translation" docx

... 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 covering a position, ... lexica were combined by linear interpolation with the in- terpolation parameter A. For our first experiments, we set A to 0.5. The test corpus consisted of 150 sentences, for which sample translations...

Tài liệu Báo cáo khoa học: "An Efficient Parallel Substrate for Typed Feature Structures on Shared Memory Parallel Machines" docx

... 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)); forend return ... an input sen- tence. The sequential CKY algorithm computes each Fi,j according to a certain order. Our algorithm for a parallel CKY-style parser for HPSG computes each Fi,j in parallel....

Xem thêm