Báo cáo khoa học: "Unsupervised Relation Discovery with Sense Disambiguation" docx

Báo cáo khoa học: "Unsupervised Relation Discovery with Sense Disambiguation" docx

Báo cáo khoa học: "Unsupervised Relation Discovery with Sense Disambiguation" docx

... Therefore, a semantic relation comprises a set of sense clusters of patterns. Note that one pattern can fall into different semantic relations when it has multiple senses. 2.1 Sense Disambiguation In ... over 50 senses but only a few senses have non-zero prob- abilities. We look at some sense clusters of paths. For path “A play B”, we examine the top three senses, as shown in Table 1....

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

9 389 0
Báo cáo khoa học: "Personalizing PageRank for Word Sense Disambiguation" docx

Báo cáo khoa học: "Personalizing PageRank for Word Sense Disambiguation" docx

... we experiment with different LKBs formed by combining relations of different MCR versions along with relations extracted from Sem- Cor, which we call supervised and unsupervised relations, respectively. ... WordNet as LKB, enriched with eXtended WordNet relations. It contains 105, 501 nodes and 623, 316 relations. The results in Table 3 are con- sistent with those for English, with...

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

9 386 0
Tài liệu Báo cáo khoa học: "Unsupervised Relation Disambiguation Using Spectral Clustering" ppt

Tài liệu Báo cáo khoa học: "Unsupervised Relation Disambiguation Using Spectral Clustering" ppt

... 4. 2 Unsupervised Relation Extraction Problem Assume that two occurrences of entity pairs with similar contexts, are tend to hold the same relation type. Thus unsupervised relation extraction ... been tagged relation types in the given corpus. Then the relation type tags were removed to test the unsuper- vised relation disambiguation. During the evalua- tion procedure, the rela...

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

8 350 0
Báo cáo khoa học: "Unsupervised Word Alignment with Arbitrary Features" potx

Báo cáo khoa học: "Unsupervised Word Alignment with Arbitrary Features" potx

... jump conjoined with an indicator feature for the target length n, the dis- cretized jump feature conjoined with the class of s a j , and the discretized jump feature conjoined with the class ... California. K. Gimpel and N. A. Smith. 2009. Cube summing, ap- proximate inference with non-local features, and dy- namic programming without semirings. In Proc. of EACL. N. Habash and F. Sada...

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

11 293 0
Báo cáo khoa học: "Unsupervised Relation Extraction by Mining Wikipedia Texts Using Information from the Web" pdf

Báo cáo khoa học: "Unsupervised Relation Extraction by Mining Wikipedia Texts Using Information from the Web" pdf

... extract relational infor- mation of two kinds: ranked relational terms as keywords and surface patterns. Here surface pat- terns are generated with support of ranked rela- tional terms. 4.3.1 Relational ... reveal that relations are extractable with good precision using linguistic patterns, whereas surface patterns from Web frequency information contribute greatly to the coverage of rela...

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

9 345 0
Tài liệu Báo cáo khoa học: "K-means Clustering with Feature Hashing" docx

Tài liệu Báo cáo khoa học: "K-means Clustering with Feature Hashing" docx

... authors also justified their method by showing that with feature hashing, dot- product is unbiased, and the length of each vector is well-preserved with high probability under some conditions. Plausibly ... explain in detail. In NLP, features can be often expediently expressed with strings. For in- stance, a feature ‘the current word ends with -ing’ can be expressed as a string cur:end...

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

5 601 0
Báo cáo khoa học: "EFFICIENT INCREMENTAL PROCESSING WITH CATEGORIAL GRAMMAR" docx

Báo cáo khoa học: "EFFICIENT INCREMENTAL PROCESSING WITH CATEGORIAL GRAMMAR" docx

... allows a subject NP to com- bine with a transitive verb before the verb has com- bined with its object. In (3b), a sentence em- bedding verb is composed with a raised subject NP. Note that ... CG when the functor- argument relationship is taken as analogous to the traditional head-dependent relationship. A problem arises in employing this analogy with FCGs, since FCGs permit...

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

8 177 0
Báo cáo khoa học: "Language-Independent Parsing with Empty Elements" docx

Báo cáo khoa học: "Language-Independent Parsing with Empty Elements" docx

... jointly with it, not added in afterwards. Moreover, we expect empty-element recovery to improve as the parsing quality improves. Our method makes use of a strong syntactic model, the PCFGs with ... VBZ. is . WHNP. WP. who (a) (b) Figure 2: English parse tree with empty elements marked. (a) As annotated in the Penn Treebank. (b) With empty elements reconfigured and slash categories...

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

5 335 0
Báo cáo khoa học: "A Method for Word Sense Disambiguation of Unrestricted Text" potx

Báo cáo khoa học: "A Method for Word Sense Disambiguation of Unrestricted Text" potx

... one word within the context of the other word. This is done by searching on Internet with queries formed using different senses of one word, while keeping the other word fixed. The senses are ... #i/n means sense i out of n pos- 155 sible tion Cor, senses given by WordNet). This combina- of verb-noun senses also appears in Sem- file br-a01. 5 Evaluation and comparison with...

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

7 378 0
Báo cáo khoa học: "FRAGMENTATION AND PART OF SPEECH DISAMBIGUATION" docx

Báo cáo khoa học: "FRAGMENTATION AND PART OF SPEECH DISAMBIGUATION" docx

... the relative pronoun and subordinate conjunction senses of "que" are clause boundaries, while the (comparative or restrictive) particle sense is not. Many other problems of semantic ... several comments: I. Each rule can be seen as a production rule with a condition and an action. The condition is the clause starting with the first ~tf" of the rule; if it is not sati...

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

7 307 0
w