Research in example-based machine translation (EBMT) has been hampered by the lack of efficient tree alignment algorithms for bilingual corpora. This paper describes an alignment algorithm for EBMT whose running time is quadratic in the size of the input parse trees. The algorithm uses dynamic programming to score all possible matching nodes between structure-sharing trees or forests. We describe the algorithm, various optimizations, and our implementation.
Alignment of Shared Forests for Bilingual Corpora
Adam Meyers,R. Yangarber,R. Grishman
Published 1996 in International Conference on Computational Linguistics
ABSTRACT
PUBLICATION RECORD
- Publication year
1996
- Venue
International Conference on Computational Linguistics
- Publication date
1996-08-05
- Fields of study
Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-13 of 13 references · Page 1 of 1
CITED BY
Showing 1-56 of 56 citing papers · Page 1 of 1