text:
Patent US20030040900 - Automatic or semiautomatic translation system and method with post-editing ... - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inPatentsA computer translation system having viewing means on monitor of a translation-interface involving a couple of text-columns, wherein each text-column includes parallel scrolling field means, characterized in that said couple of text-columns is divisible horizontally, to realize at least two couples of...http://www.google.com/patents/US20030040900?utm_source=gb-gplus-sharePatent US20030040900 - Automatic or semiautomatic translation system and method with post-editing for the correction of errorsAdvanced Patent SearchTry the new Google Patents, with machine-classified Google Scholar results, and Japanese and South Korean patents.Publication numberUS20030040900 A1Publication typeApplicationApplication numberUS 10/205,809Publication dateFeb 27, 2003Filing dateJul 26, 2002Priority dateDec 28, 2000Also published asEP1346291A1, US7580828, WO2002054280A1Publication number10205809, 205809, US 2003/0040900 A1, US 2003/040900 A1, US 20030040900 A1, US 20030040900A1, US 2003040900 A1, US 2003040900A1, US-A1-20030040900, US-A1-2003040900, US2003/0040900A1, US2003/040900A1, US20030040900 A1, US20030040900A1, US2003040900 A1, US2003040900A1InventorsGiovanni D'AgostiniOriginal AssigneeD'agostini GiovanniExport CitationBiBTeX, EndNote, RefManPatent Citations (18), Referenced by (70), Classifications (4), Legal Events (2) External Links: USPTO, USPTO Assignment, EspacenetAutomatic or semiautomatic translation system and method with post-editing for the correction of errors
[0025] Regarding a language translation apparatus and method using context-based translation models. [0026] In particular: [0027] An apparatus for translating a series of source words in a first language to a series of target words in a second language. For an input series of source words, at least two target hypotheses, each including a series of target words, are generated. [0028] Each target word has a context comprising at least one other word in the target hypothesis. [0029] For each target hypothesis, a language model match score including an estimate of the probability of occurrence of the series of words in the target hypothesis. [0030] At least one alignment connecting each source word with at least one target word in the target hypothesis is identified. For each source word and each target hypothesis, a word match score including an estimate of the conditional probability of occurrence of the source word, given the target word in the target hypothesis which is connected to the source word and given the context in the target hypothesis of the target word which is connected to the source word. For each target hypothesis, a translation match score including a combination of the word match scores for the target hypothesis and the source words in the input series of source words. [0031] A target hypothesis match score including a combination of the language model match score for the target hypothesis and the translation match score for the target hypothesis. The target hypothesis having the best target hypothesis match score is output. [0032] U.S. Pat. No. 5,384,701; Jun. 7, 1991; in the name of British Telecommunications public limited company, London, England [0033] Regarding a Language translation system, and in particular: [0034] A language translation system for translating phrases from a first language into a second language comprises a store holding a collection of phrases in the second language. [0035] Phrases input in the first language are each characterized on the basis of one or more keywords, and the corresponding phrase in the second language is output. Such a phrasebook approach enables what is effectively rapid and accurate translation, even from speech. [0036] Since the phrases in the second language are prepared in advance and held in store, there need be no problems of poor translation or ungrammatical construction. [0037] The output may be in text, or, using speech synthesis, in voiced form. With appropriate choice of keywords it is possible to characterize a large number of relatively long and complex phrases with just a few keywords. [0038] U.S. Pat. No. 5,338,976; Jun. 16, 1992 in the name of Ricoh Company, Ltd., Tokyo, Japan [0039] Regarding an Interactive language conversion system; and in particular: [0040] A language conversion system includes a database of expression patterns in the object language, a relevance evaluation mechanism for evaluating a relevance of each expression patterns in the object language with respect to an input in the original language, a retrieval and identification mechanism for retrieving and identifying from the input in the original language information requested by the expression pattern in the object language required to generate an output in the object language, a selection mechanism for selecting the expression pattern in the object language conforming to the input in the original language depending on the relevance evaluated in the relevance evaluation mechanism, an output mechanism for generating the output in the object language based on the required information retrieved and identified from the input in the original language by the retrieval and identification mechanism, and a control mechanism for controlling operation sequences of the relevance evaluation mechanism, the retrieval and identification mechanism, the selection mechanism and the output mechanism. [0041] U.S. Pat. No. 5,659,765 filed on Mar. 14, 1995, Machine translation system in the name of Toppan Printing Co., Ltd., Tokyo, Japan [0042] Claiming: [0043] A machine translation system comprising: [0044] first input means for inputting a first character string written in a first language; [0045] second input means for inputting a second character string written in a second language; [0046] display means for simultaneously displaying the first and second character strings input from said first and second input means; linking means which has first designating means for designating a third character string included in the first character string displayed by said display means, and second designating means for designating a fourth character string included in the second character string displayed by said display means, and links the third and fourth character strings with each other; [0047] recording means for recording the third and fourth character strings linked by said linking means as a pair; and [0048] means for detecting the character string which is most similar to an original character string written in the first language from a plurality of recorded third character strings, and translating the original character string into a character string written in the second language by using a fourth character string linked with the detected character string. [0049] U.S. Pat. No. 5,426,583; Jan. 27, 1994 in the name of Uribe-Echebarria Diaz De Mendibil; Gregorio, Erandio, Bilbao, Spain [0050] Regarding Automatic interlingual translation system. [0051] Claiming [0052] A method for use in a computer to automatically translate a first text based on a source language to a second text based on a different target language, said method comprising the steps of: [0053] (a) analyzing said first text to achieve an arborescent-type clarification on morphological, syntactical and semantic characteristics of said first text; [0054] (b) translating the analyzed text to a first intermediate language, wherein said first intermediate language contains structural characteristics of said source language; [0055] (c) integrating the translated text into an interlingual, wherein said interlingual contains morphological, syntactical, and semantic features of a plurality of languages; [0056] (d) translating the integrated text to a second intermediate language, wherein said second intermediate language contains structural characteristics of said target language; and [0057] (e) converting the translated, integrated text to said second text. [0058] U.S. Pat. No. 4,604,698; Dec. 22, 1983 in the name of Sharp Kabushiki Kaisha, Osaka, Japan [0059] Regarding an Electronic translator including character input keys for inputting a first language word, a translator for translating the inputted first language word into the second language word, a retranslator for retranslating the second language word back to the first language word, and a display unit for displaying the inputted word, translated word and retranslated word. [0060] U.S. Pat. No. 4,439,836; Oct. 22, 1980 in the name of Sharp Kabushiki Kaisha, Osaka, Japan [0061] Regarding an Electronic translator, claiming: [0062] An electronic translator device for obtaining a second word represented in a second language equivalent to an input word in a first language, comprising: [0063] input means for entering the input word; [0064] first memory means for memorizing a plurality of first words in the first language, each of said first words comprising one or more first letters which remain unchanged regardless of inflection and one or more second letters which change according to inflection; [0065] address means operatively connected to said input means and responsive to entry of the input word for addressing said first memory means to develop one of the plurality of first words; [0066] detection means operatively connected to said first memory means and responsive to said address means for detecting equivalency between the input word and said first letters of respective first words; [0067] second memory means for memorizing a plurality of second words in the second language corresponding to first words stored in said first memory means; [0068] first means operatively connected to said detecting means for activating said second memory means whereby said second memory means develops a second word corresponding to the input word when the input word is equivalent to one of said first words; and [0069] second means operatively connected to said detecting means for indicating that one of said first words in said first memory means comprises a noninflected form of the input word. [0070] U.S. Pat. No. 4,633,435; Jul. 22, 1985 in the name of Sharp Kabushiki Kaisha, Osaka, Japan [0071] Regarding an Electronic language translator capable of modifying definite articles, and in particular regarding an electronic translator is featured in which sentences as stored are modified by replacing one or more words in one of the original sentences with one or more new words and by changing automatically one or more additional words in the original sentence, depending on the nature of the one or more new words entered in the sentence. For example, the one or more additional words may be definite articles or prepositions. [0072] U.S. Pat. No. 4,831,529; Feb. 12, 1987 in the name of Kabushiki Kaisha Toshiba, Kawasaki, Japan [0073] Regarding a Machine translation system [0074] Claiming: [0075] A machine translation system for translating a first language into a second language, which comprises: [0076] input means for entry of an original written sentence in the first language into the system; [0077] dictionary means having at least a first dictionary for storing various words in various parts of speech and their translation in the second language respectively corresponding to the words in the first language, and a second dictionary for storing various words designated as nouns corresponding to words in the first language; [0078] translation means for analyzing the original written sentence in the first language, for retrieving said dictionary means and for executing the translation processing of the input original, when any same word designated as nouns stored in the first dictionary is found in the second dictionary, the word stored in the second dictionary takes precedence over that in the first dictionary in the translation means; and [0079] output means for producing translated sentences in the second language obtained from said translation means. [0080] U.S. Pat. No. 5,020,021; Jan. 10, 1986 in the name of Hitachi, Ltd., Tokyo, Japan [0081] Regarding a System for automatic language translation using several dictionary storage areas and a noun table, and in particular regarding a translation method for a machine translation system provided with apparatus for parsing a source language sentence and for forming a target language translation in which a phrase omitted in the source language sentence is identified, and a word or phrase to be inserted for the omitted phrase is selected from stored words and phrases. For identifying an omitted phrase, a sentence pattern corresponding to a predicate in the source language sentence is formed so as to include not only cases governed by the predicate but also a semantic feature for each case. By comparing the source language sentence with the sentence pattern, a case which is omitted in the source language sentence but cannot be omitted in the target language translation is identified. For determining a word or phrase to be placed at the position of the omitted phrase, the nouns having appeared in the source language text is stored in a noun, together with the semantic feature, gender, person and number of each noun is searched for a noun having the same semantic feature as the omitted phrase. When a target language translation of the source language sentence is formed, a pronoun having the same gender, person and number as the omitted phrase is used as a target language equivalent for the omitted phrase, and thus a target language translation which is grammatically correct, is obtained. [0082] U.S. Pat. No. 5,093,788; Jun. 25, 1987 in the name of Sharp Kabushiki Kaisha, Osaka, Japan [0083] Regarding a Translation machine system with splitting and combining of sentences. [0084] And claiming: [0085] An electronic translation machine system for translating multiple sentences from a source language to a target language comprising: [0086] input means for inputting a plurality of source sentences; [0087] first buffer means in communication with said input means for storing said source sentences; [0088] position designation means coupled with said first buffer means for designating a division point separating a selected source sentence into parts and for inserting a position designation symbol in said selected source sentence; [0089] splitting means in communication with said first buffer means for scanning said selected source sentence for said position designation symbol and, once encountered, for splitting said selected source sentence into parts and for storing said parts in said first buffer means; and translation means for translating the parts of said selected source sentence stored in said buffer means from said source language to said target language. [0090] U.S. Pat. No. 5,175,684; Dec. 31, 1990 in the name of Trans-Link International Corp., Honolulu, Hi. [0091] Regarding an Automatic text translation and routing system, [0092] Claiming: [0093] A machine translation system comprising: [0094] a machine translation module which is capable of performing machine translation from input text of a source language to output text of a target language, said machine translation module having a plurality of target language submodules for performing machine translation into a plurality of different target languages; [0095] a receiving interface for receiving via a first telecommunications link an electronic input which is divided into pages, [0096] said input pages including a cover page having predefined fields containing system information therein and at least one text page in a source language, wherein said cover page includes at least a first predefined field designating an address of an addressee to which translated output text is to be sent, and a second predefined field designating a selected one of the plurality of different target languages into which the at least one text page is to be translated, and wherein said receiving interface includes a recognition module capable of electronically recognizing the address of the addressee designated in said first predefined field of the cover page of the received input pages, and the selected target language designated in said second predefined field of the cover page; [0097] a sending interface for sending output text generated by said machine translation module to an addressee via a second telecommunications link; and [0098] control means coupled to said receiving interface, said machine translation module, and said sending interface for recognizing the address and target language designated in said predefined fields of said cover page, for controlling said machine translation module to generate output text of the designated target language from the input text of the source language, and for operating said sending interface to automatically send the translated output text via the second telecommunications link to the designated address recognized from said predefined fields of said cover page. [0099] U.S. Pat. No. 5,303,151; Feb. 26, 1993 in the name of Microsoft Corporation, Redmond, Wash. [0100] Regarding a Method and system for translating documents using translation. [0101] Claiming: [0102] A computer system for translating a source language document written in a source language to a target language document written in a target language, the source language including a multiplicity of source terms and the target language including a multiplicity of target terms, the computer system including a display screen, the source language document, a product glossary having a plurality of source terms from the source language and a plurality of target terms from the target language, each source term being associated with the corresponding target term which translates the source term into the target language, the computer system comprising: [0103] means for producing a translation screen portion on the display screen, the translation screen portion including a current insertion point; [0104] means for displaying the source language document on the translation screen portion; [0105] means for comparing each of the plurality of source terms from the product glossary with the source terms in the source language document; [0106] inserting means for inserting a character adjacent to the source term in the source language document, in response to each comparison by the comparing means which produces a match between one of the source terms in the source language document and one of the source terms in the product glossary; [0107] means for associating in an index file the inserted character with a target term from the product glossary that translates the matched source term from the source language into the target language; [0108] means for inputting an insert target term command which contains a translation request character corresponding to the inserted character; [0109] means for retrieving the translation request character from the insert target term command; [0110] means for retrieving from the index file the target term associated with the retrieved translation request character; and [0111] means for inserting the retrieved target term on the translation screen portion in response to the insert target term command. DRAWBACKS OF THE STATE OF THE ART [0112] The drawbacks of the state of the art consist substantially in the fact that the current systems or translation methods do not allow the operator to reach a suitable working performance with high quality level of the translation if not at a very long time detriment for the necessary correction work of the skilled man, in particular we have observed that as the automatic translation, or semiautomatic translation, namely for fragments or sentences, it is never perfect, and has a lot of errors, one loses a lot of time to correct the text in post-editing, to adapt it to an acceptable quality level. [0113] Further even if one provides with a translation for fragments or sentences or paragraphs in continuous succession (machine-aided translation or interactive translation), in the same way one loses a lot of time for corrections, and this also for the repetition of cases, precisely repetition of the same type of translation mistake, that instead man, should not repeat because he is an intelligent being, while the computer will endlessly repeat the same mistake, unless the programmer who has supplied the operating instructions to the program does not intervene. [0114] The operator unfortunately cannot intervene in the programming system of which is equipped the respective translation engine. [0115] But even if the programmer could intervene, the time required for reprogramming or teaching of the new case, the check of the functionality and the advantage that one wants to obtain therefrom become inadmissible. [0116] In fact the mistake generated by the computer in the translation is likely to derive as an incorrect or ambiguous exposition, also grammatical in the text to translate, and even if only for that kind of text, as it is well known that when the human being writes he does not think about the rules, but writes on impulse and the cases of not respecting the rules are innumerable and always increasing, without considering the ambiguities and the plurality of meanings for the same word or expression. [0117] Consequently wanting to foresee and encode everything is impossible for the large number of possible combinations. [0118] When a text already edited is checked, the correction time is therefore always high even if there are automatic search replace engines. [0119] In fact the current automatic search and replace engines require to input the correction manually and each time, eventually upon selection of the text to correct. [0120] The quality of the search and replace often generates other errors due to the necessary adapting of what has been changed in the specific context in said position, being many times obliged to adapt the changing portion in accordance to the preceding text portion and to the following text portion. [0121] Today the systems for translation are very fast and require a time lower than reading the text to translate (e.g. ten pages few minutes): The quality of the resulting translation by automatic translation is not acceptable for the skilled man, and it needs a lot of time for correction (e.g. for 10 pages 4-5 hours) and this is because the skilled-translator man, always needs time to read, interpret, and then check up if the automatic translation system has made good or bad corrections, and then to provide always to the correction of what translated automatically. [0122] Therefore a lot of expert translators prefer to renounce to automatic translation because they use more time to correct than to do a direct translation without the use of the automatic or semiautomatic translation. [0123] The problem of the reduction of the translation time at a parity with the best resulting quality from the human translation is always in need, particularly for the current globalization of the markets and unification of the people who speak different languages. [0124] Consider for example the global communications, laws, patents, etc, where the quality of the translation should be at a maximum level. PURPOSE OF THE PRESENT INVENTION [0125] Purpose of the present invention is to avoid the abovementioned drawbacks and allow the obtainment of a perfect translation or in any way a high quality translation, namely at human level, or better, with the use of the automatic translation system or semiautomatic translation and comparatively in less time. [0126] Therefore the main purpose of the present invention is to use the automatic or interactive-semiautomatic computer translation but with strong reduction of the translation time and with the maximum obtainable quality with the intervention of the same skilled-operator. ESSENCE OF THE INVENTION [0127] The problem is solved with a system as claimed in claim 1, namely with a computer translation system having viewing means on monitor of a translation-interface involving a couple of text-columns, wherein each text-column includes parallel scrolling field means, characterized in that said couple of text-columns is divisible horizontally, to realize at least two couples of parallel scrolling fields, forming at least temporarily a “+”-structure in which, one pair of scrolling fields is below for translation and correction after translation, forming a couple of main translation and correction fields, and the second pair is over for accumulation of what translated checked and corrected, forming a couple of accumulating fields, said computer translation system having transfer means to progressively transfer the couples of top paragraphs of said main translation and correction fields to said accumulating fields. [0128] In this way checking and correction is more easy and fast, because of continuous alignment of top paragraphs of the main translation and correction couple of fields, making easy check between correspondent words and sentences of two parallel top-paragraphs of the entire text, strongly reducing in time. Furthermore transfer of checked top-paragraphs to the bottom accumulating fields, in adding to the accumulating fields, allow more easy checking and correction of remaining text in said main fields, this working being repeated until the entire text has been line-by-line checked, corrected and transferred to said accumulating fields (in technical speaking “line by line”,=paragraph by paragraph, because in electronic word process, a “RETURN” delimits a Complete Paragraph=“LINE”). [0129] Advantageously said translation system is endowed with moving means to move said couple of accumulator fields from immediately above said couple of main translation and correction fields to another place or disappear, said transfer means being anyway able to work to transfer paragraphs from main couple to the accumulator couple. [0130] In this way it is possible to check, paragraph by paragraph, the whole translation, transferring the checked text, paragraph by paragraph (“line-by-line” in computer programming) to said accumulating fields, reducing in checking-time over to 50% and obtaining better performance. [0131] A progress of translation is advantageously shown using a paragraph-counter means, indicating the number of checked paragraphs and the number of remaining to check and evidencing means of modified text in said couple of main translation and correction fields. In this way further reduction in the checking time is allowed because operators see immediately what remains to check. [0132] Advantageously the computer translation system is of the type having viewing means on monitor of a translation-interface involving a “T” structure, where the upper bar of the “T” is a line of control buttons and the vertical shank is a dividing line forming a couple of text-columns, wherein each column includes scrolling field means proportioned in the width to the length of the text contained in rapport to the opposed parallel one, characterized in that said couple of text-columns is divisible horizontally forming a -structure for having four scrolling fields in a form of at least two pairs of parallel scrolling fields, one pair below for translation and correction after translation forming a couple of main translation and correction fields and over this a second pair for accumulation of what translated checked and corrected, forming a couple of accumulating fields. [0133] The solution process provides an automatic/semiautomatic translation method, for processing the translation in the desired language, of the type utilizing a translation system which comprises means of automatic or semiautomatic translation and means to allow the correction of the translation operated by the computer and means to implement the dictionaries in the computer, and word process means in post-editing for the check and the final correction with eventual activation of automatic search and replace, characterized by: [0134] integrating the said post-editing in a single ensemble with the translation system, and [0135] identifying and memorize each correction that is carried out in post-editing, and in a single operation, [0136] activating the search and replace of the said mistake in the text in correction, and [0137] activating the memorization of the correction carried out to said translation system with integration of one or more program semantic codes, [0138] in order to obtain at the same moment and directly connected to the respective correction, not only the extension of same correction to the text in post-editing, but also the auto learning of the correction itself to said translation system. [0139] In this way one has the advantage of a continuous improvement of the quality of the translation and of a continuous reduction of the errors and consequent reduction of the total time for obtaining the text not only translated but also checked and perfectly finished. [0140] Advantageously the method provides on the inside a translation system that includes: [0141] at least one electronic dictionary with correct translation of sentence fragments, sentences and words, associated, for each translation, to a programming semantic code, that activates during the translation of a text or text portion, a respective adapting program of the translation in progress to the preceding text portion and/or to the following text portion in function of the specific features; [0142] means for the treatment of translation phrase by phrase of the text to translate with sequential analysis of the subsequent words and/or sentence fragments within the extent of treatment of the respective sentence, associated to comparing means of the said words or sentence fragments, to individuate materially or virtually also with declination or base or root, their presence into said electronic dictionary, to make possible a sequential translation; [0143] processing means of the translation on the base of the said dictionary and of the corresponding said program semantic codes: [0144] with eventual adapting of the current translation to the preceding text portion and to the text portion that follows the one in processing and, [0145] with eventual adapting in accordance of the current translation also of the part already translated; [0146] output means to memorize and show the operated translation; [0147] characterized by providing: [0148] a plurality of said program semantic codes, each associated to a respective translation software with different modality, said modality being known to the operator that operates the translation in order to allow the use of one or the other code or the combination of more codes to define a certain translation software for a specific text portion; [0149] memory means of the carried out corrections and, on request of the operator; [0150] activation means of an auto learning program which was previously corrected, [0151] determining the new teaching to operate, enclosing: [0152] the text portion that contains said correction, and the corresponding original text portion that had to be translated, and [0153] inputting one or more program semantic codes at this new teaching to be added in said electronic dictionary, in order that said teaching deriving from previous correction can be reutilized immediately in the following translation. [0154] In this way the system retrieves automatically not only the correction operated by the human operator as traditionally used, but on OK of the operator, also utilizes this correction remembering it as a new teaching avoiding the subsequent repetition of the translation mistakes made by the computer. [0155] In this way the translation system becomes substantially intelligent as is endowed with auto learning and the translation in this way will continuously improve, and more corrections and teachings will be done and better will be the result, reducing progressively the errors made and allowing a sensible reduction of time for the completion of the translation at a level of human quality; [0156] Advantageously the system further provides on the inside: [0157] activation means, on command, after the correction, of the following steps: [0158] individuate the last change made on the text comparing the original previous text and the modified text; [0159] propose in a dialog box the previous text and the modified text or the text to modify, if signaled; [0160] on acceptance, make an automatic search and replace in the entire text already translated. [0161] In this way the correction times reduce furthermore, with important productivity advantages. [0162] We carried out translation tests with post-editing after automatic translation with the new process on a Mac G3 Computer at 400 MHz for the same sample patent-disclosure of 10 pages: [0163] with the interactive traditional system: the translation time + the hand-operated post-editing time was of two hours; [0164] with the new system the time used resulted in half an hour; [0165] the increase in productivity resulted therefore in the 400%, as it is not only the number of the corrections that reduces, but also and above all the stop and consulting times for each correction. [0166] Advantageously the method provides on the inside the option of the fully automatic or semiautomatic translation. In this way it is possible to operate in accordance to the specific requirements, with the difference that with the automatic translation the signaled errors will be eliminated only in the next text to translate, while with the interactive or semiautomatic translation the errors are eliminated during the translation itself as they appear. [0167] The method includes the visualization on the screen of a first scrolling field to receive the text to translate and a second scrolling field to show the translation, one adjacent and parallel to the other, which proportion automatically in the respective width in a manner inversely proportional to the length of the two texts. In this way one has the immediate advantage to supply a fast and immediate confront line by line, of the original text in respect of translated text substantially at the same height, being further provided in parallel sliding means of both the fields. [0168] With such solution one has the advantage of a faster confront improving considerably the correction times. In fact the difficulty in the translators that must check the original text with the translation to follow step by step the original text and the translated text is known, and sometimes one loses therefore weary and precious minutes only to find where the original word corresponding to the one translated. [0169] In order to further speed-up and individuate the missing words not translated the system provides automatically the conversion of their writing in bold or italic or different color, facilitating and speeding up furthermore the system for the search and the individualization of the parallel correspondence between the two words/expressions in the parallel fields. [0170] More advantageously the method provides automatic unloading and charging means for the text to translate and for the translated text respectively, fragmenting it, in at least 5 couples of memory fields, each field providing substantially the contents of 30000 characters (about. 20 pages). In this way one has the advantage to supply the possibility to the operator to treat also large texts (e.g. up to 100 pages at a time), with the same quality and without danger to make errors in the reconstruction of the translated text. [0171] More advantageously one provides over the couple of the said translation main fields, at least a couple of accumulator fields, namely with accumulating function similarly placed in parallel and of same width of the said couple of main fields to be used: [0172] both for interactive translations with correction during translation, [0173] and for correction in post-editing after the automatic translation. [0174] In this way the accumulator system loses nothing because of break-off of the course of the translation always allowing to take up at any time without losing anything. Furthermore one always has the advantage of a perfect line-out of the remaining paragraphs still to correct, that progressively pass to the couple of the said accumulator fields. [0175] More advantageously under the said translation main fields, a couple of text fields remaining to translate is provided. [0176] In this way the program operates interactively transferring progressively a paragraph at a time, from the couple of interesting lower fields, in one or into the other, the text to translate, to said couple of the main fields to make the translation and the following correction, being before the translated and corrected text in said fields, moved to the said couple of said accumulator fields. [0177] In this way one has the additional advantage of a complete visualization both the translated text, and the text in progress of translation, paragraph by paragraph, therefore with best visualization for checking in parallel. [0178] Advantageously in a window in turn the number of the checked and translated paragraphs and the number of the paragraphs remaining to translate are indicated. In this way one has the advantage of always having under control the amount of time needed to complete the work. [0179] More advantageously the method provides for each correction carried out in the translated text, besides the integrated search replace and of autolearning options, the autoactivation of the differentiation of the characters of the corrected word/fragment and corresponding portion of the text to translate putting them in distinguishable characters by the rest of the text, as for example bold, italics or other color. [0180] In this way it is immediately signaled to the operator up to where the corrections have been made, facilitating and reducing therefore the time required to complete the work. In fact skilled persons know the time that one wastes if one forgets where he was and this particularly in the treatment of long texts, as for example the patents. [0181] Advantageously the method provides the addition for each teaching different possibilities of translation of the same text with separate corresponding program semantic codes. [0182] In this way, in function of the programmed option the system can choose the one or the other translation according to the context. [0183] More advantageously the method includes the possibility to impute different teaching depending on context, e.g. electric, electronic, chemical, mechanic, aeronautic, . . . , medical, sporting, clothing, legal, spoken or speech, etc., each able to be activated by a code previously assigned to or from the translation itself in relation to the type of translation. In this way for different subjects a translation correspondingly different is supplied (personalization). It is known in fact that for example the patents are classified according to an international coding for different technological sectors (IPC code). Each category of patents has a code, so imputing before the translation said code, if it regards a document that relates to electronics the system will translate in one manner or the other (e.g. chips=patatine for the alimentary (food) domain and chips=chips for the electronics etc.) [0184] More advantageously the method and respective system provide in the machine-aided translation the translation by the said charger, paragraph by paragraph, namely one paragraph at a time, allowing in turn the correction with autolearning (self-learning). [0185] In this way one has the great advantage of considerably better performing the quality of the translation and to speed-up furthermore the correction and translation time as, thanks to the first error corrections at the beginning of the translated text, the system learns automatically, and at once, memorizes this kind of text and utilizes these teachings immediately in the prosecution of the translation in the same text. [0186] Without autolearning the quality of the automatic translation always remains the same, so if an automatically translated patent has 60 corrections to be made in the first page and its length is of 10 pages, the total corrections to be made are approximately 60 errors/page×10 pages=600 corrections to correct, while with the autolearning already in first page the errors are reduced by half as the translation is carried out paragraph by paragraph, and in the following pages the errors continuously reduce the half of the half as the previous half has already been eliminated and cannot repeat, and so forth so far as to reach a physiological minimum that generally is not lower than 10%, so with the invention one has a total of errors to correct equal to (30 first page+15 second page+8 third page+6×7 remaining pages=95 corrections. [0187] Therefore a saving of 600−95=505 errors on 600, equal to theoretically over 80% less of corrections, to say one increases the productivity of 500% namely five times. [0188] As a matter of fact one must consider a greater time lost for the teaching that one can estimate not lower than 20% of the correction-time, maximum 30%, so one returns to what was experimented, namely to an increasing of productivity, if the time lost for the teaching is of 30%, of (600/95)×0,7=442%. As a matter of fact the advantage will be as much and as high as the number of the corrections to be made and so much higher is the number of the pages to translate. [0189] It is obvious instead that such advantage reduces considerably for automatic translations in which the number of corrections is much more limited, or if the translation is very short, e.g. some paragraphs. [0190] In such case the advantage that we can obtain is only to increase the performance in productive quality of the automatic translation of the system. [0191] To reduce at most the times and have optimal quality, there is provided means which make possible, after the automatic translation of the entire text and subsequently, the sequential post-editing with correction and checking from skilled man, by means of correction with autolearning and autoreplacing paragraph by paragraph, canceling progressively the couple of the checked paragraphs and transferring them in said couple of bunching fields. [0192] In this way one has the advantage of having as the previous one, the immediate parallel visualization of the paragraph to translate and what translated for the contribution of the corrections but with the additional advantage to be able to also see the whole text that follows both for the field to translate and for the translated. With this solution particularly the check and comprehension times from the operator if what has been translated and corrected are reduced, having a more wide view of the entire text, of what is in translation and of what is following during translation. [0193] In connection with the above one provides the confront of the following automatically translated paragraph with the corresponding paragraph on the screen, in order that if they do not correspond, for eventual operation of automatic search-replacing, one remake automatically the retranslation with the new teachings, reducing in such case furthermore the number of corrections that one must do. [0194] This solution, if it requires more time for the retranslation, of the paragraph concerned, provides a possibility to the operator to evaluate the correct learning and eventually readapt it with a new teaching that, according to the system, can be changed or customized for the specific case. [0195] More advantageously in the system a third confrontation field to associate to the first two is provided, in order to introduce the correct text of the translation from another outside operator and this in order to operate interactively by confrontation and when non correspondence is detected, activate the respective proposals of autolearning of the teachings deriving from the outside corrections. [0196] In this way one has the advantage to be able to use teachings also coming from the exterior of the system, for example by control carried out not in the same batch, but for example for the post-editing on other machines for example connected via internet. [0197] In conclusion with this method, not only the quality of the translation is sped-up and improved, but one provides the possibility to the operator to personalize and implement progressively during the translation itself or even later, not only the missing words or the usual and repetitive sentences as in the known systems of the prior art, but also sentence fragments, which thanks to the respective programming semantic code supplied by the operator himself, but also suggested by the program during the context analysis of the translation, of the prefixes, of the endings, etc:, can insert and automodify itself in adequate manner in the following translations and, in the same following of the translation in progress. [0198] Thanks to the well known repetition of countenances in the documents in translation, the system adapts automatically and rapidly to the new translation sector giving, after the first steps of translated text, a progressively best resulting translation level and absolutely incomparable in quality level with reference to any currently known translation system. [0199] The tests carried out have supplied amazing results that even after a small amount of translation the errors made for sentence drop to a minimum, reaching almost immediately the errors average value for sentence between 1 and 2, to then reach the errors value for sentence>1. [0200] Preferred variations advantageously in the system is comprised: [0201] *) a checking window of the autolearning with three lines for checking, correction and input: [0202] one as fragment of phrase of the text to translate; [0203] one as fragment of phrase translated in a correct way, object of the correction in progress or already carried out; [0204] one as programming semantic code. [0205] **) the in-line consulting of dictionary with alternative translations. [0206] ***). during the correction in post-editing: [0207] determining the position of the cursor in the correction area or otherwise if memorized a portion by evidencing, calculating automatically the number of the paragraphs and corresponding sentences and words number of the translation, from the origin and, [0208] * on the base of the correspondence of the punctuation positions, supply in a window on the screen: [0209] * the sentence portion previously evidenced in the interested correction area individuated by the presence of the cursor from the last correction or previously evidenced, and [0210] * the sentence corresponding portion of the document to translate, [0211] * in order to allow to the operator to: delimit evidencing the fragment of phrase corresponding to that interested by the correction. [0212] This automizing and speeding up the search and the input of the autolearning [0213] ****). Over the said couple of fields a control-bar for control operations forming substantially a “T” base interface in which the upper cap of the “T” is the control-bar by means of the association of push-buttons and fields and the shank of the “T” divides substantially the right-hand field/s by the left-hand field/s of the said couple of main fields regarding the document to translate in progress and its translation, is further provided. [0214] In this way all is reunited and integrated in a maximum control and working performance. [0215] Description of at least one form of realization of the invention [0216] These and other advantages will appear from the following description of concrete solutions wherein: [0217] FIGS. from 1 to 18 represent the visualization of the window interface of the translation system with two columns, therefore realized according to the method as in the present invention in different processing steps respectively from (A) to (R), with the visualization of the only two proportionally parallel correction and translation main fields. [0218] [0218]FIG. 19 shows the electronic dictionary to accumulate the autolearnings. [0219] [0219]FIG. 20 (Rif.T), represents a view in which appears on the screen the shape, always respecting the two columns, but with two couples of scrolling proportioned fields, namely with four scrolling fields, respectively the said couple of the translation and correction main fields and above this the couple of accumulator fields of what translated, checked and corrected, in order to avoid waiting time of the previous line by line translation system, allowing the translator, in this waiting time, to read the previous translation during retranslation. [0220] [0220]FIG. 21 (Ref. U), represents a view of the system in which appears on the screen the shape always with two columns but with three couples of scrolling proportioned fields, namely six fields respectively the said couple of the translation and correction main fields and above this the couple of accumulator fields of what was translated, checked and corrected, and under the couple of the said main fields the said couple of fields including in one or into the other the remaining text to translate. [0221] [0221]FIG. 22 (Ref. V), represents what appears on the screen when one asks the representation option of the confrontation with a translated and corrected text outside the system, namely with three columns instead with two, where the third column is that of the outside translated and corrected text, utilized for the confrontation with the couple of main columns as in previous figures. [0222] [0222]FIG. 23 (Ref. Z), represents a four-fields view during a correction in post-editing with automatic passing of the text corrected by the couple of translation and correction main fields (F1, B/U) to the accumulation upper couple (A1 Ref. U FIG. 21).
[0223] As disclosed in the FIGS. from 1 to 18, and particularly from FIG. 2, the system includes substantially at least two columns, comprising at least two scrolling parallel main fields, one adjacent to the other (F1, B/U) one for the text to translate and one for the translated text to correct. [0224] In head under the line of the controls there are to the right and to the left of the charging fields (C1, C2, C3, C4, C5) to charge with the import control button the text to translate up to 100 pages (20 pages per field) in order to translate automatically or semi automatically as from the option (A) of FIG. 1. [0225] The text in progress of translation passes from chargers (C1, C2, C3, C4, C5), to the couple of the translation main fields. (F1, B/U). Once the translation and correction has been completed, the couple of the texts passes to the couple of accumulator fields (A1), that can shift: from small under the control-bar (adjacent to said chargers), to proportioned over the same couple of translation main fields (A1, F1, Ref. U FIG. 21). [0226] One can also charge a text directly in a main field of the main couple of the translation fields (F1, B/U) and obtain the translation into the opposite main field of the said main couple (F1). [0227] Analogously any combination of charger fields can happen (C1, C2, C3, C4, C5) toward the main fields (F1, B/U) and then pass to opposite side of the main fields couple in logical sequence and flow finally in the opposite charging fields. [0228] As for example if one has to translate from Italian one will activate the direction from right button towards the left button as in the FIGS. from 1 to 18, see indication evidenced by the top right arrow button in the control line (From English to Italian is the contrary). [0229] Once the work is completed one can use the Export control button (“Exp”=Export). [0230] The system is divided by modules, each including a couple of languages, therefore in the representation is shown a single one of the operative modules that concerns in a reversible way the translation from English to Italian or vice versa. [0231] Also the dictionary (S FIG. 19) is double, one for the Italian towards English and one for English towards Italian (the disclosed is for the translation from English towards Italian). [0232] Both have a series of fields: [0233] for searching the single words during translation (1), [0234] for the text portion that follows the word under consideration (up with five words for a total of six), (2); [0235] for the base standard translation (3); [0236] for the program semantic code/s (4) and [0237] for alternative translations personalized with operative sectorial codes, (for example electronics, physical, chemistry, etc.) (5). [0238] We can give also two codes and two different translations to each teaching as for example able to be read in field (S column 3) Eg. “cart”=“trasportare, carro” with the attributed codes “verbinfcon” and “soms”, to say that the first word is an infinitive verb that one must conjugate in conformity with the context of the sentence and in particular with what precedes it, while alternatively one must translate as singular male noun and adapt obviously possible articles, pronouns etc front in the part already translated in conformity, move behind possible adjectives arranging them, etc. [0239] These codes are supplied by the operator during the autolearning, and they are determinant and indispensable for having an excellent quality of the result. [0240] As for example “ag4” means adjective with 4 declensions, “ag2” adjective with two declensions, “ag1” invariable adjective. [0241] Similarly the code-prefix “verb” indicates that we have a verb, the prosecution with “con” means that the verb has to be conjugate, the prosecution with “inf” means that the current verb is an infinitive verb, the intermediate fragment “ing” means that the current verb is a gerund, the intermediate fragment “pass” means that the current verb is a past verb, etc. [0242] E.g. if the code that writes the operator, in the autolearning during post-editing, is “verbls/p2432”, it means that the system must adopt the adapting program of the verbs in which Ref.“″1s/p” give an order to the program to adapt the first word to context of the sentence in the sense of the singular/plural conjugation, the following number “24” give the order to the program about the second word informing it that is a past participle and obliges the program to accord it in conformity to four solutions (E.g. a, e, i, o, for Italian language), while the third word “32” gives the order to accord only in two solutions: plural and singular. [0243] These codes are a lot and the operator can arrange them in different way, as an object programming language, but in which the sequence modules of the program are already inserted and therefore the operator knows the result that he is going to obtain, not needing to be a programmer. [0244] Naturally above there is a control-bar that allows the operator to operate changes at will, on all the fields that are obviously in a parallel scrolling form for exact alignment correspondence. [0245] Coming back to the main translation interface (FIG. 2), it has been claimed that the fields of each couple (F1, B/U) self-adjust in the width inversely proportional to length of the texts of the couple, in order to always supply the same number of lines (scrolling height pitch) to facilitate confrontation and reduce the correction check times in post-editing. [0246] The couple of accumulators (A1, Ref.U FIG. 21) have instead the intermediate function to accumulate the sentences in turn that are translated and corrected. [0247] The control bar of the main interface, also has a lot of figurative control buttons, as for example parallel field-couples scrolling controls, their alignment, the interface changing in size, the search and replace control “RS”, capital to small letter change, the transfer control between fields and a Data File, the copy pastage controls, the word counting, the lock/unlocking, the spelling, the “cut-returns” for the arrangement of texts from “DOS” system having one return per line, that causes illogical analysis of the sentence, and the different controls of what to carry out the translation, as: [0248] “START” for starting or to take up a translation from the position in which one was remained before; [0249] “LineByLine” to proceed paragraph by paragraph; [0250] “TQ” for the interactive translation system in Total Quality, where each fragment between punctuation is submitted before registering it in the opposite field during control and check of translator for the correction and autolearning; [0251] “MemLine” (Checking Action Mode) that allows after an automatic translation the transfer into the couple of accumulator fields (A1), line-by-line (namely paragraph by paragraph) the checked and corrected paragraphs from main fields couples (F1) to accumulator field couple (A1); [0252] “Trans1Lm” that activates the automatic retranslation of the selected paragraph; [0253] The visualization controls of two or four or six fields “2/4” and “2/6”. [0254] Unwinding of the method in interactive translation paragraph by paragraph (example from Italian English of this invention with activation of the right upwards arrow and without visualization of the options 4 and 6 fields, namely in the less reduced shape with visualization of only two main fields of translation and correction. [0255] [0255]FIG. 1 text to translate is loaded (C1 see FIG. 2), if it is longer then 20 pages, it is divided occupying the adjacent fields (C2, C2, . . . etc.), the “START” button is pressed and a window appears (A) that indicates the mode that one wants to operate, namely interactively “TOTAL QUALITY” or paragraph by paragraph “LineByLine” or in automatic way “Automatic”, in the last case “LineByLine” button is pressed and the translation starts developing paragraph by paragraph coming from the field of the right chargers (C1) and outputting paragraph by paragraph in the main fields (F1, B/U) in a fully automatic way, these steps develop instantaneously, given the speed of the current processors, therefore the operator has not practically waiting times, [0256] [0256]FIG. 2 each paragraph (paragraph is intended as a line, in “word Process”, namely from return to return) is shown for the correction of the operator indicating in bold the missing words (“semantics”) and in italics in the opposite side (the same not translated word “semantics”), in this way the operator has the possibility to see immediately the missing word Ref. (B); [0257] [0257]FIG. 3 the operator directly corrects the single word, and the system will autolearn it, or can signal the whole sentence fragment defining univocally in a correct way the translation (C), in such case, [0258] [0258]FIG. 4, the system immediately opens a window and asks if one wants the automatic change (D); [0259] [0259]FIG. 5, completed the search-replacing (RS), the system asks if one wants the autolearning proposing the programming semantic code, that can be modified by the operator the same for the teaching, and with “OK”, the system completes the autolearning (E) and [0260] [0260]FIG. 6, underlines what corrected from both sides (F), [0261] [0261]FIG. 7, continuing to push the button “LineByLine” the translation develops in the same way until the end, [0262] [0262]FIG. 8, finding translation errors we always can correct and teach them to the system in a similar way (H); [0263] [0263]FIG. 9, if the system is unable to trace in an identical way the exact corresponding text portion to the correction, it asks the operator in window to evidence the corresponding portion (I); [0264] [0264]FIG. 10, and then asks the authorization to the autolearning (J); [0265] [0265]FIGS. 11, 12, 13, the system asks also the authorization to change what was corrected for the whole translation (K, L, M); [0266] [0266]FIG. 13, once the corrections have been terminated one continues in this way until the end of the text. Carrying out the method with automatic pre-translation the method provides first the automatic translation option in the window (A), then [0267] [0267]FIG. 13, it provides the entire automatic translation of the text in the main fields (F1, B/U) for the correction (M); [0268] [0268]FIGS. 14, 15, 16, 17, the operator checks and corrects paragraph by paragraph as in the previous solution, with the sole difference that behind it one has always the possibility to see the whole text to check on both fields.(N, O, P), proceeding till end. [0269] Preferred alternative representation of the user interface [0270] The representation (interface), as said may be: [0271] with sole two fields (restricted and small screen) or [0272] four-fields (FIG. 20) where above the main couple (F1, B/U) the accumulating field couple of what translate and checked (A1) is applied, or [0273] with six fields (FIG. 21), in which over to the four of the previous solution, a further couple of fields containing on one or on the other the remaining text portion to translate (L1 Ref.U FIG. 21). [0274] The six field solution being obviously the best for a more complete visualization of the translation and correction in progress and of the remaining portion to translate. [0275] Coding examples of behavior or semantics of the teachings [0276] Basic possible codes are innumerable as already explained, for example in the field of nouns “soms”, “somp”, .“sofs”, “sofp” is provided, that are the masculine and feminine combined with the singular and plural, and additionally able to be combined with e.g, “somsn” word group as a substantive (noun) that does not shift (because it is not associable with adjectives), “sofpnn” as previously but already containing the article, “somsNP” as proper noun, etc. or “ax2”, “ax4” for words and sentences in which one requires an adapting of the endings to that which will be subsequently translated (e.g. in accordance to a next substantive), or “ag1”, “ag2”, “ag4” to be accorded and moved to the substantive, or “nexinf” to oblige the following choice in translation to infinitive or “nexverb” to oblige the choice of the next translation to qualify as a verb, or “nexfut” to condition the next to past tense, etc. as an encoded language that in turn transmits the activations of the program similarly to the human intelligence and to the human structure as noticeable for example in a Dna, but electronic, where its manipulation is directly allowed by the operator who manages the translation. [0277] In this way it has been shown to reach very high levels of translation because the more the computer works the more it improves becoming ever more intelligent, but on the condition that the operators who uses it, correct it and teach it how it must behave from that moment on, exactly as one does with a child. [0278] Advantageously the operative sectorial codes as said are classified according to the international patent classification or in any event for sectors, able to be customized (A—e.g. “Electronics 10-H03” where 10 is the assigned code, H03 corresponds to the code of the international patent classification 1 pc). [0279] Subdivision of the sectors (the following shows a form of subdivision for sectors that the operator selecting, automatically activates before translation): [0280] 1 B62 Vehicles, Veicoli, Véhicules, Fahrzeuge, Vehiculos [0281] 2 B61 Railways, Ferroviario, Chemin de fer, Eisenbahn, Ferrocarril [0282] 3 B63 Marine, Hydraulics, Marina, Marine, Eaux, Hydraulik, Wasserwirtschaft [0283] 4 B64 Aérospace, Aerospatiale, Luftfahrt/Raumfahrt, Aerospacial [0284] 5 A/B/F/G Technology, Tecnologia, Technique, Technik [0285] 6 C21/C30 Metallurgy, Metallurgia, Metallurgie, Metalurgia [0286] 7 E21 Mining, Minerario, Minieres, Bergbau, Mineras [0287] 8 E01/E06 Building, Edilizia, Construction, Bauwesen, Construcción [0288] 9 H01/H02 Electricity, Elettricita, Electricité, Elektrik, Electricidad [0289] 10 H03 Electronics, Elettronica, Electronique, Elektronik, Electrónica [0290] 11 H03 Informatics, Computer, Informatica, Informatique, EDV [0291] 12 H04 Telecommunications, Mail, Telecomunicazioni, Telekommunikation, Telecomunicaciónes [0292] 13 H02/D07 Textile, Clothing/Wearing, Tessile-Abbligliamento, Textilien, [0293] 14 G03 Film/Camera, Fotocinematografia, Cinéphotographie, Kino/Foto [0294] 15 A63 Sport/Amusement Sport/Divertimento, Sport/Jeux,Sport und Spiel, Deporte y juegos [0295] 16 C00/C14 Chemistry, Chimica, Chimie, Chemie, Quimica [0296] 17 A01 Agriculture Vegetal, Agricoltura-Vegetali, Agriculture/Plantes, Landwirtschaft-Pflanzen [0297] 18 D21-B30/B44 Editing/Paper, Editoria/Carta, Editions/Papier, Verlagswesen/Papierindustrie, Edicion/Papel [0298] 19 F41/F42 Military/Guns/Explosives, Militare/Armi/Esplosivi, Militaire/Armes/Explosifs, Militär, Militar/Armamientos/Explosivos [0299] 20 G12/21 Nuclear/Physics/Atomics, Nucleare, Nucléaire, Kernkraft/Physic [0300] 21 G10 Music/Arts, Musica/Arti, Musique/Arts, Musik/Kunst, Música/Artes [0301] 22 Legal/Law, Legale/Legge/Diritto, Droit, Recht, Derecho [0302] 23 G06 Accounting/Mathematics, Contabilitá/Matematica, Comptabilité/Mathematique, Buchhaltung/Mathematik, Contabilidad/Matemática [0303] 24 Business/Correspondence/Mailing, Commerciale/Affari/Epistolare, Commerce/Correspondance, Handel/Briefe, Comercio/Correo [0304] 25 A61/63 Man, Corpo/Uomo, Homme, Mensch/Allgemein, Hombre/Cuerpo [0305] 26 A61/63 Food, Alimentazione, Alimentation, Essen, Alimentatión [0306] 27 A61 Medicine/Health/Pharmaceutics/Drugs, Medicina/Farmaceutica, Médecine, Medizin [0307] 28 Religion, Religione [0308] 29 Insurance, Assicurazione, Assurances, Versicherungen, Seguros [0309] 30 Banking/Financial, Bancario/Finaziario, Bancaire, Mobel [0310] 31 A01-A61 Animals, Animali, Animaux, Tiere, Animales [0311] 32 C07/14 Biology/Genetics, Biologia, Biologie [0312] 33 Geography/Tourism, Geografia/Turismo, Geographie/Tourisme [0313] 34 Linguistics, Sprachwissenschaft [0314] 35 Literature [0315] 36 Politics [0316] 37 Colloquial, Umgangssprache [0317] 38 A24 Tobacco, Tabac, Tabakwaren [0318] 39 Dialog, Dialogo, Diaqlogue [0319] 39 Personal, Personale, Persönlich [0320] The method is applied to a computer comprising an automatic translation system having on a monitor, a “T”-shape translation interface wherein the upper bar of the “T” is a line of control-buttons and the vertical bar of the “T” is a dividing line forming two columns inversely proportioned in width to the length of the respective contained text (column having longer text is wider than parallel column that contains a shorter text), where the two columns are divisible horizontally in pairs of parallel-scrolling fields, involving at least a couple of main translation fields (F1, B-U) and above it a couple of accumulator fields (accumulating fields) of what has been translated and checked (A1,U). [0321] Being able to show an additional couple of scrolling fields below the main translation fields (F1, B/U) and with same proportion of the above, to include in one or the other the text portion to translate (L1, U). [0322] Advantageously after transfer the checked top paragraphs text-couple from the said main couple of fields (F1-Z) to the bottom of said accumulating-fields couple (A1), said automatic retranslation is operated on the first top paragraph of the said main couple of fields (F1-Z) of the remaining text to check, in order that in the respective retranslation, waiting time, the operator is allowed to read the previous translation and prepare oneself for amendments after issue of said retranslation in the first paragraph. [0323] In this way the Operator does not lose time in waiting for retranslation, because he uses the waiting time to read the top-paragraph to check. [0324] When retranslation has been made (instantly) first translated paragraph is exchanged with the new first paragraph coming from said better performed retranslation (because said autolearning), and finally allowing instantly to amend the retranslated top-paragraphs, in the usual autolearning way, before continuing in transfer from said couple of main fields (FI-Z) to said accumulating couple of fields (A1-Z). Obviously, the operator is not allowed to make amendments, during retranslation. [0325] Before checking paragraph by paragraph, said retranslation is made only if the interested paragraph to check contains text portions already subjected to previous amendments and autolearning, made between the full automatic first translation and the moment to check. [0326] In this way retranslation is avoided if the interested top paragraph does not contain text portions involved in previous autolearning subject matter. So retranslation is automatically operated only if necessary. [0327] This solution allows further reduction in waiting time. Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS4439836 *Oct 22, 1980Mar 27, 1984Sharp Kabushiki KaishaElectronic translatorUS4599612 *Dec 6, 1982Jul 8, 1986Hitachi, Ltd.Displaying and correcting method for machine translation systemUS4604698 *Dec 22, 1983Aug 5, 1986Sharp Kabushiki KaishaElectronic translatorUS4633435 *Jul 22, 1985Dec 30, 1986Sharp Kabushiki KaishaElectronic language translator capable of modifying definite articles or prepositions to correspond to modified related wordsUS4831529 *Feb 12, 1987May 16, 1989Kabushiki Kaisha ToshibaMachine translation systemUS5020021 *Jan 10, 1986May 28, 1991Hitachi, Ltd.System for automatic language translation using several dictionary storage areas and a noun tableUS5093788 *Jun 25, 1987Mar 3, 1992Sharp Kabushiki KaishaTranslation machine system with splitting and combining of sentencesUS5175684 *Dec 31, 1990Dec 29, 1992Trans-Link International Corp.Automatic text translation and routing systemUS5257187 *Sep 30, 1991Oct 26, 1993Sharp Kabushiki KaishaTranslation machine systemUS5303151 *Feb 26, 1993Apr 12, 1994Microsoft CorporationMethod and system for translating documents using translation handlesUS5338976 *Jun 16, 1992Aug 16, 1994Ricoh Company, Ltd.Interactive language conversion systemUS5349368 *Dec 2, 1991Sep 20, 1994Kabushiki Kaisha ToshibaMachine translation method and apparatusUS5384701 *Jun 7, 1991Jan 24, 1995British Telecommunications Public Limited CompanyLanguage translation systemUS5426583 *Jan 27, 1994Jun 20, 1995Uribe-Echebarria Diaz De Mendibil; GregorioAutomatic interlingual translation systemUS5510981 *Oct 28, 1993Apr 23, 1996International Business Machines CorporationLanguage translation apparatus and method using context-based translation modelsUS5659765 *Mar 14, 1995Aug 19, 1997Toppan Printing Co., Ltd.Machine translation systemUS6047252 *Jun 30, 1997Apr 4, 2000Kabushiki Kaisha ToshibaMachine translation method and source/target text display methodUS6598015 *Sep 10, 1999Jul 22, 2003Rws Group, LlcContext based computer-assisted language translation* Cited by examinerReferenced byCiting PatentFiling datePublication dateApplicantTitleUS6993473 *Aug 31, 2001Jan 31, 2006Equality Translation ServicesProductivity tool for language translatorsUS7475390 *Jan 12, 2004Jan 6, 2009International Business Machines CorporationSystem and method for automatic natural language translation during information transferUS7529656 *Dec 19, 2002May 5, 2009International Business Machines CorporationTranslating method, translated sentence outputting method, recording medium, program, and computer deviceUS7730063Mar 31, 2005Jun 1, 2010Asset Trust, Inc.Personalized medicine serviceUS7746363 *Dec 15, 2005Jun 29, 2010Siemens AktiengesellschaftEntry of data in a data processing systemUS8005662 *Mar 25, 2009Aug 23, 2011International Business Machines CorporationTranslation method, translation output method and storage medium, program, and computer used therewithUS8031943Aug 15, 2008Oct 4, 2011International Business Machines CorporationAutomatic natural language translation of embedded text regions in images during information transferUS8086999Oct 3, 2008Dec 27, 2011International Business Machines CorporationAutomatic natural language translation during information transferUS8091022Nov 29, 2007Jan 3, 2012International Business Machines CorporationOnline learning monitorUS8122424Oct 3, 2008Feb 21, 2012International Business Machines CorporationAutomatic natural language translation during information transferUS8161401Oct 15, 2008Apr 17, 2012International Business Machines CorporationIntermediate viewer for transferring information elements via a transfer buffer to a plurality of sets of destinationsUS8214198 *Dec 15, 2009Jul 3, 2012Fujitsu LimitedTranslation supporting program, apparatus, and methodUS8276090Dec 20, 2007Sep 25, 2012Google Inc.Automatic reference note generatorUS8442811 *Sep 30, 2011May 14, 2013Google Inc.Contextual translation of digital contentUS8527259 *Feb 28, 2011Sep 3, 2013Google Inc.Contextual translation of digital contentUS8635539 *Oct 31, 2008Jan 21, 2014Microsoft CorporationWeb-based language translation memory compilation and applicationUS8689125Oct 23, 2003Apr 1, 2014Google Inc.System and method for automatic information compatibility detection and pasting interventionUS8805671 *Aug 21, 2013Aug 12, 2014Google Inc.Contextual translation of digital contentUS8825466Jun 8, 2007Sep 2, 2014Language Weaver, Inc.Modification of annotated bilingual segment pairs in syntax-based machine translationUS8831928Apr 4, 2007Sep 9, 2014Language Weaver, Inc.Customizable machine translation serviceUS8886515 *Oct 19, 2011Nov 11, 2014Language Weaver, Inc.Systems and methods for enhancing machine translation post edit review processesUS8903707 *Jan 12, 2012Dec 2, 2014International Business Machines CorporationPredicting pronouns of dropped pronoun style languages for natural language translationUS8942973Mar 9, 2012Jan 27, 2015Language Weaver, Inc.Content page URL translationUS8990064Jul 28, 2009Mar 24, 2015Language Weaver, Inc.Translating documents based on contentUS9122674Dec 15, 2006Sep 1, 2015Language Weaver, Inc.Use of annotations in statistical machine translationUS9128929 *Jan 14, 2011Sep 8, 2015Sdl Language TechnologiesSystems and methods for automatically estimating a translation time including preparation time in addition to the translation itselfUS9152622Nov 26, 2012Oct 6, 2015Language Weaver, Inc.Personalized machine translation via online adaptationUS9213694Oct 10, 2013Dec 15, 2015Language Weaver, Inc.Efficient online domain adaptationUS9262403Jan 14, 2011Feb 16, 2016Sdl PlcDynamic generation of auto-suggest dictionary for natural language translationUS9342506Oct 20, 2014May 17, 2016Sdl Inc.In-context exact (ICE) matchingUS9400786Jul 25, 2013Jul 26, 2016Sdl PlcComputer-implemented method, computer software and apparatus for use in a translation systemUS9514108Aug 10, 2012Dec 6, 2016Google Inc.Automatic reference note generatorUS9600472Mar 18, 2011Mar 21, 2017Sdl Inc.E-services translation utilizing machine translation and translation memoryUS20030046062 *Aug 31, 2001Mar 6, 2003Cartus John R.Productivity tool for language translatorsUS20040128614 *Dec 30, 2002Jul 1, 2004International Business Machines CorporationReal time internationalization of web pages with embedded server-side codeUS20050091603 *Oct 23, 2003Apr 28, 2005International Business Machines CorporationSystem and method for automatic information compatibility detection and pasting interventionUS20050155017 *Jan 12, 2004Jul 14, 2005International Business Machines CorporationSystem and method for automatic natural language translation during information transferUS20050246314 *Mar 31, 2005Nov 3, 2005Eder Jeffrey SPersonalized medicine serviceUS20060059028 *Oct 28, 2005Mar 16, 2006Eder Jeffrey SContext search systemUS20060101017 *Nov 7, 2005May 11, 2006Eder Jeffrey SSearch ranking systemUS20060136277 *Dec 16, 2004Jun 22, 2006Perry Benetta NAutomatic generation of a globalization project scheduleUS20060136841 *Dec 15, 2005Jun 22, 2006Siemens AktiengesellschaftEntry of data in a data processing systemUS20060167675 *Dec 19, 2002Jul 27, 2006International Business Machines CorporationTranslatinG method, translated sentence outputting method, recording medium, program, and computer deviceUS20060195313 *Feb 25, 2005Aug 31, 2006Microsoft CorporationMethod and system for selecting and conjugating a verbUS20060277332 *Dec 18, 2003Dec 7, 2006Yukihisa YamashinaTranslation support system and program thereofUS20070011049 *Feb 21, 2006Jan 11, 2007Eder Jeffrey SIntelligent, personalized commerce chainUS20070011160 *Dec 21, 2005Jan 11, 2007Denis FerlandLiteracy automation softwareUS20070122792 *Nov 9, 2005May 31, 2007Michel GalleyLanguage capability assessment and training apparatus and techniquesUS20080027769 *Sep 9, 2002Jan 31, 2008Jeff Scott EderKnowledge based performance management systemUS20080072144 *Nov 29, 2007Mar 20, 2008Yen-Fu ChenOnline Learning MonitorUS20080098317 *Dec 20, 2007Apr 24, 2008Yen-Fu ChenAutomatic Reference Note GeneratorUS20080249760 *Apr 4, 2007Oct 9, 2008Language Weaver, Inc.Customizable machine translation serviceUS20080262827 *Oct 18, 2007Oct 23, 2008Telestic LlcReal-Time Translation Of Text, Voice And IdeogramsUS20080300859 *Aug 15, 2008Dec 4, 2008Yen-Fu ChenSystem and Method for Automatic Natural Language Translation of Embedded Text Regions in Images During Information TransferUS20080301564 *May 31, 2007Dec 4, 2008Smith Michael HBuild of material production systemUS20090030672 *Oct 3, 2008Jan 29, 2009Viktors BerstisAutomatic Natural Language Translation During Information TransferUS20090031238 *Oct 3, 2008Jan 29, 2009Viktors BerstisAutomatic Natural Language Translation During Information TransferUS20090044140 *Oct 15, 2008Feb 12, 2009Yen-Fu ChenIntermediate Viewer for Transferring Information Elements via a Transfer Buffer to a Plurality of Sets of DestinationsUS20090254334 *Mar 25, 2009Oct 8, 2009International Business Machines CorporationTranslation method, translation output method and storage medium, program, and computer used therewithUS20090271342 *Jul 4, 2009Oct 29, 2009Jeffrey Scott EderPersonalized medicine systemUS20090313041 *Aug 23, 2009Dec 17, 2009Jeffrey Scott EderPersonalized modeling systemUS20100094617 *Dec 15, 2009Apr 15, 2010Fujitsu LimitedTranslation supporting program, apparatus, and methodUS20100107114 *Oct 28, 2008Apr 29, 2010Zachcial SlawomirIn context web page localizationUS20100115424 *Oct 31, 2008May 6, 2010Microsoft CorporationWeb-based language translation memory compilation and applicationUS20120150529 *Dec 9, 2011Jun 14, 2012Electronics And Telecommunication Research InstituteMethod and apparatus for generating translation knowledge serverUS20120185235 *Jan 14, 2011Jul 19, 2012Thomas Fritz AlbatSystems and Methods for Automatically Estimating a Translation TimeUS20130103381 *Oct 19, 2011Apr 25, 2013Gert Van AsscheSystems and methods for enhancing machine translation post edit review processesUS20130185049 *Jan 12, 2012Jul 18, 2013International Business Machines CorporationPredicting Pronouns for Pro-Drop Style Languages for Natural Language TranslationUS20150331855 *Dec 19, 2012Nov 19, 2015Abbyy Infopoisk LlcTranslation and dictionary selection by contextUS20170083504 *Sep 22, 2015Mar 23, 2017Facebook, Inc.Universal translation* Cited by examinerClassifications U.S. Classification704/2International ClassificationG06F17/28Cooperative ClassificationG06F17/2836European ClassificationG06F17/28D6Legal EventsDateCodeEventDescriptionFeb 12, 2013FPAYFee paymentYear of fee payment: 4Jan 9, 2017FPAYFee paymentYear of fee payment: 8RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services

value: This website is a search engine provided by Google. Handling over 3.5 billion searches per day, it has a 92% share of the global search engine market.


text:
Sign Guest Book Elizabeth A. Pittsman, 68, of Carbondale, died Saturday afternoon at the Creekside Health & Rehabilitation Center, Carbondale. She was the wife of James Pittsman Jr., who died in 2002. Born Sept. 2, 1945, in Orange, N.J., daughter of the late...
Sign Guest Book Joseph P. Pascoe, 77, Carbondale, died Wednesday afternoon at the VNA Hospice Unit, Scranton, after a brief illness. Born Feb. 16, 1937, in Carbondale, son of the late Santo A. Pascoe, former Lackawanna County Sheriff, and the late Rose Cerra...

type: global

value: This website is a United States-based website founded in 1998, the world's largest commercial provider of online memorials. The Web site hosts obituaries and memorials for more than 70 percent of all U.S. deaths.


text:
‘Uncanny Valley’ Charts a Tech Pilgrim’s Progress - The New York Times
Books|‘Uncanny Valley’ Charts a Tech Pilgrim’s Progress
https://nyti.ms/2ZDZvA6
Even at the end of a decade marked by surveillance capitalism and Russian trolls — a period of time when techno-utopianism curdled into disillusion — Silicon Valley has shown itself more than capable of delivering on one of its core promises: a frictionless convenience, at least for those who can afford it.
The journey from feeling to wanting to procuring used to take deliberation and time; now the experience has been squeezed into a seamless moment of scrolling and clicking, without any obligation to interact directly with another human being. Two decades ago, the novelist and former software engineer Ellen Ullman anticipated that the internet would bring about the “suburbanization of existence” — a libertarian idyll or libertarian hellscape, depending on how you might fare in an increasingly private and privatized world.
In her extraordinary new book, “Uncanny Valley,” Anna Wiener recounts what made her, a 25-year-old woman with an “affectedly analog” life in New York City, abandon her job at a literary agency in 2013 to work for tech start-ups, and what eventually — five years later — made her leave the industry. Money was certainly part of her original decision, but not all. At the literary agency, she was subject to the low pay and genteel exploitation of a shrinking industry; even more alluring than the offer of a better salary was tech’s “optimism and sense of possibility,” how it “promised what so few industries or institutions could, at the time: a future.”
It was this promise that initially sustained her. She worked for a few months at an e-reading app that seemed safely connected to her literary interests, though she noticed that the CEO misspelled Hemingway in his pitch to investors (adding a superfluous “m”) and accidentally typed a private message into a companywide chat room complaining that Wiener was “too interested in learning, not doing.” She moved to the Bay Area, joining an analytics start-up and later an open-source platform.
[ “Uncanny Valley” is one of our most anticipated titles of 2020. See the list of 20 books our editors are watching for this year. ]
The language she was supposed to learn in her new milieu suggested that something was amiss. Wiener registered the unselfconscious deployment of hideous portmanteaus like “designpreneurs” and “blitzscaling.” The lexicon included an inordinate number of athletic and wartime metaphors, reflecting what Wiener calls “tech’s dark triad: capital, power and a bland, overcorrected, heterosexual masculinity.” People were expected to “co-execute,” and to do something called “upleveling.” Interviewing for her nontechnical job at the analytics start-up, she was asked the kind of inane question that’s supposed to assess cultural fit as much as puzzle-solving ability: “How would you describe the internet to a medieval farmer?”
Anna Wiener, author of the memoir “Uncanny Valley.”Credit...Russell Perkins
Wiener was skeptical of all the chipper sloganeering she encountered, though she depicts herself as someone who didn’t relish the prickling sense of alienation and tried hard to fit in. She started taking B vitamins to boost her energy levels, and nootropics to boost her cognitive function. She listened to the unrelenting rhythms of EDM, “the music of the 24-hour hustle, the music of proudly selling out.” She grew accustomed to eating upscale fast casual, and purchased a pair of wool sneakers that she saw everyone else wearing in line at the food truck and in her social media feeds; the sneakers looked like “a child’s drawing of a shoe,” a renunciation of sensuality for comfort.
“Silicon Valley might have promoted a style of individualism,” she writes, “but scale bred homogeneity.” It’s exhausting to feel perpetually estranged, and Wiener felt herself slipping “into a smug sense of belonging.” She was entrusted by the CEO of the analytics firm to screen job applicants for her team, and the questions she asked indicated that her acculturation was complete: “How would you describe the internet to a medieval farmer?”
Wiener’s storytelling mode is keen and dry, her sentences spare — perfectly suited to let a steady thrum of dread emerge. Few people get names in “Uncanny Valley,” and none of the companies do. Early on in the book, she refers to “an online superstore” and “a social network everyone said they hated,” later swapping out the indefinite articles for definite ones, effectively showing how the internet behemoths have eliminated their competition.
As a woman, Wiener felt both conspicuous and invisible, valued for her contribution to “diversity metrics” while her “soft skills” were simultaneously exploited and derided. “I was always trying to be everyone’s girlfriend, sister, mother,” she writes. A male supervisor criticized her “for being a pleaser.” Not everyone, though, was expected to change. When Wiener later informed the same supervisor about a colleague’s sexual comments, he seemed embarrassed but ultimately dismissive. “You know him,” the supervisor said. “That’s just who he is.”
Wiener continued to cling to the belief that the casual misogyny she encountered masked “a yearning at the heart of entrepreneurial ambition, a tender dimension that no one wanted to acknowledge.” Surely the extravagant displays of arrogance were rooted in a profound sense of vulnerability — that what these young men ultimately wanted was something she could understand and relate to: “community or intimacy, to simply be loved and understood.”
Only later does she realize that her empathetic impulses may have led her astray. She was so fixated on trying to discern what motivated people that she lost sight of the vast, exceedingly powerful system she was participating in, and what the system was doing — not just to her, but to everybody. She was working at the data analytics start-up when Edward Snowden (referred to in the book only as “the whistle-blower”) released the trove of classified documents about government surveillance; she was working at the open-source platform when people started using it as a repository for bizarre conspiracy theories about a pedophilia ring run out of a Washington pizzeria. “I didn’t give the repository a second thought,” she writes, “until it was all over the news.”
Toward the end of “Uncanny Valley,” Wiener describes her belated realization that the tech entrepreneurs “were doing fine.” They “had power, wealth and control.” As for the rest of us — creating data that gets harvested and sold to companies that then use our data to sell us stuff — who knows? Maybe asking someone to describe the current online dispensation to a medieval farmer isn’t so risible after all. You might begin by making an analogy to feudal landlords and their serfs.

value: This website is an American daily newspaper based in New York City with a worldwide readership. Founded in 1851, the Times has since won 132 Pulitzer Prizes, the most of any newspaper, and has long been regarded within the industry as a national "newspaper of record".


text:
Top 10 Hotels in Landgraaf, Netherlands | Hotels.comEnglish (United States)Book online or call 800-246-8357This call is free. 24 hours a day; 7 days a week.HotelsHotel DealsPackages & FlightsGroupsHotels.com® RewardsGift CardsCustomer ServiceYour bookingsHelpWebsite feedbackReview a hotelSign in & AccountSign inCreate an accountYour bookingsHotelsNetherlands HotelsHotels in Landgraaf, NetherlandsHotels in Landgraaf, NetherlandsSearch & Compare Landgraaf HotelsCity, landmark, hotel name, address or zip codeCheck inCheck out I don’t know my datesTraveling for:WorkLeisureRooms123456789+Room 1:Adults12345678Aged 18+Children01230-17Age at check in:Child 1:-?-<11234567891011121314151617Show dealsCollect 10 nights get 1 free*And look out for Secret Prices on select hotels12345678910=FREETrending now in LandgraafMost bookedAmrâth Grand Hotel de l'EmpereurGood 3.6 / 5( 313 genuine reviews )Hotels.com® RewardsFor every 10 nights, get 1 free! 361 people looked at this hotel in the last hourMost recent review"Very nice hotel, very efficient staff, useful and quiet pool. Shame there is so much work going on outside....renevation of station is a must I suppose....it will be over soon enough. "A Traveller, Jul 2016, GBCrowne Plaza MaastrichtExcellent 4.2 / 5( 139 genuine reviews )Hotels.com® RewardsFor every 10 nights, get 1 free! 256 people looked at this hotel in the last hourMost recent review"Stayed 3 nights and had a comfortable nice stay. The view from the room was not on the riverside or exciting but the room was fine with good chair to sit on and the usual quality Crowne Plaza bed and bedding. The bathroom was a little dated and not the best shower as well as housekeeping had miss..."A Traveller, May 2016, GBTownhouse Designhotel MaastrichtExcellent 4.3 / 5( 199 genuine reviews )Hotels.com® RewardsFor every 10 nights, get 1 free! 224 people looked at this hotel in the last hourMost recent review"Between the train station and the Maas this hotel has a quirky design and the comfiest bed I have ever slept in! "A Traveller, May 2016, GBHotel BeaumontExcellent 4.2 / 5( 206 genuine reviews )Hotels.com® RewardsFor every 10 nights, get 1 free! 174 people looked at this hotel in the last hourMost recent review"I booked the Beaumont, but what used to be an annex is now a separate hotel called the Dutch. I cannot find fault with the Dutch. The staff are outstanding, the rooms immaculate and location (close to the train station and the city centre) and price excellent. They have a revolutionary idea of of..."A Traveller, May 2016, GBKruisherenhotel MaastrichtExcellent 4.6 / 5( 67 genuine reviews )Hotels.com® RewardsFor every 10 nights, get 1 free! 159 people looked at this hotel in the last hourMost recent review"Very comfortable hotel room (prestige room)with great bathroom(bath and separate double shower). Very special to be in a old monastery refurbished as hotel. Dining room in church. Only valet parking is expensive for a car that stays outside. Price/quality very good."A Traveller, Mar 2016, USNH MaastrichtExcellent 4.1 / 5( 273 genuine reviews )Hotels.com® RewardsFor every 10 nights, get 1 free! 140 people looked at this hotel in the last hourMost recent review"I stayed five nights to attend a conference being held at MECC. I chose the hotel for its proximity to MECC - but have to admit that I didn't realise just how far the hotel was from the city centre (or any shops).
But wifi was a bit weak. sometimes it becomes on and off."A Traveller, Apr 2016, GBSee more hotels in Landgraaf, NetherlandsRecently bookedAbdij Rolduc3 starsfrom $43Landgoed Overste Hof3 starsfrom $54Golden Tulip Parkstad Zuid-Limburg4 starsfrom $70Fletcher Hotel-Restaurant Kasteel Erenstein4 starsfrom $77Bastion Hotel Heerlen3 starsfrom $62Pay now or later on most roomsFree cancellation on most roomsBest Price GuaranteeMap of Landgraaf hotelsLandmarksSnowWorld LandgraafTransportationLandgraaf StationBest hotels in LandgraafWith 10 hotels in Landgraaf, there are several way you can use Hotels.com to find the perfect room.
If you are looking for Landgraaf hotels in a particular area, you can use the search feature at the top of the page to search by neighborhood, landmark, address or zip code, or you can search by using the built-in map feature. You can also browse hotels in Landgraaf by type, amenities, and star-rating so that you can find the best hotel. Currently, top rated hotels in Landgraaf are:
WinselerHof Hotel SnowWorld Landgraaf Landgoed Overste Hof Van der Valk Hotel Heerlen Rene's B&B The location of your Landgraaf hotel is important. If you are traveling to Landgraaf, &StateorCountry for business, you may want to consider getting a hotel close to the airport or near your meeting venue. By doing so, you can really cut down on transportation costs and time. You may also want to book a hotel that offers free wifi just in case you need to get some work done.
You’ll also want to determine which type of accommodations will suit your needs before booking a hotel in Landgraaf. If you’re traveling with the kiddos, a family friendly hotel will offer larger rooms and more sleeping arrangements. For those traveling for an extended period of time, booking a hotel suite with a kitchenette is a smart move and will feel a little more like home. If you are budget conscience and just need a place to rest your head, a hostel or motel may be all you need.
If you are looking to score the best discounts and deals, use the filter to sort by price from low to high. You can book a hotel in Landgraaf for as low as $56 per night. If you are looking to cut down on expenses, look for hotels that include free breakfast and parking. Some hotels even offer free shuttle service to and from nearby places. You can also sort by star rating, proximity, and guest rating.
Before you book, check out user reviews. Hotels.com has 162 reviews in Landgraaf. We show reviews from Expedia and TripAdvisor so you know that you are reading genuine, reliable reviews. Be sure to download the Hotels.com app so you can book your reservations on the go, view amenities, and save the hotels you want to view and compare later.Choose one of the following to unlock Secret Prices and pay less on select hotels.EmailSign up for our latest offersHotels.com appDownload the app and book on the goHotels.com® RewardsJoin now to collect 10 nights, get 1 free*Top DestinationsHotels in New York, New YorkHotels in Las Vegas, NevadaHotels in Chicago, IllinoisHotels in San Francisco, CaliforniaHotels in Washington, District of ColumbiaHotels in Boston, MassachusettsHotels in San Diego, CaliforniaHotels in Orlando, FloridaHotels in London, United KingdomHotels in New Orleans, LouisianaHotels in Los Angeles, CaliforniaHotels in San Antonio, TexasHotels in Paris, FranceHotels in Seattle, WashingtonHotels in Atlanta, GeorgiaHotels in Philadelphia, PennsylvaniaHotels in Austin, TexasHotels in Atlantic City, New JerseyHotels in Rome, ItalyHotels in Myrtle Beach, South CarolinaHotels in Dallas, TexasHotels in Houston, TexasHotels in Denver, ColoradoHotels in Miami, FloridaCustomer ServiceYour bookingsFAQsContact usWebsite feedbackReview a hotelFor Suppliers, Affiliates and the MediaAdd HotelAffiliate with usPrivate LabelPromote with UsTravel AgentsPress OfficeUser Terms and Privacy PolicyTerms & ConditionsPrivacy PolicyCookie PolicyAbout our adsAbout UsJobsTravel GuidesTop 50 CitiesAll countriesAll hotelsSite index© 2016 Hotels.com, L.P. All rights reserved.Hotels.com and the Hotels.com logo are trademarks or registered trademarks of Hotels.com, LP in the U.S. and/or other countries. All other trademarks are property of their respective owners.* Learn more about Hotels.com® RewardsABOUT SSL CERTIFICATES

value: This website is a website for booking hotel rooms online and by telephone. The company has 85 websites in 34 languages, and lists over 325,000 hotels in approximately 19,000 locations.