web TODO |
Overall, the task of MT data pre-processing is to drop any distinctions that are not important for the output.
Inspecting Text Data
Two texts that look the same might not be identical. MT systems do not see the strings as humans do but instead, they work with the actual byte representation. Therefore, data pre-processing is a very important step in system development.
Unicode includes a number of special characters which can complicate text processing for an MT system developer. The following table contains examples of some of the more devious characters:
|U+200B||Zero-width space||An invisible space.|
|U+200E||Left-to-right mark||An invisible character used in texts with mixed scripts (e.g. Latin and Arabic) to indicate reading direction.|
|U+2028||Line separator||A Unicode newline which is often not interpreted by text editors (and can be invisible).|
|U+2029||Paragraph separator||Separates paragraphs, implies a new line (also often ignored).|
Decode Unicode is a useful webpage with information on Unicode characters.
Often, a file hexdump is the most useful diagnostic tool. E.g. the Linux command xxd provides the necessary functionality.
Unicode often provides many ways how to write a single character. For example, the letter "a" might be written with Latin or Cyrillic script. A nice summary of Latin-like alphabets is available at homoglyphs.net
Aside from seemingly identical, but differently encoded characters, problems commonly seen in data include:
- Confusion of 0 (zero) and O (capital letter)
- Inconsistent letter case: English word I written in lowercase etc. (notorious e.g. in movie subtitles)
- Various systematic mis-spellings -- all of these variants of "I'll" (I will) were observed in movie subtitles: i'll Ill l'll 1'll 1'11
- Different symbols for various punctuation (quotes, dashes, apostrophe etc.)
A good text editor is an essential pre-requisite for successful inspection of text data and the implementation of suitable pre-processing. We provide several random tips for the VIM editor:
Set file encoding to UTF-8:
Show the code of character under cursor:
Set or remove BOM (byte-order mark) for current file:
:set bomb :set nobomb
Spot Five Differences
A text file with the Russian word "чай" (tea) can be written in seemingly identical ways which however differ significantly on byte level.
First is the very file beginning, which may and may not include the Unicode byte-order-mark symbol (BOM), which is 3 bytes long.
The second and third difference is the presence of two Unicode non-printing characters, namely zero-width space and left-to-right direction mark.
The fourth difference is the code for the letter "a" which can be written either in Latin or in Cyrillic script (looks identical).
The fifth, final difference is the representation of the last letter "й". It can be written either as one letter or as "и" followed by a wedge (the diacritics).
The most suitable tokenization can be task-dependent. For example, in parsing, we would like to keep adjectives such as "red-haired" as one word, while for phrase-based MT, it is useful to split such words.
A basic but quite robust approach is to split whenever the Unicode character category changes. Imagine reading the input character by character. When we observe that so far, there have been letters (category L) and suddenly, there is punctuation (category P), we insert a space. During the same process, it is useful to convert all whitespace (tabulators, spaces, non-breaking spaces and sequences of such) to a single space character.
However, in many situations, a more sophisticated, linguistically motivated tokenization scheme is useful. E.g. for words such as "don't", "could't", "shouldn't", we can obtain a nice generalization by splitting off "n't":
- don't -> do n't
- shouldn't -> should n't
- couldn't -> could n't
It is essential for data tokenization to be consistent. All of our training data should conform to the same pre-processing scheme and an identical pipeline should be applied at test time (when our system runs and we translate new data).
This is the first lecture accompanied by programming exercises. Before starting, you should follow the instructions on how to use the CodEx submission system.
Follow the links to see the description of each task and a submission interface with automatic evaluation of your solutions.