ArticleslgStudy

computer science

Paraphrasing (computational linguistics)

Paraphrasing (computational linguistics) is a computer science topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Paraphrasing (computational linguistics) rather than just read about it. In short: Paraphrase or paraphrasing in computational linguistics is the natural language processing task of detecting and generating paraphrases. Applications of paraphrasing are varied including information retrieval, question answering, text summarization, and plagiarism detection.

Key takeaways

  • Paraphrasing (computational linguistics) belongs to computer science; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect Paraphrasing (computational linguistics) to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of Paraphrasing (computational linguistics) from memory before moving on to harder problems.

Reference excerpt

Paraphrase or paraphrasing in computational linguistics is the natural language processing task of detecting and generating paraphrases. Applications of paraphrasing are varied including information retrieval, question answering, text summarization, and plagiarism detection. Paraphrasing is also useful in the evaluation of machine translation, as well as semantic parsing and generation of new samples to expand existing corpora.

Paraphrase generation

Multiple sequence alignment Barzilay and Lee proposed a method to generate paraphrases through the usage of monolingual parallel corpora, namely news articles covering the same event on the same day. Training consists of using multi-sequence alignment to generate sentence-level paraphrases from an unannotated corpus. This is done by

finding recurring patterns in each individual corpus, i.e. "X (injured/wounded) Y people, Z seriously" where X, Y, Z are variables finding pairings between such patterns the represent paraphrases, i.e. "X (injured/wounded) Y people, Z seriously" and "Y were (wounded/hurt) by X, among them Z were in serious condition" This is achieved by first clustering similar sentences together using n-gram overlap. Recurring patterns are found within clusters by using multi-sequence alignment. Then the position of argument words is determined by finding areas of high variability within each cluster, aka between words shared by more than 50% of a cluster's sentences. Pairings between patterns are then found by comparing similar variable words between different corpora. Finally, new paraphrases can be generated by choosing a matching cluster for a source sentence, then substituting the source sentence's argument into any number of patterns in the cluster.

Phrase-based machine translation Paraphrase can also be generated through the use of phrase-based translation as proposed by Bannard and Callison-Burch. The chief concept consists of aligning phrases in a pivot language to produce potential paraphrases in the original language. For example, the phrase "under control" in an English sentence is aligned with the phrase "unter kontrolle" in its German counterpart. The phrase "unter kontrolle" is then found in another German sentence with the aligned English phrase being "in check," a paraphrase of "under control." The probability distribution can be modeled as Pr ( e 2 | e 1 ) {\displaystyle \Pr(e_{2}|e_{1})} , the probability phrase e 2 {\displaystyle e_{2}} is a paraphrase of e 1 {\displaystyle e_{1}} , which is equivalent to Pr ( e 2 | f ) Pr ( f | e 1 ) {\displaystyle \Pr(e_{2}|f)\Pr(f|e_{1})} summed over all f {\displaystyle f} , a potential phrase translation in the pivot language. Additionally, the sentence e 1 {\displaystyle e_{1}} is added as a prior to add context to the paraphrase. Thus the optimal paraphrase, e 2 ^ {\displaystyle {\hat {e_{2}}}} can be modeled as:

e 2 ^ = arg max e 2 ≠ e 1 Pr ( e 2 | e 1 , S ) = arg max e 2 ≠ e 1 ∑ f Pr ( e 2 | f , S ) Pr ( f | e 1 , S ) {\displaystyle {\hat {e_{2}}}={\text{arg}}\max _{e_{2}\neq e_{1}}\Pr(e_{2}|e_{1},S)={\text{arg}}\max _{e_{2}\neq e_{1}}\sum _{f}\Pr(e_{2}|f,S)\Pr(f|e_{1},S)}

Pr ( e 2 | f ) {\displaystyle \Pr(e_{2}|f)} and Pr ( f | e 1 ) {\displaystyle \Pr(f|e_{1})} can be approximated by simply taking their frequencies. Adding S {\displaystyle S} as a prior is modeled by calculating the probability of forming the S {\displaystyle S} when e 1 {\displaystyle e_{1}} is substituted with e 2 {\displaystyle e_{2}} .

… excerpt ends here. Continue reading the full article.

Worked examples

Example 1 — a first encounter with Paraphrasing (computational linguistics)

Start with the simplest possible case. Write down what Paraphrasing (computational linguistics) claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In computer science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Paraphrasing (computational linguistics) before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Paraphrasing (computational linguistics) ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Paraphrasing (computational linguistics)

In research
Paraphrasing (computational linguistics) appears in computer science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses Paraphrasing (computational linguistics) in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
Paraphrasing (computational linguistics) is common in secondary-school and first-year university syllabi. It links to neighbouring topics Computational linguistics, Machine learning, so understanding it makes those chapters shorter.
In everyday life
Look for Paraphrasing (computational linguistics) outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.
Ask Teacher Smith questions about this articleOpens your AI tutor with a question about “Paraphrasing (computational linguistics)” →

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Paraphrasing (computational linguistics) in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Paraphrasing (computational linguistics) means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain Paraphrasing (computational linguistics) out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Paraphrasing (computational linguistics) in simple terms?

Paraphrase or paraphrasing in computational linguistics is the natural language processing task of detecting and generating paraphrases. Applications of paraphrasing are varied including information retrieval, question answering, text summarization, and plagiarism detection.

Why does Paraphrasing (computational linguistics) matter?

Because it connects several computer science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Paraphrasing (computational linguistics)?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Paraphrasing (computational linguistics).

Tags

  • Computational linguistics
  • Machine learning

Keep exploring