representing constraints with automata

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

... was negatively correlated with the expression of PLAU, SLCO4A1,and TGM2, and positively correlated with IGSF3 , STMN1, FOXG1, and RAB25. PC2 was negatively correlated with the expression of STMN1, ... AMY2A,andISL1,andposi- tively correlated with S100P, RAB25,andCDH1.PC3 was negatively correlated with the expression of RAB25 and AMY2A, and positiv ely correlated with TGM2, MALL, and IGSF3. Gene networks ... corre- lated with the expression of PLAU, SLCO4A1,and TGM2, and positively correlated with IGSF3 , STMN1, FOXG1, and RAB25. The loading number of component 2 (PC2) was negatively correlated with the...

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

... Translating a Unification Grammar with Disjunctions into Logical Constraints Mikio Nakano and Akira Shimazu* NTT Basic Research Laboratories 3-1 ... the former is easier to describe and to understand. Parsing with term-based internal representations is more efficient than parsing with graph-based representations. Therefore, it is effective ... methods cannot deal with disjunctive feature descriptions, which reduce redundancies in the grammar and make parsing efficient. Since the pro- posed method translates a formalism without expanding...

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

... and z and ~/are variables. A feature clause is a finite set of constraints of the above forms. As usual we interpret constraints with respect to a variable assignment, in order to make sure ... not contain a string zpa together with zpb (where a ~ b) or together with zpf. It is clear that the property of a reg- ular language L of being dash-free with respect to L and A can be read ... may ap- pear only as terminal nodes. The edges are la- beled with features and for every node no two outgoing edges may be labeled with the same feature. We formalize feature graphs as pairs...

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

... Linguistics. 29 ate He He:1:2-ate:2:0 ate meat ate:1:0-meat:2:1 ate with ate:1:0 -with: 2:1 meat the the:1:2-meat:2:0 with fork with: 1:0-fork:2:1 fork a a:1:2-fork:2:0 Figure 4: Examples of bigram-subtrees ate meat with ate:1:0-meat:2:1 -with: 3:1 ate with ... ate:1:0-NULL:2:1-meat:3:1 the:1:3-NULL:2:3-meat:3:0 a:1:3-NULL:2:3-fork:3:0 with: 1:0-NULL:2:1-fork:3:1 ate:1:0-the:2:3-meat:3:1 ate:1:0 -with: 2:1-fork:3:2 with: 1:0-a:2:3-fork:3:1 NULL:1:2-He:2:3-ate:3:0 He:1:3-NULL:2:1-ate:3:0 ate:1:0-meat:2:1-NULL:3:2 ate:1:0-NULL:2:3 -with: 3:1 with: 1:0-fork:2:1-NULL:3:2 NULL:1:2-a:2:3-fork:3:0 a:1:3-NULL:2:1-fork:3:0 ate:1:0-NULL:2:3 ... (Carreras, 2007). We call the parser with the monolingual features monolingual parser. 3.2 Parsing with bilingual features In this paper, we parse source sentences with the help of their translations....

Ngày tải lên: 16/03/2014, 23:20

... feature weights are optimized with a perceptron algorithm on a training corpus annotated with the scopes of conjuncts. The reason we build a tree of coordinations is to cope with nested coordinations, ... in task (ii) is noticeable especially in coordinations with three or more conjuncts; if we restrict the test set only to coordinations with three or more con- juncts, the F-measures in the proposed ... 967–975, Suntec, Singapore, 2-7 August 2009. c 2009 ACL and AFNLP Coordinate Structure Analysis with Global Structural Constraints and Alignment-Based Local Features Kazuo Hara Masashi Shimbo Hideharu Okuma...

Ngày tải lên: 23/03/2014, 16:21

... parsing with a POS tagger or with gold standard POS tags. Figure 4 shows the accuracy of HPSG predicate-argument relations obtained with depen- dency constraints determined by dependency pars- ing with ... ob- tained with dependency parser combinations C1 and C2 were very similar, even though in C1 only two parsers were used, and constraints were provided for about 92% of shallow dependencies (with accuracy higher ... to- tal time required to parse the test set using HPSG with dependency constraints generated by the shift- reduce parser is 27 minutes. With combination C1, parsing time increases to 30 minutes,...

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

... pressed with graded constraints: • Hard constraints with a score of zero (e. g. con- straint SubjUnique) exclude totally unaccept- able structures from consideration. This kind of constraints ... Currently, there are about 210 semantic constraints, including constraints on auxiliary levels. The syntax is defined by 240 constraints. Experiments with slightly dis- torted sentences resulted ... word order are specified by means of weaker constraints with score larger than, but near to zero, e. g. constraint SubjNumber. • Weak constraints with score near to one can be used for conditions...

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

... restriction (=~) constraints making the automata accept only the sequences which appear in contexts described by the grammar. . Forcing surface coercion constraints (¢=) mak- ing the automata accept ... coercion constraints. 4.3 Surface Coercion Rules Let r' represent the center of the rule with the cor- rect lexical expressions and the incorrect surface ex- pressions with respect ... presents a method for incorporating rule features in the resulting automata. The following Syriac example is used here, with the infamous Semitic root {ktb} 'notion of writ- ing'....

Ngày tải lên: 24/03/2014, 03:21

... global constraints and can generate syntactically correct sentences. Our concern is how a model with SR constraints is superior to a model without them. MLN with SRL outperforms MLN without SRL with ... re-implemented McDonald’s model with an ILP solver and experimented it on the WNC Corpus. 9 MLN with SRL and MLN w/o SRL are our Markov Logic models with and with- out SR Constraints, respectively. Note ... are not sufficient to compress some complex sentences with coordination, with passive voice, and with an auxiliary verb. Figure 1 shows an example with a coordination structure. 1 1 This example is...

Ngày tải lên: 30/03/2014, 17:20

... range of constraints and balances constraints with underlying patterns learned from the data, thereby requiring more so- phisticated machinery for modeling and inference. Extraction with Constraints ... removing the constraints on syntactic patterns (no-syn) and the constraints disallowing relations to overlap (no-sep) from the full domain-independent model. 8 We also try a version with hard syntac- tic ... experiments. 5 Declarative Constraints We now have the machinery to incorporate a va- riety of declarative constraints during inference. The classes of domain-independent constraints we study are...

Ngày tải lên: 30/03/2014, 21:20

... the function. selects the arc pair with the highest arc score and performs the graph branch operation with the selected arc pair. The following is a shown with the arc names and arc scores. Scores ... Well-formedness Constraints and Graph Search Algorithms There can be a variety of well-formedness con- straints from very basic and language-independent constraints to specific and language-dependent constraints. ... co- occurrence constraints between two arcs in a DG. As described in Section 2.6, the DF can represent (C2)-(C4) and more precise constraints because it can handle co-occurrence constraints between...

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

... in a future paper. 5.2 Final Thoughts Despite these open questions, initial trials with QA-by-Dossier -with -Constraints have been very encouraging, whether it is by correctly answering previously ... technology with which QA components have been built. We present here a new methodology which attempts to use QA holistically, along with constraint satisfaction, to better answer questions, without ... titled works are associated with their creators by means of a possessive or parenthetical construction, rather than subject-verb-object. The top five answers, with confidences, are re- turned...

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

... establish a splittee anode for each partition. The splittee with only intersecting ori- gin groups can now be connected to candi- date.a-arc with no further problems. In either case, the original ... with lares reflecting all of the final larcs. The dummy candidate.a-arc can then be processed as usual. When its origin has been connected to the automaton, it becomes the final.anode, with ... procedure insures that the sibling's origin will eventually connect with the epsilon a-arc's extremity. Splittee a-arcs with epsilon labels are placed at the top of the list pushed onto...

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

... defines possible mappings, with associated costs, of dependency trees with source- language word node labels into ones with target- language word labels. Unlike the head automata monolingual models, ... analyzing bottom- up with generative model automata, the algorithm 'runs' the automata backwards. Edges in the parsing lattice (or "chart") are tuples representing partial ... labels taken from a set R of relation symbols. When a node with label w immediately dominates a node with label w' via an arc with label r, we say that w' is an r-dependent of...

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

... global constraint—ought to spread over the whole can- didate set, not just within in the window. Transitivity without further constraints is point- less. 6 What we really can gain from transitivity ... experimented with various window sizes and found that a size of 3 sentences worked best. Candidate pairs are generated only within that 2 Recently, a new version of the T ¨ uBa was released with 35,000 ... constraint models with- out boundness enforcement constraints (cf. Sec- tion 5) pose no computational burden, they can be solved in quadratic time. In the presence of bound- ness enforcement constraints, ...

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

Ngày tải lên: 01/04/2014, 00:20

Ngày tải lên: 24/04/2014, 17:12

Ngày tải lên: 24/04/2014, 17:25

Ngày tải lên: 21/06/2014, 05:20