Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 6060067
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 23, 20262026-05-23T08:46:59+00:00 2026-05-23T08:46:59+00:00

Summary I am trying to design a heuristic for matching up sentences in a

  • 0

Summary

I am trying to design a heuristic for matching up sentences in a translation (from the original language to the translated language) and would like guidance and tips. Perhaps there is a heuristic that already does something similar? So given two text files, I would like to be able to match up the sentences (so I can pick out a sentence and say this is the translation of that sentence).

Details

The input text would be translated novels. So I do not expect the translations to be literal, although, using something like google translate might be a good way to test the accuracy of the heuristic.

To help me, I have a library that will gloss the contents of the translated text and give me the definitions of the words in the sentence. Other things I know:

  • Chapters and order are preserved; I know that the first sentence in chapter three will match with the first sentence in chapter three of the translation (Note, this is not strictly true; the first sentence might match up with the first two sentences, or even the second sentence)
  • I can calculate the overall size (characters, sentences, paragraphs); which could give me an idea of the average difference in sentence size (for example, the translation might be 30% longer).

Looking at the some books I have, the translated version has about 30% more sentences than the original text.

Implementation

(if it matters)

  • I am planning to do this in Java – but I am not that fussed – any language will do.
  • I am not greatly concerned about speed.

I guess to to be sure of the matches, some user feedback might be required. Like saying “Yes, this sentence definitely matches with that sentence.” This would give the heuristic some more ground to stand on. This would mean that the user would need a little proficiency in the languages.

Background

(for those interested)

The reason I want to make this is that I want it to assist with my foreign language study. I am studying Japanese and find it hard to find “good” material (where “good” is defined by what I like). There are already tools to do something similar with subtitles from videos (an easier task – using the timing information of the video). But nothing, as far as I know, for texts.

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-23T08:46:59+00:00Added an answer on May 23, 2026 at 8:46 am

    There are tools called “sentence aligners” used in NLP research that does exactly what you want.

    I advise hunalign:

    http://mokk.bme.hu/resources/hunalign/

    and MS sentence aligner:

    http://research.microsoft.com/en-us/downloads/aafd5dcf-4dcc-49b2-8a22-f7055113e656/

    Both are quite OK, but remember that nothing is perfect. Sentences that are too hard to be aligned will be dropped and some sentences may be wrongly aligned.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I'm trying to do this: $('.summary').css('top',$(this).outerHeight()); Where I reference 'this' I would like to
I am trying to get summary by two conditions, much like Sumifs function of
I'm trying to generate a summary from a list of scores in SQL Server
I am trying to understand some performance summary output from MSBuild. The results look
I am trying to create summary for my oracle form. This summary would store
Summary: I'm trying to get video from IP camera in emgu, I could display
How are you? Summary: I'm trying to move my website from localhost to amazon-ec2
i'am trying to get the summary information from file with JAVA and I can't
Summary: I'm trying to write a text string to a column of type varchar(max)
Summary: I'm trying to do classification of some images depending on the angles between

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.