Báo cáo khoa học: "Authorship Attribution Using Probabilistic Context-Free Grammars" doc
Báo cáo khoa học: "Authorship Attribution Using Probabilistic Context-Free Grammars" doc
... approach
for authorship attribution, the task of iden-
tifying the author of a document, using
probabilistic context-free grammars. Our
approach involves building a probabilistic
context-free grammar ... Treebank each training document using the
parser trained in Step 1.
3. Train a PCFG G
i
for each author A
i
using the
treebanked documents for that author.
4. For each test doc...
Tài liệu Báo cáo khoa học: "Machine Translation Using Probabilistic Synchronous Dependency Insertion Grammars" pptx
... different in for-
malism, model the two languages using tree-based
transduction rules or a synchronous grammar, pos-
sibly probabilistic, and using multi-lemma elemen-
tary structures as atomic ... 541–548,
Ann Arbor, June 2005.
c
2005 Association for Computational Linguistics
Machine Translation Using Probabilistic
Synchronous Dependency Insertion Grammars
Yuan Ding Martha Pal...
Báo cáo khoa học: "Authorship Attribution with Author-aware Topic Models" pptx
... belief that about 80% of each document
is composed of author words yielded better results
than using AT’s approach, which evenly splits each
document into author and document words.
Fourth, DADT ... each document.
DADT. Given our DADT model, we assume that the
test text was written by a “new” author, and infer
this author’s topic distribution, the author/document
topic ratio, and the docume...
Báo cáo khoa học: "Hybrid Parsing: Using Probabilistic Models as Predictors for a Symbolic Parser" docx
... 321–328,
Sydney, July 2006.
c
2006 Association for Computational Linguistics
Hybrid Parsing:
Using Probabilistic Models as Predictors for a Symbolic Parser
Kilian A. Foth, Wolfgang Menzel
Department ... train-
ing a probabilistic parser or a supertagger usually
321
requires a fully developed tree bank, in the case
of taggers or chunkers a much more shallow and
less expensive annotation...
Báo cáo khoa học: "Term Recognition Using Technical Dictionary Hierarchy" docx
... (Felber, 1984).
The recent works on ATR identify the
candidate terms using shallow syntactic
information and score the terms using statistical
measure such as frequency. The candidate terms
are ... hierarchy. The clustering is a
statistical technique to generate a category
structure using the similarity between
documents (Anderberg, 1973). Among the
clustering methods, a recipr...
Báo cáo khoa học: "Decision detection using hierarchical graphical models" docx
... how much
using ASR output degrades detection of decision regions.
3
The authors used the AMI DA annotations.
309
The authors conducted experiments using the
AMI corpus and found that when using ... (Fern
´
andez et al., 2008).
The HGM result presented in Table 2 was
computed using the three-level DBN model (see
Fig. 4b) using the combination of UTT and DA
features. Without DA featur...
Báo cáo khoa học: "Reordering Modeling using Weighted Alignment Matrices" docx
... METEOR scores were computed
using 16 references. The TER and TERp were com-
puted using a single reference.
4.3 Reordering model comparison
Tables 1 and 2 show the scores using the differ-
ent reordering ... weighted alignment matrices.
First, we test a simple approach by using the 1-best
alignment to generate the reordering model, while
using the alignment matrix to produce the tra...
Báo cáo khoa học: "Coreference Resolution Using Competition Learning Approach" docx
...
data set. For MUC-6, 30 “dry-run” documents an-
notated with coreference information could be used
as training data. There are also 30 annotated train-
ing documents from MUC-7. For testing, ... train-
ing documents from MUC-7. For testing, we util-
ize the 30 standard test documents from MUC-6
and the 20 standard test documents from MUC-7.
5.1 Baseline Systems
In the experiment we compa...
Báo cáo khoa học: "Text Segmentation Using Reiteration and Collocation" docx
...
(83.3%)
Table
1. Comparison of segmentation algorithm
using different linguistic features.
Discussion:
The segmentation algorithm using the
linguistic features word repetition and collocation ...
Lindsay J. Evett
Department of Computing
Nottingham Trent University
Nottingham NG1 4BU, UK
lje @doc. ntu.ac.uk
Abstract
A method is presented for segmenting text into
subtopic area...
Báo cáo khoa học: "Strong Lexicalization of Tree Adjoining Grammars" docx
... C. Rounds. 1969. Context-free grammars on
trees. In Proc. 1st ACM Symp. Theory of Comput.,
pages 143–148. ACM.
William C. Rounds. 1970. Tree-oriented proofs of some
theorems on context-free and ... lexicalizes context-free grammars without chang-
ing the trees produced. Comput. Linguist., 21(4):479–
513.
Hiroyuki Seki, Takashi Matsumura, Mamoru Fujii, and
Tadao Kasami. 1991. On multiple...
Từ khóa: