DOCSLIB.ORG

Automatic Non-Standard Hyphenation in Openoffice.Org

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Automatic Non-Standard Hyphenation in Openoffice.Org Automatic non-standard hyphenation in OpenOffice.org LÁSZLÓ NÉMETH nemeth (at) openoffice dot org Abstract The hyphenation algorithm of OpenOffice.org 2.0.2 is a generalization of TEX’s hyphenation algorithm that allows automatic non-standard hyphenation by competing standard and non-standard hyphenation patterns. With the suggested integration of linguistic tools for compound decomposition and word sense disambiguation, this algorithm would be able to do also more precise non-standard and standard hyphenation for several languages. Introduction standard hyphenation in TEX. Omega 2 has promis- Standard hyphenation consists of splitting a word and ing developments towards implementing sophisticated including a hyphen at the end of the first part of the automatic non-standard hyphenation for German and split word (unless the word already contained a hy- other languages [4, 5]. phen or n-dash at the break). While standard hyphen- The aim of the present project was to implement ation is widely applicable, several languages also use language-independent automatic non-standard hyphen- non-standard hyphenation. ation in OpenOffice.org. In this article we present Table 1 shows examples for non-standard hyphen- our results, introduce old and new hyphenation algo- ation: character deletions and other changes at hy- rithms, extension of the Hungarian hyphenation pat- phenation break points in European writing systems. terns and finally show the possibility of integrating Some non-standard hyphenation can be handled easily compound word decomposition and word sense dis- by computer, like the mandatory middle dot deletion ambiguation to our algorithm. from Catalan digraph ll. But complex analysis is neces- Results sary for languages, like German,1 Hungarian, Swedish T X’s hyphenation is the de facto standard in the free and Norwegian to recognize hyphenation points. For E software world, because the hyphenators of the free instance, the Swedish word form glassko has three dif- programs mentioned in the previous section are all ferent meanings, and can be hyphenated as glas- sko based on Liang’s hyphenation algorithm from T X82 (glass shoe), glass- ko (ice cream cow) and in the non- E 9 , and use the T X hyphenation patterns. Thus, standard way, glass- sko (ice cream shoe). [ ] E we have developed an extension for OpenOffice.org’s Such non-standard hyphenation plays an impor- ALT Linux LibHnj hyphenator to do automatic non- tant role in good typesetting. Commercial DTP pro- standard hyphenation. The result is based on a gener- grams, even word processors, support automatic non- alization of Liang’s original algorithm which also al- standard hyphenation, often by licensing third party lows easy integration of special linguistic tools to han- libraries. The most important free alternatives, such dle compound word decomposition and word sense as Apache FOP, GNU Troff, KDE KOffice, Open- disambiguation in automatic hyphenation. The Hun- Office.org, Scribus, and TEX and its variants, do not garian hyphenation patterns were extended with non- support automatic non-standard hyphenation. TEX standard hyphenation patterns. has a hyphenation primitive, the \discretionary The improved hyphenation library (without inte- command. There are TEX macros in the Babel package grated linguistic tools) is part of the OpenOffice.org for non-standard hyphenation, for instance, \lgem for 2.0.2 with the extended Hungarian hyphenation pat- Catalan l.l, \ck or "ck for German, ~ssz for Hungar- terns. Developers can download a standalone version ian, \= for Polish, but there is no real automatic non- 1German orthography before the spelling reform of 1996. 750 TUGboat, Volume 27 (2006), No. 2 — Proceedings of EuroTEX 2006 Automatic non-standard hyphenation in OpenOffice.org Language Example Hyphenation Description Catalan paral.lel paral- lel digraph l.l represents long (geminated) l Dutch reëel re- eel diaeresis and hyphenation sign syllable breaks omaatje oma- tje vowel lengthening with diminutive -tje English eighteen eight- teen suggested pretty hyphenation by D. E. Knuth [6] German Zucker Zuk- ker digraphs ck and kk represent long k Schiffahrt Schiff- fahrt triple consonants at compound word boundary Greek Μαΐου Μα- ίου diaeresis and hyphenation sign syllable breaks Hungarian asszonnyal asz- szony- nyal simplified double digraphs (long sz and ny phonemes) Norwegian bussjåfør buss- sjåfør triple consonants at compound word boundary Polish kong-fu kong- -fu repeated hyphen at line begin Swedish tillåta till- låta triple consonants at compound word boundary Table 1: Non-standard hyphenation in European languages .algorithm. hyphenation is suppressed by TEX, so we end up with 4l1g4 the correct al- go- rithm. l g o3 1g o One of the most notable features of this pattern- 2i t h based hyphenation is the human-readable format of 4h1m the knowledge database, in contrast to an equivalent ----------------- finite state machine or a similarly good artificial neural 4 1 4 3 2 0 4 1 network. This format is good for manual checking and a l-g o-r i t h-m corrections. Figure 1:TEX hyphenation of ‘algorithm’ Missing features In TEX’s automatic hyphenation the most wanted fea- tures are non-standard hyphenation, compound word of this library with an example executable from the analysis, word sense disambiguation and taboo word Lingucomponent project home [14]. filtering [12, 13].2 Liang’s hyphenation algorithm Sojka’s non-standard hyphenation extension Franklin M. Liang’s hyphenation algorithm is based In 12 Petr Sojka suggests a non-standard hyphen- on competing hyphenation patterns. The patterns can [ ] ation extension for Liang’s algorithm. His algorithm give excellent compression for a hyphenation dictio- first searches all hyphenation points of a word using nary, and using these patterns the fast hyphenator al- Liang’s algorithm, and then matches patterns from a gorithm can also correctly hyphenate unknown (non- non-standard hyphenation table at valid hyphenation dictionary) words most of the time. Liang’s work points, replaces the matching pattern with a special covers also the machine learning of the hyphenation character, and rechecks the hyphenation of the new patterns and exceptions by PatGen pattern generator. word at this special character with Liang’s algorithm. The hyphenation patterns can allow and prohibit The non-standard hyphenation point will be chosen if hyphenation breaks on multiple levels. Figure 1 shows the second hyphenation is successful. Using a ck % the pattern matching on the word ‘algorithm’. The (k- k) pattern data from a non-standard hyphenation→ TEX English hyphenation patterns 4l1g4, lgo3, 1go, table, the German word Zucker will be Zu%er after 2ith and 4h1m match this word and determine its hyphenation. Only odd numbers mean hyphenation 2Liang’s hyphenation algorithm and its compact implementation breaks. If two (or more) patterns have numbers in using packed trie data structure was perfect twenty-five years ago for English and for computers with less than a few MB RAM. Nowadays the same place, the highest number wins. The al- internationalization (handling multiple languages) is a standard in go- rith- m hyphenation is bad, but the last one-letter software industry and free software development. Modern personal computers have much more memory and speed to enable using additional special linguistic tools in hyphenation. TUGboat, Volume 27 (2006), No. 2 — Proceedings of EuroTEX 2006 751 László Németh Pattern Example Hyphenation .asszonnyal. s1s z/sz=sz,1,3 l·1l/l=l paral.lel paral- lel n1n y/ny=ny,1,3 e1ë/e=e reëel re- eel ------------------- a1atje./a=t,1,3 omaatje oma- tje 0 1 0 0 0 1 0 0 0/sz=sz,2,3,ny=ny,6,3 eigh1tee/t=t,5,1 eighteen eight- teen a s-s z o n-n y a l/sz=sz,2,3,ny=ny,6,3 c1k/k=k Zucker Zuk- ker schif1f/ff=f,5,2 Schiffahrt Schiff- fahrt Figure 2: Hyphenation of asszonnyal 1ΐ/=ί Μαΐου Μα- ίου s1sz/sz=sz asszonnyal asz- szony- Table 2 shows possible hyphenation patterns for n1ny/ny=ny nyal Table 1. The dots in the patterns match the word bus1s/ss=s,3,2 bussjåfør buss- sjåfør boundaries. The first dot doesn’t affect the character 7-/=- kong-fu kong- -fu positions in the non-standard hyphenation subranges: .til1lå/ll=l,3,2 tillåta till- låta .zuc1ker/k=k,3,2. Figure 2 shows the result of ap- Table 2: Extended hyphenation patterns for Table 1 plying multiple non-standard pattern matching. Rules the replacement, and the pattern zu%1er permits non- A single subregion must contain exactly one hyphen- standard hyphenation with k- k (Zuk- ker). ation point (indicated by an odd number in Liang’s syntax). There may also be explicit non-breakable Problems points (indicated by even numbers) in the subregion, It’s possible to use the pattern generator on a pre- and any breakable or non-breakable points out of the pared input dictionary for Sojka’s algorithm, but then subregion. we lose the human-readable format of hyphenation A standard and a non-standard hyphenation pat- patterns. The biggest problem is to use competing tern matching the same hyphenation point must not patterns on multiple levels. That is why instead of us- be on the same hyphenation level. For instance, ing difficult redundant patterns with special hyphen- c1 and zuc1ker/k=k,3,2 are invalid, while c1 and ation characters, Sojka suggests global parameters (left zuc3ker/k=k,3,2 are valid extended hyphenation and right non-standard hyphenation penalties) to for- patterns. bid standard hyphenations near the non-standard hy- phenation points. But German, Hungarian, Norwe- Unicode character encoding gian and Swedish non-standard hyphenation need true Unicode is the basis for internationalization.3 Thanks competing patterns. to the unambiguous start positions of the multibyte- characters, Liang’s algorithm works perfectly with the OpenOffice.org’s extension UTF-8 Unicode encoding.
Load more

Recommended publications
  • Compound Word Formation.Pdf
    Snyder, William (in press) Compound word formation. In Jeffrey Lidz, William Snyder, and Joseph Pater (eds.) The Oxford Handbook of Developmental Linguistics . Oxford: Oxford University Press. CHAPTER 6 Compound Word Formation William Snyder Languages differ in the mechanisms they provide for combining existing words into new, “compound” words. This chapter will focus on two major types of compound: synthetic -ER compounds, like English dishwasher (for either a human or a machine that washes dishes), where “-ER” stands for the crosslinguistic counterparts to agentive and instrumental -er in English; and endocentric bare-stem compounds, like English flower book , which could refer to a book about flowers, a book used to store pressed flowers, or many other types of book, as long there is a salient connection to flowers. With both types of compounding we find systematic cross- linguistic variation, and a literature that addresses some of the resulting questions for child language acquisition. In addition to these two varieties of compounding, a few others will be mentioned that look like promising areas for coordinated research on cross-linguistic variation and language acquisition. 6.1 Compounding—A Selective Review 6.1.1 Terminology The first step will be defining some key terms. An unfortunate aspect of the linguistic literature on morphology is a remarkable lack of consistency in what the “basic” terms are taken to mean. Strictly speaking one should begin with the very term “word,” but as Spencer (1991: 453) puts it, “One of the key unresolved questions in morphology is, ‘What is a word?’.” Setting this grander question to one side, a word will be called a “compound” if it is composed of two or more other words, and has approximately the same privileges of occurrence within a sentence as do other word-level members of its syntactic category (N, V, A, or P).
    [Show full text]
  • Hunspell – the Free Spelling Checker
    Hunspell – The free spelling checker About Hunspell Hunspell is a spell checker and morphological analyzer library and program designed for languages with rich morphology and complex word compounding or character encoding. Hunspell interfaces: Ispell-like terminal interface using Curses library, Ispell pipe interface, OpenOffice.org UNO module. Main features of Hunspell spell checker and morphological analyzer: - Unicode support (affix rules work only with the first 65535 Unicode characters) - Morphological analysis (in custom item and arrangement style) and stemming - Max. 65535 affix classes and twofold affix stripping (for agglutinative languages, like Azeri, Basque, Estonian, Finnish, Hungarian, Turkish, etc.) - Support complex compoundings (for example, Hungarian and German) - Support language specific features (for example, special casing of Azeri and Turkish dotted i, or German sharp s) - Handle conditional affixes, circumfixes, fogemorphemes, forbidden words, pseudoroots and homonyms. - Free software (LGPL, GPL, MPL tri-license) Usage The src/tools dictionary contains ten executables after compiling (or some of them are in the src/win_api): affixcompress: dictionary generation from large (millions of words) vocabularies analyze: example of spell checking, stemming and morphological analysis chmorph: example of automatic morphological generation and conversion example: example of spell checking and suggestion hunspell: main program for spell checking and others (see manual) hunzip: decompressor of hzip format hzip: compressor of
    [Show full text]
  • Building a Treebank for French
    Building a treebank for French £ £¥ Anne Abeillé£ , Lionel Clément , Alexandra Kinyon ¥ £ TALaNa, Université Paris 7 University of Pennsylvania 75251 Paris cedex 05 Philadelphia FRANCE USA abeille, clement, [email protected] Abstract Very few gold standard annotated corpora are currently available for French. We present an ongoing project to build a reference treebank for French starting with a tagged newspaper corpus of 1 Million words (Abeillé et al., 1998), (Abeillé and Clément, 1999). Similarly to the Penn TreeBank (Marcus et al., 1993), we distinguish an automatic parsing phase followed by a second phase of systematic manual validation and correction. Similarly to the Prague treebank (Hajicova et al., 1998), we rely on several types of morphosyntactic and syntactic annotations for which we define extensive guidelines. Our goal is to provide a theory neutral, surface oriented, error free treebank for French. Similarly to the Negra project (Brants et al., 1999), we annotate both constituents and functional relations. 1. The tagged corpus pronoun (= him ) or a weak clitic pronoun (= to him or to As reported in (Abeillé and Clément, 1999), we present her), plus can either be a negative adverb (= not any more) the general methodology, the automatic tagging phase, the or a simple adverb (= more). Inflectional morphology also human validation phase and the final state of the tagged has to be annotated since morphological endings are impor- corpus. tant for gathering constituants (based on agreement marks) and also because lots of forms in French are ambiguous 1.1. Methodology with respect to mode, person, number or gender. For exam- 1.1.1.
    [Show full text]
  • Compounds and Word Trees
    Compounds and word trees LING 481/581 Winter 2011 Organization • Compounds – heads – types of compounds • Word trees Compounding • [root] [root] – machine gun – land line – snail mail – top-heavy – fieldwork • Notice variability in punctuation (to ignore) Compound stress • Green Lake • bluebird • fast lane • Bigfoot • bad boy • old school • hotline • Myspace Compositionality • (Extent to which) meanings of words, phrases determined by – morpheme meaning – structure • Predictability of meaning in compounds – ’roid rage (< 1987; ‘road rage’ < 1988) – football (< 1486; ‘American football’ 1879) – soap opera (< 1939) Head • ‘A word in a syntactic construction or a morpheme in a morphological one that determines the grammatical function or meaning of the construction as a whole. For example, house is the head of the noun phrase the red house...’ Aronoff and Fudeman 2011 Righthand head rule • In English (and most languages), morphological heads are the rightmost non- inflectional morpheme in the word – Lexical category of entire compound = lexical category of rightmost member – Not Spanish (HS example p. 139) • English be- – devil, bedevil Compounding and lexical category noun verb adjective noun machine friend request skin-deep gun foot bail rage quit verb thinktank stir-fry(?) ? adjective high school dry-clean(?) red-hot low-ball ‘the V+N pattern is unproductive and limited to a few lexically listed items, and the N+V pattern is not really productive either.’ HS: 138 Heads of words • Morphosyntactic head: determines lexical category – syntactic distribution • That thinktank is overrated. – morphological characteristics; e.g. inflection • plurality: highschool highschools • tense on V: dry-clean dry-cleaned • case on N – Sahaptin wáyxti- “run, race” wayxtitpamá “pertaining to racing” wayxtitpamá k'úsi ‘race horse’ Máytski=ish á-shapaxwnawiinknik-xa-na wayxtitpamá k'úsi-nan..
    [Show full text]
  • A Poor Man's Approach to CLEF
    A poor man's approach to CLEF Arjen P. de Vries1;2 1 CWI, Amsterdam, The Netherlands 2 University of Twente, Enschede, The Netherlands [email protected] October 16, 2000 1 Goals The Mirror DBMS [dV99] aims specifically at supporting both data management and content man- agement in a single system. Its design separates the retrieval model from the specific techniques used for implementation, thus allowing more flexibility to experiment with a variety of retrieval models. Its design based on database techniques intends to support this flexibility without caus- ing a major penalty on the efficiency and scalability of the system. The support for information retrieval in our system is presented in detail in [dVH99], [dV98], and [dVW99]. The primary goal of our participation in CLEF is to acquire experience with supporting Dutch users. Also, we want to investigate whether we can obtain a reasonable performance without requiring expensive (but high quality) resources. We do not expect to obtain impressive results with our system, but hope to obtain a baseline from which we can develop our system further. We decided to submit runs for all four target languages, but our main interest is in the bilingual Dutch to English runs. 2 Pre-processing We have used only ‘off-the-shelf' tools for stopping, stemming, compound-splitting (only for Dutch) and translation. All our tools are available for free, without usage restrictions for research purposes. Stopping and stemming Moderately sized stoplists, of comparable coverage, were made available by University of Twente (see also Table 1). We used the stemmers provided by Muscat1, an open source search engine.
    [Show full text]
  • Robust Prediction of Punctuation and Truecasing for Medical ASR
    Robust Prediction of Punctuation and Truecasing for Medical ASR Monica Sunkara Srikanth Ronanki Kalpit Dixit Sravan Bodapati Katrin Kirchhoff Amazon AWS AI, USA fsunkaral, [email protected] Abstract the accuracy of subsequent natural language under- standing algorithms (Peitz et al., 2011a; Makhoul Automatic speech recognition (ASR) systems et al., 2005) to identify information such as pa- in the medical domain that focus on transcrib- tient diagnosis, treatments, dosages, symptoms and ing clinical dictations and doctor-patient con- signs. Typically, clinicians explicitly dictate the versations often pose many challenges due to the complexity of the domain. ASR output punctuation commands like “period”, “add comma” typically undergoes automatic punctuation to etc., and a postprocessing component takes care enable users to speak naturally, without hav- of punctuation restoration. This process is usu- ing to vocalise awkward and explicit punc- ally error-prone as the clinicians may struggle with tuation commands, such as “period”, “add appropriate punctuation insertion during dictation. comma” or “exclamation point”, while true- Moreover, doctor-patient conversations lack ex- casing enhances user readability and improves plicit vocalization of punctuation marks motivating the performance of downstream NLP tasks. This paper proposes a conditional joint mod- the need for automatic prediction of punctuation eling framework for prediction of punctuation and truecasing. In this work, we aim to solve the and truecasing using pretrained masked lan- problem of automatic punctuation and truecasing guage models such as BERT, BioBERT and restoration to medical ASR system text outputs. RoBERTa. We also present techniques for Most recent approaches to punctuation and true- domain and task specific adaptation by fine- casing restoration problem rely on deep learning tuning masked language models with medical (Nguyen et al., 2019a; Salloum et al., 2017).
    [Show full text]
  • Lexical Analysis
    Lexical Analysis Lecture 3 Instructor: Fredrik Kjolstad Slide design by Prof. Alex Aiken, with modifications 1 Outline • Informal sketch of lexical analysis – Identifies tokens in input string • Issues in lexical analysis – Lookahead – Ambiguities • Specifying lexers (aka. scanners) – By regular expressions (aka. regex) – Examples of regular expressions 2 Lexical Analysis • What do we want to do? Example: if (i == j) Z = 0; else Z = 1; • The input is just a string of characters: \tif (i == j)\n\t\tz = 0;\n\telse\n\t\tz = 1; • Goal: Partition input string into substrings – Where the substrings are called tokens 3 What’s a Token? • A syntactic category – In English: noun, verb, adjective, … – In a programming language: Identifier, Integer, Keyword, Whitespace, … 4 Tokens • A token class corresponds to a set of strings Infinite set • Examples i var1 ports – Identifier: strings of letters or foo Person digits, starting with a letter … – Integer: a non-empty string of digits – Keyword: “else” or “if” or “begin” or … – Whitespace: a non-empty sequence of blanks, newlines, and tabs 5 What are Tokens For? • Classify program substrings according to role • Lexical analysis produces a stream of tokens • … which is input to the parser • Parser relies on token distinctions – An identifier is treated differently than a keyword 6 Designing a Lexical Analyzer: Step 1 • Define a finite set of tokens – Tokens describe all items of interest • Identifiers, integers, keywords – Choice of tokens depends on • language • design of parser 7 Example • Recall \tif
    [Show full text]
  • Name Description
    hunspell(4) hunspell(4) NAME hunspell − format of Hunspell dictionaries and affix files DESCRIPTION Hunspell(1) requires twofiles to define the language that it is spell checking. The first file is a dictionary containing words for the language, and the second is an "affix" file that defines the meaning of special flags in the dictionary. Adictionary file (*.dic) contains a list of words, one per line. The first line of the dictionaries (except per- sonal dictionaries) contains the approximate word count (for optimal hash memory size). Each word may optionally be followed by a slash ("/") and one or more flags, which represents affixes or special attributes. Dictionary words can contain also slashes with the "" syntax. Default flag format is a single (usually alpha- betic) character.After the dictionary words there are also optional fields separated by tabulators or spaces (spaces only work as morphological field separators, if theyare followed by morphological field ids, see also Optional data fields). Personal dictionaries are simple word lists. Asterisk at the first character position signs prohibition. Asec- ond word separated by a slash sets the affixation. foo Foo/Simpson *bar In this example, "foo" and "Foo" are personal words, plus Foo will be recognized with affixes of Simpson (Foo’setc.) and bar is a forbidden word. An affix file (*.aff) may contain a lot of optional attributes. For example, SET is used for setting the char- acter encodings of affixes and dictionary files. TRY sets the change characters for suggestions. REP sets a replacement table for multiple character corrections in suggestion mode. PFX and SFX defines prefix and suffix classes named with affix flags.
    [Show full text]
  • Part-Of-Speech Tagging Guidelines for the Penn Treebank Project (3Rd Revision)
    University of Pennsylvania ScholarlyCommons Technical Reports (CIS) Department of Computer & Information Science 7-1-1990 Part-of-Speech Tagging Guidelines for the Penn Treebank Project (3rd Revision) Beatrice Santorini University of Pennsylvania, [email protected] Follow this and additional works at: https://repository.upenn.edu/cis_reports Part of the Computer Sciences Commons Recommended Citation Beatrice Santorini, "Part-of-Speech Tagging Guidelines for the Penn Treebank Project (3rd Revision)", . July 1990. University of Pennsylvania Department of Computer and Information Science Technical Report No. MS-CIS-90-47. This paper is posted at ScholarlyCommons. https://repository.upenn.edu/cis_reports/570 For more information, please contact [email protected]. Part-of-Speech Tagging Guidelines for the Penn Treebank Project (3rd Revision) Abstract This manual addresses the linguistic issues that arise in connection with annotating texts by part of speech ("tagging"). Section 2 is an alphabetical list of the parts of speech encoded in the annotation systems of the Penn Treebank Project, along with their corresponding abbreviations ("tags") and some information concerning their definition. This section allows ouy to find an unfamiliar tag yb looking up a familiar part of speech. Section 3 recapitulates the information in Section 2, but this time the information is alphabetically ordered by tags. This is the section to consult in order to find out what an unfamiliar tag means. Since the parts of speech are probably familiar to you from high school English, you should have little difficulty in assimilating the tags themselves. However, it is often quite difficulto t decide which tag is appropriate in a particular context.
    [Show full text]
  • Learning to SMILE
    Workshop track - ICLR 2016 LEARNING TO SMILE(S) Stanisław Jastrz˛ebski,Damian Lesniak´ & Wojciech Marian Czarnecki Faculty of Mathematics and Computer Science Jagiellonian University Kraków, Poland [email protected] ABSTRACT This paper shows how one can directly apply natural language processing (NLP) methods to classification problems in cheminformatics. Connection between these seemingly separate fields is shown by considering standard textual representation of compound, SMILES. The problem of activity prediction against a target pro- tein is considered, which is a crucial part of computer aided drug design process. Conducted experiments show that this way one can not only outrank state of the art results of hand crafted representations but also gets direct structural insights into the way decisions are made. 1 INTRODUCTION Computer aided drug design has become a very popular technique for speeding up the process of finding new biologically active compounds by drastically reducing number of compounds to be tested in laboratory. Crucial part of this process is virtual screening, where one considers a set of molecules and predicts whether the molecules will bind to a given protein. This research focuses on ligand-based virtual screening, where the problem is modelled as a supervised, binary classification task using only knowledge about ligands (drug candidates) rather than using information about the target (protein). One of the most underrepresented application areas of deep learning (DL) is believed to be chem- informatics (Unterthiner et al., 2014; Bengio et al., 2012), mostly due the fact that data is naturally represented as graphs and there are little direct ways of applying DL in such setting (Henaff et al., 2015).
    [Show full text]
  • Building a Large Annotated Corpus of English: the Penn Treebank
    University of Pennsylvania ScholarlyCommons Technical Reports (CIS) Department of Computer & Information Science October 1993 Building a Large Annotated Corpus of English: The Penn Treebank Mitchell Marcus University of Pennsylvania, [email protected] Beatrice Santorini University of Pennsylvania Mary Ann Marcinkiewicz University of Pennsylvania Follow this and additional works at: https://repository.upenn.edu/cis_reports Recommended Citation Mitchell Marcus, Beatrice Santorini, and Mary Ann Marcinkiewicz, "Building a Large Annotated Corpus of English: The Penn Treebank", . October 1993. University of Pennsylvania Department of Computer and Information Science Technical Report No. MS-CIS-93-87. This paper is posted at ScholarlyCommons. https://repository.upenn.edu/cis_reports/237 For more information, please contact [email protected]. Building a Large Annotated Corpus of English: The Penn Treebank Abstract In this paper, we review our experience with constructing one such large annotated corpus--the Penn Treebank, a corpus consisting of over 4.5 million words of American English. During the first three-year phase of the Penn Treebank Project (1989-1992), this corpus has been annotated for part-of-speech (POS) information. In addition, over half of it has been annotated for skeletal syntactic structure. Comments University of Pennsylvania Department of Computer and Information Science Technical Report No. MS- CIS-93-87. This technical report is available at ScholarlyCommons: https://repository.upenn.edu/cis_reports/237 Building A Large Annotated Corpus of English: The Penn Treebank MS-CIS-93-87 LINC LAB 260 Mitchell P. Marcus Beatrice Santorini Mary Ann Marcinkiewicz University of Pennsylvania School of Engineering and Applied Science Computer and Information Science Department Philadelphia, PA 19104-6389 October 1993 Building a large annotated corpus of English: the Penn Treebank Mitchell P.
    [Show full text]
  • Real-Time Statistical Speech Translation
    Real-Time Statistical Speech Translation Krzysztof Wołk, Krzysztof Marasek Department of Multimedia Polish Japanese Institute of Information Technology, Koszykowa 86, 02-008 Warsaw [email protected] Abstract. This research investigates the Statistical Machine Translation approaches to translate speech in real time automatically. Such systems can be used in a pipeline with speech recognition and synthesis software in order to produce a real-time voice communication system between foreigners. We obtained three main data sets from spoken proceedings that represent three different types of human speech. TED, Europarl, and OPUS parallel text corpora were used as the basis for training of language models, for developmental tuning and testing of the translation system. We also conducted experiments involving part of speech tagging, compound splitting, linear language model interpolation, TrueCasing and morphosyntactic analysis. We evaluated the effects of variety of data preparations on the translation results using the BLEU, NIST, METEOR and TER metrics and tried to give answer which metric is most suitable for PL-EN language pair. Keywords: Machine translation, Speech translation, Machine learning, NLP, Knowledge-free learning. 1 Introduction Automated translation of Polish-English speech, as compared to the other languages, is a formidable challenge. It is complicated declension, leading to a very wide range of vocabulary, its grammatical components and rules, cases, gender forms (7 and 15, respectively) for nouns and adjectives that drive its complexity. This complexity impacts both the Polish language data and data structures necessary for the Statistical Machine Translation (SMT). Polish and English are very different in their syntax. Since English lacks declension endings, the way in which words are ordered in an English sentence is very significant for their meaning.
    [Show full text]