@article{ PaperReview,
       author = {Modi, Ankit},
       title = {Extracting bilingual terminologies from comparable corpora},
       month     = {October},
       year = {2013},
       pages     = {1--3},
       annote    = { 
\begin{center}{ABSTRACT}
\end{center}
This paper proposes a method for extracting bilingual terminologies from comparable corpora. For training, they have taken their data for 20 language pairs from EUROVOC thesarus. They use the SVM binary classifier for classification. Further, they measure Precision, recall and F-score for each language pairs. Over 90 percent of the generated term pairs are exact or partial translations. For some languages, precision of 100% was also recorded.

\section{Summary}
A comparable corpora has been defined as collections of source-target language document pairs that are topically related. A term has been defined as contiguous sequences of words in both source and target languages.
\newline
Let S denote the source language document and T denote the target language document. At first each term extracted from S is aligned with each term extracted from T. For each such potential S-term and T-term pair, certain features are extracted and then SVM binary classifier is used to classify them as term equivalent or not. A linear kernel is used with the SVM binary classifier and the trade-ff between training error and margin parameter is set to be c = 10.
\newline
\newline
Features are classified into following categories: 


\subsection{Dictionary based features}
\begin{enumerate}
\item {\bf isFirstWordTranslated:} It is a binary feature which indicates if the first word (or it's initial prefix) in the S-term is a translation of the first word in T-term.
\item {\bf isLastWordTranslated:} It is a binary feature which indicates if the last word (or it's last suffix) in the S-term is a translation of the first word in T-term.
\item {\bf percentageOfTranslatedWords:}It indicates the percentage of words in S which have their translation in T.
\item {\bf percentageOfNotTranslatedWords:}It indicates the percentage of words in S which have no translation inT.
\item {\bf longestTranslatedUnitInPercentage:} Expressed as a percentage, it indicates the ratio of the number of words within the longest contiguous sequence of source words which has a translation in the target term to the length of the source term.
\item {\bf longestNotTranslatedUnitInPercentage:} Expressed as a percentage, it indicates the percentage of the number of words within the longest sequence of source words which have no translations in the target term.
\item {\bf averagePercentageOfTranslatedWords:} It indicates the average of {\it  percentageOfTranslatedWords} when calculated from S to T and T to S.
\end {enumerate}
The first six features are computed in both directions i.e. S to T as well as T to S. So in total, we have 13 dictionary based features.


\subsection{Cognate based features}
\begin{enumerate}
\item {\bf Longest Common Subsequence Ratio (LCSR):} It measures the longest common non-consecutive sequence of characters
between two strings. 
\newline
LCSR(X,Y) = len[LCST(X,Y)] / max[len(X), len(Y)]
\item {\bf Longest Common Substring Ratio (LCSTR):} It measures the longest common consecutive string of characters
between two strings. 
\newline
LCSTR(X,Y) = len[LCS(X,Y)] / max[len(X), len(Y)]
\item {\bf Dice Similarity:} dice =2 * LCST / len(X) +  len(Y)
\item {\bf Needlemann Wunsch Distance (NWD):} NWD =  LCST /min[ len(X) +  len(Y)]
\item {\bf Levenshtein Distance:} It measures the minimum no. of operations (insertion, deletion and substitution) required to deduce one string from another. It is normalized by the following formula before being used
\newline
LDn = 1 - ( LD / max[len(X), len(Y)] )
\end {enumerate}
We have 5 cognate based features.


\subsubsection{Cognate based features with term matching}
These features are applicable to those pair of languages whose alphabets belong to a common character set. A mapping is performed from a source term to a target writing system or vice versa. After mapping, the same cognate features as mentioned above are applied, only this time in both the directions i.e. S to t as well as T to S. So we have 10 Cognate based features with term matching in total.


\subsection{Combined features}
\begin{enumerate}
\item {\bf isFirstWordCovered:} It is a binary feature which indicates if the first word in the S-term has a translation or transliteration in the target term.
\item {\bf isLastWordCovered:}  It is a binary feature which indicates if the last word in the S-term has a translation or transliteration in the target term.
\item {\bf percentageOfCoverage:}It indicates the percentage of source term words which have a translation or transliteration in the target term.
\item {\bf percentageOfNonCoverage:}It indicates the percentage of source term words which have niether a translation nor a transliteration in the target term.
\item {\bf difBetweenCoverageAndNonCoverage:} It indicates the difference between  percentageOfCoverage and  percentageOfNonCoverage.
\end {enumerate}
These features are computed in both directions i.e. S to T as well as T to S. So in total, we have 10 combined features.
\newline
In total, we have 38 pairs.

\section{Evaluation}
The performance of the classifier was evaluated by two methods. Firstly, some positive and negative examples are created and then precision, recall and f-score are calculated. The precision score ranges from 100 to 67 percent. 

Secondly, manual evaluation is done. In it, human assesors are asked to categorize each term pair into one of the following categories:  {\it Equivalence, Inclusion, Overlap and Unrelated}. Over 80 percent of the term pairs were assessed to be of the first category i.e.  {\it Equivalence}.


Though the error percentage was low, still the main reason of those were found to be the existence of words with very similar spellings but completely different meanings

\section{Future Work}
Further research can be carried out to look into the usefulness of the term pairs in various application scenarios such as machine translation etc.
 \newline
Review by : Ankit Modi (10104) 



                     }}

