The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A discriminative matching approach to word alignment
Open accessAbstract
We present a discriminative, large-margin approach to feature-based matching for word alignment. In this framework, pairs of word tokens receive a matching score, which is based on features of that pair, including measures of association between the words, distortion between their positions, similarity of the orthographic form, and so on. Even with only 100 labeled training examples and simple features which incorporate counts from a large unlabeled corpus, we achieve AER performance close to IBM Model 4, in much less time. Including Model 4 predictions as features, we achieve a relative AER reduction of 22% in over intersected Model 4 alignments.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The complexity of computing the permanent
Valiant, L. G. (1979) · Theoretical Computer Science · doi:10.1016/0304-3975(79)90044-6 · Cited by 2,705
Cited by
An Introduction to Conditional Random Fields
Sutton, C., & McCallum, A. (2012) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000013 · Cited by 564
Liang, P., Taskar, B., & Klein, D. (2006) · Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics - · doi:10.3115/1220835.1220849 · Cited by 421
Self-citationStatistical machine translation
Lopez, A. (2008) · ACM Computing Surveys · doi:10.1145/1380584.1380586 · Cited by 410
Lexical association measures and collocation extraction
Pecina, P. (2010) · Language Resources and Evaluation · doi:10.1007/s10579-009-9101-4 · Cited by 316
Metadata
- Authors
- Taskar, B., Lacoste-Julien, S., & Klein, D.
- Venue
- Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing - HLT '05
- Published
- 2005
- Pages
- 73-80
- OpenAlex
- W2119224513
- Cited by
- 167
- References
- 1
- FWCI
- 14.55
- Type
- conference paper
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.