... 2006.
c
2006 Association for Computational Linguistics
Using comparable corpora
to solve problems difficult for human translators
Serge Sharoff, Bogdan Babych, Anthony Hartley
Centre for Translation Studies
University ... present a tool that uses
comparable corpora to find appropriate
translation equivalents for expressions that
are considered by translators as dif...
... 50
performance
minscore
’Precision1-Dict0.01-Cog7.3’
’Precision1-Dict0.01-Baseline’
’Recall1-Dict0.01-Cog7.3’
’Recall1-Dict0.01-Baseline’
’F-measure1-Dict0.01-Cog7.3’
’F-measure1-Dict0.01-Baseline’
Figure 4: Performance of dictionaries Dict0.01 for
up to one link per word
rebuilding algorithm is independent of the actual
word alignment method used.
Furthermore, we plan to explore ways...
... are generally fusiform.
Le corps des
aloses est généralement fusiforme.
(4) Ability to
react to light.
Capacité à
réagir à la lumière.
U
NAMBIGUOUS GOV -TO- DEP PROPAGATION TO
ALIGN NOUNS
. ... and fall to the
bottom.
Les oeufs de très petite taille tombent sur le
fond.
(5) X is a model which was designed to
stimulate…
X est un modèle qui a été conçu pour
stimuler…
G...
... agnostic to the
properties of the classifier and can be used to expand
feature vectors for any binary classifier). L1 regular-
ization enables us to select a small subset of features
for the classifier. ... automatic method to create
a thesaurus that is sensitive to the sentiment of
words expressed in different domains.
• We describe a method to use the created the-
saurus to e...
... structure needs
to be “built in” to an adaptor grammar compared to a
comparable PCFG. For example, the adaptor gram-
mars for syllable structure presented in sections 3.3
and 3.6 learn more information ... never expands to itself); it is
currently unknown whether there are tree distribu-
tions that satisfy the adaptor grammar constraints for
recursive adaptor grammars.
Inferen...
... of rules.
1 for each tree, 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* ... try to insert a VP ellipsis site in X
8 try to insert S*T* or SBAR in X
9 try to insert trace of topicalized XP in X
10 try to insert trace of extraposition in X
11 for ea...
... developed a methodology for using
hand-bracketed parses to examine both the inter-
nal and external performance of a grammar
checker. The internal performance refers to the
behavior of the ... we therefore weight
repaired
to
be preferred as a passive verb. Although this
method for selecting fronted parse trees some-
times leads to false error critiques, it works well
for...
... function tag and trace informa-
tion. In contrast to English, in many other lan-
guages configurational information is not a good
predictor for LFG grammatical function assign-
ment. For such languages ... memory-based 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 o...
... 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 to ex-
tract other GRs needed for our application ... use GRs to provide a common basis
for comparing full and shallow parsers, and
Penn Treebank and Susanne structures. To
carry out this comparison, we implemented a
GR extract...
... 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 ... strate-
gies for selecting which annotation to transfer and
find that using the result that was clicked by the user
gives comparable performance to using just the top
resul...