Báo cáo toán học: "Using Determining Sets to Distinguish Kneser Graphs" pptx

... previously been applied to the task of cross-domain sentiment classification. In our method, we use the automatically created thesaurus to expand feature vectors in a binary clas- sifier at train and test ... (Sarawagi and Kirpal, 2004), we can efficiently create a thesaurus from a large set of reviews. 4 Feature Expansion Our feature expansion phase augments a feature vec- t...

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

... it gives us a way of learning these interacting linguistic structures simultaneously. Adaptor grammars are also interesting because they can be viewed as directly inferring linguistic structure. ... detection of syllable boundaries combining the advantages of treebank and bracketed corpora training. In Proceedings of the 39th Annual Meeting of the Association for Com...

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

... iterate over nodes from top down 2 for each node X 3 try to insert NP* in X 4 try to insert 0 in X 5 try to insert WHNP 0 or WHADVP 0 in X 6 try to insert *U* in X 7 try to insert a VP ellipsis ... The term recovery refers to the complete package: detection, resolution, and assignment of function tags to empty categories. 2 Empty nodes in the Penn Treebank The maj...

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

... Abstract We describe a method for evaluating a grammar checking application with hand -bracketed parses. A randomly-selected set of sentences was sub- mitted to a grammar checker in both bracketed ... phrases in the machine parse that are in the hand parse). We have developed a methodology for using hand -bracketed parses to examine both the inter- nal and e...

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

... learning to perform various graph transformations. One of the transformations is node relabelling, which adds function tags to parser output. They report an f- score of 88.5% for the task of function ... 5: Cast3LB function tagging performance for parser output, for all constituents, and for cor- rectly parsed constituents only 140 as research on data-driven function...

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

... has . Then the sim- ilarity score of the merged cluster is the aver- age similarity score of the -word cluster, av- eraged with the similarity scores between the single word and all words in the ... example, if the maximum number is 2, then a word can align to 0, 1, or 2 words in the parallel sentence. In other settings, we en- forced a minimum score in the bil...

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

... CH Cl C2. 294 Using Grammatical Relations to Compare Parsers Judita Preiss* Computer Laboratory University of Cambridge Judita.PreissAcl.cam.ac.uk Abstract We use the grammatical re- lations ... statis- tical methods to add function tags to Penn Treebank I style parses; however, as well as converting the tags into a Carroll et al. for- mat, we would need to add extra rules...

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

... sentences and also the automatically generated query training set. The simplest way to match query tokens to snip- pet tokens is to allow a query token to match any snippet token. This can be problematic ... modeling in machine translation. In Proc. of ACL. 242 a given query, and then to transfer the tags from the snippet tokens to matching query tokens. This “di- rect”...

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

... used as the training data. In the first step, opinion target and opinion word candidates are extracted from the training data. Frequency counts of the annotated opinion targets and opin- ion words ... Darmstadt http://www.ukp.tu-darmstadt.de/people Abstract Current work on automatic opinion min- ing has ignored opinion targets expressed by anaphorical pronouns, thereby missing a...

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

... Computational Linguistics Using Deep Morphology to Improve Automatic Error Detection in Arabic Handwriting Recognition Nizar Habash and Ryan M. Roth Center for Computational Learning Systems Columbia ... Effect of Training Data Size In order to allow for rapid examination of multi- ple feature combinations, we restricted the size of the training set (S) to maintain m...

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

... for total 4-choosability, and it completes the proof of Lemma 8. ✷ Lemma 9. If a nontrivial sepachain G 1 is good for total 4-choosability, then so is the sepachain G in Fig. 1(h). Proof. Let Λ ... Λ-colouring of G, and this completes the proof of Lemma 5. ✷ Lemma 6. If a nontrivial sepachain G 1 is good for total 4-choosability, then the sepachain G in Fig. 1(f) is very good for tot...

Ngày tải lên: 07/08/2014, 13:21

... {id}. 3 Linking Distinguishing and Determining We already know what it means for (the set of vertices of) a graph to be d-distinguished. In order to connect determining sets and distinguishing ... provide a useful tool for finding distinguishing numbers. Theorem 3 tells us that to prove G has distinguishing number at most k + 1, it suffices to find a determining set that can be k-...

Ngày tải lên: 07/08/2014, 15:22

... Finally, in Section 5, based on this study, we give very short proofs of our main results – Theorems 4, 5, 6 and 7. 2 Embedding trees in expanding graphs We start by defining a class of expanding ... almost spanning trees in random graphs, submitted. [4] J. Friedman and N. Pipp enger, Expanding graphs contain all small trees, Combinator- ica 7 (1 987), 71–76. [5] P. Haxell, Tr...

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

... del are recently investigated; for example, independent sets [11] and component evolution [1, 10]. A generalized random intersection graph is introduced in [5] by allowing a more general connection ... Component evolution in random intersection gr aphs. The Electronic Journal of Combinatorics, 14, #R17 , 2007. [2] M. Bloznelis, Degree distribution of a typical vertex in a gen...

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

... with a single pattern having no self-overlappings of length exceeding 1. The following result implied by Theorem 1.8 was first conjectured by S. Elizalde in [3] and later proven in [2] by homological ... permutations avoiding elements of these collections as consecutive patterns. In short, the coincidence of the latter generating functions is guaranteed by a length-preserving bijec...

Ngày tải lên: 08/08/2014, 14:23