text:
|Automatic translating machine
|Fukumochi et al.
|Sense discrimination system and method
|Jacobs et al.
|Machine language translation system which produces consistent translated words
|Miiko et al.
|Machine translation system
|Takagi et al.
|Method and system for the representation of multiple analyses in dependency grammar and parser for generating such representation
|van Zuijlen
|Conversational-type natural language analysis apparatus
|Chart parser for stochastic unification grammar
|Hemphill et al.
|Sentence translator using a thesaurus and a concept-organized co- occurrence dictionary to select from a plurality of equivalent target words
|Machine translation system
|Fukumochi et al.
|System for translation of sentences from one language to another
a textual input interface for receiving and storing the textual information in the source natural language;
a translation engine, comprising:
a preparser for resolving ambiguities and determining the end of a sentence, comprising:
means for dividing the input text into words, and
means for associating the words with one or more dictionary entries and a sequence of words with one or more multiword dictionary entries, the means for associating including one or more dictionaries;
a parser comprising a grammar rules data base for computing possible syntactic interpretations of a sentence by application of grammar rules to applicable sentence constituents, the syntactic possibilities being stored in a chart;
a graph making engine for expanding the chart into a graph which includes semantic interpretations of the sentence, the graph comprising:
one or more nodes, wherein one node is assigned to each different combined syntactic and semantic interpretation for a particular substring of the sentence, each node's information being generated from a subnode(s) from which the node was formed and the grammar rule which was used to form the node; and
one or more pointers connecting a higher level node to its subnode, wherein a node without a subnode corresponds to a dictionary entry;
a storage means accessible to the graph making engine for storing each node and its semantic and syntactic information;
means for propagating the semantic information associated with each node upward through the graph;
an expert evaluator comprising a plurality of experts for evaluating the graph of stored semantic, syntactic, and other information for each node, wherein each expert assigns a numerical weight (N) to the node;
a scoring module for evaluating and combining the numerical weight (N) assigned each node by the experts, the scoring module storing the best combined numerical weight (N) scores for each node and also using the list of scores from the subnodes of the node to compute the node's score list;
a parse extractor for creating a parse tree structure from any best numerical weight (N) represented on the list of such weights for each node;
a structural converter having conversion tables for the target language for performing a structural conversion on the parse tree structure generated by the parse extractor to obtain a translation of the source language text to the target language, wherein the structural converter further includes components which control structural conversion based on access to one or more dictionaries or other data files;
a display for displaying the translation to the user;
a user interface permitting the user to interact with the translation engine to obtain alternative translations once the apparatus has provided the user with the best translation of the source language, the user interface allowing the user to request alternative translations for a word, the entire sentence, or any sequence of words in the sentence, and allowing the user to view retranslation of the entire sentence which includes the alternatives for the portion of the sentence that the user selected; and
an editing interface module coupled to the display and responsive to the user input device and the storage means, including a graph access module responsive to input from the user input device to alter a decision by the scoring module and to display an alternate translation on the display.
a module for evaluating the average relative frequency of particular parts of speech of words in the textual input;
a module for evaluating the average relative frequency of particular paraphrases or meanings of words in the textual input;
a module for evaluating the average relative frequency of the use of grammar rules;
a module for evaluating the inter-relations of phrases and clauses within the sentence based on the length and grammatical role of the clauses and phrases;
a module for measuring the semantic distance between words, for use in evaluating conjunctions;
a module for evaluating words with regard to semantic relations between them, such as selectional restrictions; and
a module for using capitalization of a word to influence which meaning of the word is used.
The invention relates to the automated translation of natural languages, and in particular to translation between English and Japanese.
Researchers have proposed various schemes for the machine-based translation of natural language. Typically, the apparatus used for translation includes a computer, which receives input in one language, and performs operations on the received input to supply output in another language. This type of translation has been an inexact one, and the resulting output usually requires editing by a skilled operator. To assist in this editing process, some translation systems include built-in editing facilities. One approach used in these systems has been to make alternate translations for individual words available to the operator. Another approach has been to provide a series of preferred alternate sentence translations and to permit the operator to choose the preferred one.
The translation operation generally includes a structural conversion operation. The objective of structural conversion is to transform a given parse tree (i.e., a syntactic structure tree) of the source language sentence to the corresponding tree in the target language. Grammar-rule-based structural conversion and template-to-template structural conversion have been tried. In grammar-rule-based structural conversion, the domain of structural conversion is limited to the domain of grammar rules that have been used to obtain the source-language parse tree (i.e., to a set of nodes that are immediate daughters of a given node). For example, given ##STR1## and: ##STR2## each source-language parse tree that involves application of the rule is structurally converted in such a way that the order of the verb and the object is reversed (note that in Japanese, the verb appears to the right of its object). This method is very efficient in that it is easy to find out where the specified conversion applies--it applies exactly at the location where the rule has been used to obtain the source language parse tree. On the other hand, it can be a weak conversion mechanism in that its domain, as specified above, may be extremely limited, and in that natural language may require conversion rules that straddle over nodes that are not siblings.
In template-to-template structural conversion, structural conversion is specified in terms of I/O templates or subtrees. If a given input template matches a given structure tree, that portion of the structure tree that is matched by the template is changed as specified by the corresponding output template. This is a very powerful conversion mechanism, but it can be costly in that it can take time to find out if a given input template matches any portion of a given structure tree.
The present invention includes an automated natural language translation method and apparatus. These present the advantage of greater productivity for operators of the system, as they allow them to retain just the portion of the translation that they deem acceptable, while causing the remaining portion to be retranslated. Since this selective retranslation operation is precisely directed at portions that require retranslation, operators are saved the time and tedium of considering potentially large numbers of incorrect, but highly ranked translations. Furthermore, because the system of the invention allows for arbitrary granularity in translation adjustments, more of the final structure of the translation will usually have been generated by the system, rather than by manual operator edits. This reduces the potential for human error and saves time in edits that may involve structural, accord and tense changes. The system can therefore efficiently give operators the full benefit of its potentially extensive and reliable knowledge of grammar and spelling. The invention's versatile handling of ambiguous sentence boundaries in the source language, and its powerful semantic propagation provide further accuracy and reduced operator editing of translations. Stored statistical information also improves the accuracy of translations by tailoring the preferred translation to the specific user site. The system's idiom handling method is advantageous in that it allows sentences that happen to include the sequence of words making up the idiom, without intending the meaning of the idiom, to be correctly translated, and ranking of the idiom dictionary adds a further level of power and versatility to this operation. The system of the invention is efficient, while retaining versatile functions, such as long distance feature matching. The structural balance expert and the coordinate structure expert effectively distinguish between intended parses and unintended parses. The capitalization expert effectively obtains correct interpretations of capitalized words in sentences, and the capitalized sequence procedure effectively deals with multiple-word proper names, without completely ignoring common noun interpretations.
FIG. 1 is a block diagram illustrating apparatus for performing automated translation of natural language according to the invention.
FIG. 2 is a data flow diagram illustrating overall functioning of the embodiment presented in FIG. 1.
FIG. 3 is a flow diagram illustrating the operation of the automated natural language system of FIG. 1.
FIG. 4 is a flow diagram illustrating the operation of the end-of-sentence function of the preparser of the apparatus of FIG. 1.
FIG. 5 is a flow diagram illustrating the operation of the parser of the apparatus of FIG. 1.
FIG. 6 is a flow diagram illustrating the semantic propagation operations of the apparatus of FIG. 1.
FIG. 7 is a flow diagram illustrating the structural conversion operations of the apparatus of FIG. 1.
FIG. 8 is a flow diagram illustrating the expert evaluator of the apparatus of FIG. 1.
FIG. 9 is a diagram of a sample graph as used by the apparatus of claim 1, for the exemplary phrase "by the bank".
Referring to FIGS. 1 and 2, an automated translation system 10 according to the invention includes an input interface 12, a translation engine 16, storage 18, a user input device 22, a display 20, and an output interface 14. The input interface is constructed to receive a sequence of text in a source language, such as English. The input interface may comprise a keyboard, a voice interface, or a digital electronic interface, such as a modem or a serial input. The translation engine performs translation operations on the source text, in conjunction with data in storage. The translation engine may be comprised entirely of hardwired logic circuitry, or it may contain one or more processing units and associated stored instructions. The engine may include the following elements, or parts of them: A preparser 24, a parser 26, a graph maker 28, a parse/translation evaluator 30, a parse extractor 32, a structural converter 34, and a user interface 42, which includes an alternate parse system 37. The structural converter may comprise a grammar rule controlled structural converter 36, a lexicon controlled structural converter 38, and a synthesis rule controlled structural converter 40. The storage 18 may include one or more areas of disk or memory storage, or the like. It may store the following elements, in whole or in part: a base dictionary 44, technical dictionaries 46, grammar rules 48, synthesis rules 50, a semantic feature tree 52, structure trees 54, and a graph 56. The user input interface 22 may comprise a keyboard, a mouse, touchscreen, light pen, or other user input device, and is to be used by the operator of the system. The display may be a computer display, printer or other type of display, or it may include other means of communicating information to the operator. The output interface 14 communicates a final translation of the source text in the target language, such as Japanese. The interface may comprise a printer, a display, a voice interface, an electronic interface, such as a modem or serial line, or it may include other means for communicating that text to the end user.
In operation of one embodiment of the translation system of the invention, referring to FIGS. 1, 2 and 3, the preparser 24 first performs a preparsing operation (step 102) on the source text 23. This operation includes the resolution of ambiguities in sentence boundaries in the source text, and results in a parse chart seeded with dictionary entries 25. The parser 26 then parses the chart produced by the preparser (step 104), to obtain a parse chart filled with syntactic possibilities 27. The graph maker 28 produces a graph of possible interpretations 29 (step 106), based on the parse chart resulting from the parsing step. The evaluator 30, which accesses a series of experts 43, evaluates the graph of stored interpretations (step 108), and adds expert weights to the graph 31. The graph scorer 33 scores nodes and associates the N (e.g., 20) best scores with each of them 35. The parse extracter 32 assigns a parse tree structure 39 to this preferred interpretation (step 110). The structural converter 34, which accesses the conversion tables 58, then performs a structural conversion operation (step 112) on the tree to obtain a translation 41 in the target language. The user may interact with the alternate parse system 37 to obtain alternative translations.
Referring to FIG. 4, the system begins the preparsing operation by dividing the input stream into tokens (step 114), which include individual punctuation marks, and groups of letters that form words. A group of tokens form a substring which may comprise one or more words which occur in the order specified as part of a sentence. The occurrence of whitespace affects the interpretation of characters at this level. For instance, in "x - y" the "-" is a dash, but in "x-y" it is a hyphen.
The preparser then combines the tokens into words (step 116). At this level, it recognizes special constructions such as phone numbers and social security numbers as single units. The preparser also uses dictionary lookup to find groupings. For example, if "re-enact" is in the dictionary as "reenact" it will become one word in the sentence, but if it is not, then it will remain as three separate "words".
The next preparsing phase involves determining where the sentence ends (step 118). During this operation, the preparser accesses the base dictionary and the technical dictionaries as it follows a sequence of steps for each possible sentence ending point (i.e., after each word of the source text). The preparser need not perform these steps in the particular order presented, and these may be implemented as a series of ordered rules or they may be hard-coded.
Referring to FIG. 5, the preparser interprets and records any nonparsable sequence of characters, such as a series of dashes: "------", as a sentence by itself, although not one which will be translated (step 120). The preparser also requires any sequence of two carriage returns in a row to be the end of a sentence (step 122). If the first letter of the next word is a lower case letter, the preparser will not indicate the end of a sentence (step 124). If a sentence started on a new line and is short, the preparser considers it a "sentence" of its own (e.g., a title).
The preparser interprets a period, a question mark, or an exclamation mark as the end of a sentence, except in certain situations involving end parenthesis and end quotes (step 128). In the case of sentences that ends with ." or ?" or the like, the preparser uses virtual punctuation marks after the quote in addition to the punctuation before the quote. Alternatives for the underlying punctuation required for ?" are illustrated in the following examples:
The question was "What do you want?".
Did he ask the question "What do you want?"?
Are you concerned about "the other people"?
In English, each of these is likely to end with ?" The virtual punctuation marks added by the preparser indicate that before the quote there is something which can be either a question mark or nothing at all. After the quote there is something that can be either a period or a question mark. The grammatical structure of the rest of the sentence allows later processing stages to select the best choice.
The preparser may also use several further approaches in preparsing a period (steps 130, 132, 134, 136, and 138). Some abbreviations in the dictionary are marked as never beginning sentences and others as never ending sentences (step 130). These rules are always respected. For example, "Ltd" never begins a sentence and "Mr" never ends one. The preparser also will not end a sentence with a single initial followed by a period unless the next word is a common grammatical word (step 132). If the word before the period is found in any dictionary, the period will end the sentence (step 134). If the word before the period is not in this dictionary, and it has internal periods, (as in I.B.M.) and the next word is not in the dictionary in a lowercase form, or the word after that is itself uppercase, then this is not an end of sentence (step 136). In remaining cases the period does mark the end of sentence (step 138).
Referring again to FIGS. 2 and 3, once the sentence boundaries have been defined by the preparser, the parser places the words of the sentence in syntactic categories, and applies grammar rules from the grammar database to them to compute possible syntactic interpretations 25 of the sentence (step 104). These grammar rules 48 can be implemented as a series of computer readable rules that express the grammatical constraints of the language. For the English language, there may be hundreds of such rules, which may apply to hundreds of syntactic categories. To reduce the computational overhead of this operation, the different possible meanings of a word are ignored.
In the next step (step 106), the graph maker employs the dictionary to expand the results of the parser to include the different meanings of words and creates a directed acyclic graph representing all semantic interpretations of the sentence. This graph is generated with the help of a series of semantic propagation procedures, which are described below. These procedures operate on a series of authored grammar rules and, in some cases, access a semantic feature tree for semantic information. The semantic feature tree is a tree structure that includes semantic categories. It is roughly organized from the abstract to the specific, and permits the procedures to determine how semantically related a pair of terms are, both in terms of their separation in the tree and their levels in the tree. For example, "cat" and "dog" are more related than "cat" and "pudding", and hence the former pair would be separated by a smaller distance within the tree. "Animal" and "cat" are examples of words that are stored at different levels in the tree, as "animal" is a more abstract term than "cat."
Referring to FIG. 9, the graph includes nodes 80 and their subnodes 82, 84, 86 linked by pointers 88, 89, 90, 91 in a manner that indicates various types of relationships. A first type of relationship in the graph is one where nodes representing phrases possess pointers to constituent word nodes or sub-phrase nodes. For example, a node 84 representing the phrase "the bank" will be linked by pointers 92, 93 to the constituent words "the" 94, and "bank" 95. A second type of relationship in the graph is where phrase interpretations possess pointers to alternate ways of making the same higher-level constituent from lower-level pieces. For example, a node 80 representing the phrase "by the bank" can have two source interpretation locations 81, 83, which each include pointers 88 & 89, 90 & 91 to their respective constituents. In this example, the different constituents would include different subnodes 84, 86 that each represent different meanings for the phrase "the bank". The structure of the graph is defined by the results of the parsing operation and is constrained by the syntax of the source sentence. The nodes of the graph are associated with storage locations for semantic information, which can be filled in during the process of semantic propagation.
The semantic propagation part of the system operates to propagate semantic information from smaller constituents to the larger constituents they comprise. It applies to four classes of the syntactic categories used in the earlier parsing operation: SEMNP (which includes noun-like objects and prepositional phrases), SEMVP (verb phrase like objects, which usually take subjects), SEMADJ (adjectives) and VERB (lexical verb-like verbs that often take objects). Other syntactic categories are ignored within a rule. The grammar rule author may also override the implicit behavior below by specific markings on rules. These specific instructions are followed first.
There are two aspects to the manner in which semantic features are propagated through the system. The first is a set of rules that tell from examining the noun-like and verb-like constituents in a grammar rule, which selectional restriction slots of the verb-like constituents apply to which noun-like objects. For instance, the rule for the verb phrase of the sentence: "I persuaded him to go" is roughly VP=VT11+NP+VP (where VP is a verb phrase, VT11 is a type of transitive verb, and NP is a noun phrase). One exemplary default rule indicates that when a verb takes objects, selectional restrictions are to be applied to the first NP encountered to the right of the verb. Another rule says that VP restrictions on their subjects should be applied to the first NP found to the left of a VP. Together these rules make sure that "persuade him" and "him go" are both evaluated for their semantic plausibility. As mentioned before, these rules reflect the complex grammar of the English language and there may therefore be quite a few of them.
Referring to FIG. 6, the semantic propagation operation includes copying of selectional restrictions from SEMVPs to imperative sentences (step 140). If a SEMNP is being used as a locative expression, its goodness is evaluated against semantic constants defining good locations (step 142). If a rule involves a conjunction of two SEMNPs (detected because of ANDing together of syntactic features), the graph maker ANDs together the semantic features and applies the semantic distance expert (step 144).
If, in the course of examining the rules specified for syntactic feature propagation, the graph maker locates a "head" SEMNP which gets propagated to a higher level (e.g., it becomes part of a SEMNP that includes more words), it propagates semantic features as well (step 146). However, if the "head" is a partitive word (e.g., "portion," "part"), it propagates from a SEMNP to the left or right instead. SEMVPs and SEMADJs are propagated in the same way, with the only exception being that SEMVPs and SEMADJs do not have any partitive situations (step 148). Adjectives are part of the SEMVP class for this purpose.
When a SEMVP is made from a rule including VERBs, the graph maker propagates upward the VERB's subject restriction unless the VP is a passive construction, in which case the VERB's first object restriction is propagated instead (step 150). In any rule containing SEMVPs, it attempts to apply the selectional restrictions of the SEMVPs to NPs encountered moving leftward from the SEMVP (step 152). In any rule containing SEMADJs, the graph maker attempts to apply the selectional restriction of the SEMADJ first to any SEMNPs encountered moving to the right from the SEMADJ, and if that fails, tries moving to the left (step 154).
For any remaining unused object selectional restrictions of a VERB (that have not been propagated upward because of passives), the graph maker applies them in turn to SEMNPs encountered in order to the right of the VERB (step 156). In all of these rules, a verb selectional restriction is used up as soon as it applies to something. In all rules up to this one, SEMNPs Are not used up when something applies to them. Starting at this rule, the SEMNP does get "used up". Finally, if a rule makes a SEMVP, the graph maker determines if there are any SEMVPs or SEMADJs in it that have not yet been used, and if so, propagates them upward (step 158).
The system also performs feature matching of linguistic features. Linguistic features are properties of words and other constituents. Syntactic feature matching is used by the parser, and semantic feature matching is used by the graph maker. But the same techniques are used for both. For instance, "they" has the syntactic feature plural, while "he" has the feature of singular. Feature matching uses marking on grammar rules so that they only apply if the features of the words they are to apply to meet certain conditions. For example, one rule might be: S=NP[ ]+VP[ ]
Where the signs mean that the number features of the NP and VP must match. So while this rule will allow "they are" and "he is", it will not allow "they is" and "he are".
Feature match restrictions are broken into "local" and "long distance". The long distance actions may be computed when the grammar is compiled, rather than when actually processing a sentence. The sequence of long distance operations that must be performed is then encoded in a series of instruction bytes. The computation of long distance feature operations must start with an n-ary rule (i.e., one that may have more than two inputs on its right). The system then distributes codes to various binary rules so that feature sets end up being propagated between rules in the correct fashion. By breaking the n-ary rules into binary rules, the parsing operations are greatly simplified, but because the system keeps track of feature sets across binary rules, it retains the power of the long distance operations.
The system of the invention also allows multiword "idioms" as part of the dictionary, while retaining representations of the individual words of which they are composed. These two forms may ultimately compete against each other to be the best representation. For instance "black sheep" is found in the dictionary with the meaning of a disfavored person. But in some cases the words "black sheep" may refer to a sheep which is black. Because both of the forms are retained, this non-idiomatic usage may still be chosen as the correct translation.
The idioms may belong to further categorizations. For example, the system may use the following three types:
Almighty: United States of America
Preferential: long ago
Normal: black sheep
Almighty idioms suppress any other possible interpretation of any of the words that make up the sequence. Preferential idioms suppress other constituents of the same general type and that use the very same words. Normal idioms compete on an even footing with other entries.
The resulting graph is to be evaluated by experts (step 108, FIG. 3), which provide scores that express the likelihood of correctness of interpretations in the graph. The system of the invention includes a scoring method that applies to all partial sentences of any length, not just full sentences. An important element in the use of a graph is that a subtree is fully scored and analyzed only once, even though it may appear in a great many sentences. For example, in the phrase "Near the bank there is a bank.", the phrase "Near the bank" has at least two meanings, but the best interpretation of that phrase is determined only once. The phrase "there is a bank" similarly has two interpretations, but the best of those two is determined only once. There are therefore four sentence interpretations, but the subphrases are scored just once. Another feature of the graph is that each node is labeled with easily accessible information about the length of that piece of the sentence. This allows the best N interpretations of any substring of the English sentence to be found without reanalyzing the sentence.
Although, in one implementation, only the N overall best analyses of the sentence are available at any one time (N being a number on the order of 20), the use of a graph allows the system to integrate the result of a user choice about a smaller constituent and give a different N best analyses that respect the user's choice. Because all this is done without reparsing the sentence or rescoring any substrings, it may be done quickly.
Referring to FIG. 8, operation of the expert evaluator 30 is based on various factors that characterize each translation, which are handled by the various experts. The rule probability expert 170 evaluates the average relative frequency of grammar rules used to obtain the initial source language parse tree. The selectional restriction expert 178 evaluates the degree of semantic accord of the given translation. The dictionary entry probability expert 172 evaluates the average relative frequency of particular parts of speech of the words in the sentence used to obtain the initial source language parse tree. The statistics expert evaluates the average relative frequency of particular paraphrases chosen for the given translation.
The system keeps track of statistical information from translation usage at each customer site at more than one level. For example, the system may maintain statistical counts at the surface form level (how often was "leaving" used as a transitive versus an intransitive verb), and also at the meaning level (did it mean "leave behind" or "depart" from), and this second type is summed over occurrences of "leave", "leaves", "left", and "leaving". The system may also keep statistical counts separately for uses that have occurred within the last several sentences, and uses that have occurred at any time at the customer site. Furthermore, the system may distinguish cases where the user intervened to indicate that a particular word sense should be used, from cases where the system used a particular word sense without any confirmation from the user.
The structural balance expert 182 is based on a characteristic of English and many other European languages pertaining to the lengths of constituents in a given sentence. In some (but not all) constructions, sentences which involve heavy (lengthy) elements to the left of light elements are disliked in these languages. For example:
|##STR3## [acceptable] ##STR4## [unacceptable] ##STR5## [acceptable]
Given two parses of a given sentence, if one contains a "Heavy - Light" sequence involving a construction that tends to avoid such a sequence, and if the other parse does not, then it can be assumed that the former does not represent the intended interpretation of the sentence. This expert is an effective way to distinguish between intended parses and unintended parses.
In coordinate structures of the pattern of "A of B and C" it can be difficult to determine whether the intended interpretation is "A of [B and C]" or "A [of B] and C". The coordinate structure expert 180 measures the semantic distance between B and C, and that between A and C to determine which mode of coordination combines two elements that are closer in meaning. This expert accesses the semantic feature tree during its operation. This expert is also an efficient way to distinguish between the intended parses and the unintended parses of a given sentence.
Many words in English include potential ambiguities between ordinary-noun and proper-name interpretations. The capitalization expert 176 uses the location of capitalization in a sentence to determine how likely it is that the capitalization is significant. For example, the following sentences:
Brown is my first choice.
My first choice is Brown.
are different in that while the former is genuinely ambiguous, it is far more likely in the latter that "Brown" is a person name than a color name. This expert takes into consideration factors such as whether a given capitalized word appears at sentence-initial or sentence-noninitial position (as shown above), whether the capitalized spelling is in the dictionary, and whether the lower-case-initial version is in the dictionary. This expert is an effective way to obtain the correct interpretations of capitalized words in sentences.
If a sentence contains a sequence of initial-uppercase words, it can be treated as a proper name or as a sequence of ordinary nouns. The system of the invention employs a capitalized sequence procedure, which favors the former interpretation. Also, if the sequence cannot itself be parsed by normal grammar rules, it can be treated as a single unanalyzed noun phrase to be passed through untranslated. This procedure has proven to be a very effective way of dealing with multiple-word proper names while not completely ignoring the lower-rated common noun interpretations.
Referring to FIG. 7, the machine translation system of the invention uses a grammar-rule controlled structural conversion mechanism 162 that has the efficiency of a straightforward grammar-rule-based structural conversion method, but which comes close to the power of the template-to-template structural conversion method. This method relies on the use of grammar rules 160 which can specify non-flat complex substructure. While the following is a rule format used in other translation systems: ##STR6## the system of the invention uses grammar rules of the following format: ##STR7## In this syntax, symbols prefixed with "#" are virtual symbols that are invisible for the purpose of sentence structure parsing, but which are used in building substructures once a given parse is obtained.
Given this type of grammar, it becomes possible to specify multiple structure conversion among any sequences of nodes that are siblings in the substructure. This transforms a grammar-rule-based structure conversion mechanism into one with some of the power of the templete-to-template structure conversion mechanism. Although the system of the invention is based on the second type of grammar rules presented above, it automatically compiles the corresponding grammar rules of the first form. It can therefore use grammar rules of the first form to parse sentences, and use grammar rules of the second form to build parse structures.
The structural conversion also includes a dictionary controlled structural conversion operation 166, which accesses dictionaries 161 to operate on the parse tree after it has been operated upon by the grammar-rule controlled structural conversion operation. The synthesis-rule controlled structural conversion operation then applies synthesis rules to the resulting parse tree to provide the target language text 41.
Referring again to FIGS. 1 and 2, after the system has derived a best-ranked translation in the process described above, it is presented to the user via the display 20. The user then has the option of approving or editing the translation by interacting with the alternate parse system 37, via the user input device 22. In the editing operation, the user may constrain portions of the translated sentence that are correctly translated, while requesting retranslation of the remaining portions of the sentence. This operation may be performed rapidly, since the system retains the graph with expert weights 31.
The above operations may be implemented by a variety of hardwired logic design and/or programming techniques. The steps as presented in the flowcharts generally need not be applied in the order presented, and combinations of the steps may be combined. Similarly, the functionality of the system may be distributed into programs and data in various ways. Furthermore, it may be advantageous to develop the grammar and other operative rules in one or more high level languages, while supplying them to end users in a compiled format.
The invention may be embodied in other specific forms without departing from the spirit and the essential characteristics thereof. Accordingly, the invention is to be defined not by the preceding description, which is intended as illustrative, but by the claims that follow.


text:
Travel Innovation Summit 2014: Trends and Insights
Thirty-two startups vied for the General Catalyst Award for Travel Innovation during Tuesday's Travel Innovation Summit. Presenters frequently visited four underlying themes during their pitches:
- Personalization – using machine learning, combining personal data with real-time information, and leveraging a variety of discoveries gleaned from big data to make highly relevant recommendations.
- Integration of all kinds of long-tail and ancillary travel services, including travel insurance, car rental, destination services and duty-free shopping. In essence: "Would you like fries with that?"
- Simplifying the consumer travel experience: removing the pain of arranging ground transportation, recovering from flight disruptions.
- Helping travel suppliers and sellers work more efficiently and profitably by enabling better revenue management, reducing IT investment, and improving speed and reliability – most often by capitalizing on cloud services.
Many innovators on Tuesday focused on intermediaries – online travel agencies, destination management organizations and travel management companies – rather than on the B2C space. The disruptive business models proposed by some presenters conflicted sharply with supplier interests, prompting Critics Circle panelist Terry Jones to describe one innovator's product as "anti-revenue management software" and to suggest that another "get some insurance" as protection from supplier retaliation.
See a full list of finalists and recap here.
About the AuthorMore Content by Katherine Oberhofer

subset: commoncrawl


text:
Credit Card Processing Merchant Account and Software Options ...
Credit Card Processing, Credit Card Readers, PayPal & Authorize.net Credit Card . and why we created a system far better than traditional credit card terminals .
Credit Card Processing Services – What to Look for & What to Avoid ...
Mar 8, 2012 . Choosing a credit card processing company for your business is a tough decision . . use services like PayPal or BillMeLater to take credit card payments . traditional credit card processing services that provide you with card .
paypal versus traditional credit card processors
The Advantage of Authorize.Net
Net Payment Gateway over other competing payment solutions and merchant accounts. . or expertise to build a direct connection to the payment processing networks. . In other words, a payment gateway acts just like a traditional credit card . come from alternative payment methods such as PayPal and Google Checkout.
FDIS Crystal Lake Credit Card Processing Review Area...
Aug 20, 2011 . We've been asked by a number of people about PayPal and what it is, . PayPal fits into the category of credit card processing because that is exactly what . using PayPal as they are with a traditional credit card processor.
Bad Debt
How to Accept Credit Cards Without a Merchant Account: 9 steps
Apr 22, 2012 . Most traditional credit card merchant account providers will either... . PayPal and NetBanx are two of the third party credit card processing .
PayPal: The Good, The Bad And The Ugly | Formulis Las Vegas ...
Feb 18, 2012 . Unlike banks, PayPal provides small and low-volume merchants with a cheaper and easier alternative to traditional credit card processors.
PayPal | Traditional Credit Card Merchant Processing Account ...
PayPal as an Alternative to a Traditional Credit Card Merchant Processing Account. MerchantServices-Help.com. Sign up for PayPal and start accepting credit .
Putting It Into Practice
Small Biz Survival: Accept credit cards with PayPal Here
Mar 27, 2012 . PayPal, a huge name in accepting online payments, is jumping into the . "This is more bad news for traditional credit card processing and .
PayPal Or Square? Which Is Better? - Accept Credit Cards
Mar 30, 2012 . Should I Accept Credit Cards With PayPal or Square? Ever since PayPal announced that they were entering the mobile credit card processing arena, we. . A traditional merchant account may have a lower per transaction .
Stripe (company): What are the advantages of using Stripe for in-app ...
Braintree is the established alternative to both PayPal and traditional credit card processors (e.g. Authorize.net). In addition to our awesome gateway API, .
Credit Card processing with In Ticketing
At In Ticketing we provide credit card and merchant account processing via all major credit cards, pay pal, and electronic checks. . Process payments via traditional Internet credit card account merchant account and integration using a Pay .


text:
Thursday, May 14, 2009
And The Number Is ... Week 19 Weigh In
I didn't make it to the gym as much as I wanted to because of everything that was going on this past week but I definitely got in a lot of exercise. I was on my feet for days cooking, setting up and cleaning up after the party.
I was able to try some new recipes this week. Some I liked and some I didn't. I made a red chard and caramelized onion salad that was gross. :) I did very well controlling myself this week. With all of the leftovers in the house it was very hard. I gave a lot away and the rest I packed in my husband's lunches. The only problem I did have was that I ate about 5 cookies that my mom and I had made for the party. They were amazing sugar cookie decorated to look like a cupcake. They seriously were awesome. I could eat a dozen at a time if I let myself. I still have some left but I will not let myself touch them.
And what you have been waiting for. When I stepped on the scale this morning the number that I saw was 189.4. This brings me to a total loss of 27.2 pounds. Yeah!!! I am so excited to be back in the 180's. It seemed like it took forever and I have now decided that I really, really hate the 190's and really never want to go back. 185 here I come!
It is very exciting to think that in a few short weeks I will be in the 170's. Some people may say I am crazy to start thinking about that when I just got into the 180's. But I think this is what keeps me going. Dreaming about what it will feel like when I lose another 10 pounds. So exciting isn't it?
My Week In Review:
1. Exercise: I think I did fairly decent in this area this week. I didn't make it to the gym much but I did take a bike ride, go for a two hour walk and plan a party and make food for 70 people. I definitely think the party planning counts as exercise. My body never hurt so bad in my entire life. I seriously contemplated going to the emergency room the night after the party. Luckily I have a great husband who massaged my legs and feet until I could go to sleep and by the next morning I was much better. I could walk anyway. :)
2. Track My Points Every Day: I didn't track my points as much as I would have liked to but I did track them in my head. I really need to get back to using the online tracker.
3. Exercise Points: I didn't eat these this week.
4. Water: I drank a ton of water this week.
5. Late night eating: Last night I did eat a little chocolate in the middle of the night. I woke up around midnight and thought that I forgot to let our dog back in. I went downstairs and he was in the house so I decided to eat chocolate. I seriously don't think straight in the middle of the night.
6. Snacking: I really have not had much time for snacks this week. With the party and cleaning the house after the party it has just been crazy. When I did snack I grabbed a Fiber One Bar.
7. Eating more fruits and veggies: I ate a ton of veggies this week. My house was stocked with fruits and veggies. I had Romain lettuce, red chard, arugula, dandelion, eggplant, apples and pairs.
Well, I am off to the gym. Hopefully I can make it on the elliptical for at least 45 minutes. I am pretty tired today. I think because it is so dreary outside. I have much more energy when it is sunny. I hope you all have a great day and make sure you sign up for my giveaway here if you haven't already. Check back later to find out how my eggplant pizza turns out tonight. I love trying different recipes.
11 comments:
- Angie said...
Good For You! That's so awesome that your were faced with a lot of temptation, and yet were able to control it and lose weight. You're doing great!
- May 14, 2009 at 7:23 AM
- Carrie said...
YEAH!! Great job!! 180's :) Glad you could join me :) Now on to the 170's we go!!! I have maintained the EXACT same weight for 2 weeks now...not this week!! Oh!! And I was going to ask you what you are doing with your eggplant - we joined a organic veggie/fruits delivery service and I now have 2 gorgeous purple eggplants in my fridge and HAVE NO CLUE what to do with them!! I have come to the conclusion that I will be eating them all, as I think my husband won't touch them with a 10 foot pole! :) Here is to a great week!!
- May 14, 2009 at 7:24 AM
- Unknown said...
You are making great progress! It does feel great to get down to new numbers. I can't wait to get into the 180s again either! Actually I can't wait to get back to my 10%...I remember how GREAT I felt and it is motivating. Keep it up!
- May 14, 2009 at 7:28 AM
- Unknown said...
great job Jessica! :)
- May 14, 2009 at 7:34 AM
- Chubby Chick said...
Wow! Congrats on the loss! And... congrats on resisting those cupcakes! That would have been really hard for me! hehe
- May 14, 2009 at 7:43 AM
- Rachel said...
Well done you!! That's so great! And I absolutely understand dreaming of the next ten down - I'm always thinking 'Ooh I'm glad I lost that, but this isn't where I'm stopping!'
- May 14, 2009 at 8:35 AM
Awesome job! I'm the same way at night. It's almost like "sleep-eating" or something. Thank goodness it hasn't happened in a while though!
I really need to get a gym membership.
- May 14, 2009 at 10:38 AM
- Mimi said...
Congratulations! I have fallen hard off of the wagon & am now going on vacation for a week. I'll be totally rededicating myself on Memorial Day when I return from Vaca.
- May 14, 2009 at 2:07 PM
- Katie said...
Congratulations! You're doing a spectacular job!
- May 14, 2009 at 3:33 PM
- Journo June aka MamaBear said...
Wooohooo! Congrats on the new decade. You'll be in the 70's in no time. Glad you survived the craziness of your big party.
- May 15, 2009 at 12:20 AM
Great job! Hey, the fact that you stopped at 5 cookies is amazing!
Hello to the 180's!!
- May 15, 2009 at 9:47 AM


text:
Junk and Deleted Stuff
All the unapproved, invalid, or unwanted material will be transferred to this recycle bin and will be deleted later on. This will show that how much your material is valid or not.6 Threads8 Posts
Users Browsing this Forum
There are currently 1 users browsing this forum. (0 members & 1 guests)


text:
Sunday lyrics - Sonic Youth
Sunday Song Lyrics
Sunday comes alone again
A perfect day for a quiet friend
And you, you will set it free
I see new morning yound your face
Everybody says it's another phase
And now, now it's come to me
See the magic in your eyes
I see it come as no surprise
And you, you turn your eyes away
Yeah, you, you turn it all away
I guess it's true, it's never too late
Still I don't know what to do today
Oh, why can't I set you free?
Will you do the same for me?
Sunday comes and sunday goes
Sunday always seems to move so slow
To me, here she comes again
A perfect ending to a perfect day
A perfect ending, what can I say
To you, lonely sunday friend?
With you, Sunday never ends
[Thanks to firstname.lastname@example.com for lyrics]
A-Z Lyrics Universe
Popular Suburbia (1997 Film) Songs
New soundtracks
Follow us
Lyrics / song texts are property and copyright of their owners and provided for educational purposes.


text:
Download all free Bugeye sailboat PNG Clip arts for Web PNG and SVG file format,
PNG Clip arts
SVG Clip arts
.. PNG Clip arts SVG Clip arts
The Story of Our Merchant Marine by Willis J. Abbot, 1919 The original bugeye sailboat clip arts has a high definition.
This free Clip arts design of Bugeye sailboat PNG Clip arts has been published by Clipartsfree.net. The origional size of the image is 829 × 900 px and the original resolution is 300 dpi.
Thousands ClipartsFree users have previously viewed this image, from photographs free collection on ClipartsFree. The source also offers Clip arts photographs free: bugeye, sailboat,
File Bytes: 229278 bytes
Share Link
Embed in HTML
Similar Bugeye sailboat PNG images
Remember Community Guidelines 180
0 Comments


text:
Listen: The Walkmen's Walter Martin With Yeah Yeah Yeahs' Karen O: "Sing to Me"
Album also features the National's Matt Berninger, the Walkmen's Hamilton Leithauser and Matt Barrick, Yeah Yeah Yeahs' Nick Zinner, others
Photo by Tom Allen
Walter Martin: "Sing to Me" [ft. Karen O] (via SoundCloud)
The Walkmen have parted ways for the time being (aside from that NBA All-Star Weekend party). Walkmen co-writer/multi-instrumentalist Walter Martin will release his new solo LP We're All Young Together May 13 via Family Jukebox. Check out "Sing to Me" featuring Yeah Yeah Yeahs' Karen O above.
The album also features guest spots from Yeah Yeah Yeahs' Nick Zinner, the National's Matt Berninger, Martin's Walkmen bandmates Hamilton Leithauser and Matt Barrick, Clap Your Hands Say Yeah's Alec Ounsworth, and others.
(Walkmen frontman Leithauser is also currently working on a solo album with members of Vampire Weekend, the Shins, and Fleet Foxes. And bandmate Peter Matthew Bauer will release his solo album Liberation! this summer as well.)
According to a press release, Martin began writing the songs on his new record when the Walkmen were finishing Heaven, which was also when his wife was pregnant with their first child. He calls this one "a family record":
I began to imagine a record I really wanted to hear: something new and original that captured the essence of early rock 'n' roll - innocent but mischievous, romantic but funny, and unabashedly sweet. It wasn't that I wanted to write songs to suit my new situation as a parent, it was more that parenthood made relevant writing the kind of songs I've always loved most.
Here's a lyric illustration for "Sing to Me" by illustrator/Railroad Jerk/White Hassle member Marcellus Hall, who designed the album's artwork:
Watch the Walkmen perform "Heaven" on Pitchfork.tv's "+1":


text:
Mastering the 'Name Your Product Category' Game
Magazine: Winter 2015
- Research Feature
- Read Time: 21 min
When is the best time to enter a new industry? As it turns out, understanding the product category dynamics in an emerging industry and when a dominant category label has been introduced are important to identifying the "window of opportunity" to enter. Dominant category labels typically are introduced right before the industry starts a phase of rapid growth and consolidation. Companies would do well to track category labels before introducing a product in a nascent industry.


text:
The IOCO ALL GLASS Travellers are hand-blown and the only traveller on the market with a glass lid. So say goodbye to drinking from 'icky' plastic and silicone lids.
Dimensions: 127mm x 80mm (top diameter) x 68mm (base diameter)
Do not microwave
At IOCO we believe coffee is too enjoyable and important to ever be compromised, even when you are on the go, in the car or at your desk.
We have designed a handblown, full glass, super-strong travel cup with a double wall to maintain your perfect coffee temperature. A full silicone sleeve, insulates, protects and most importantly has an entirely glass lid, so there is no compromise on taste. Say goodbye to 'icky' plastic and silicone lids and experience the luxury of drinking your coffee from glass. Our glass mouthpiece is of substantial size, so as to not affect the coffee crema. Yep - this is a thing and some say the best part!
Join us in the war on waste and do your bit without compromising on taste, experience and style. Our premium new traveller is 'barista approved', dishwasher safe and sure to impress at your friends & the local cafe.


text:
Full-Stack Python Developer
Paris, Île-de-France, France
At Gorgias (Techstars NYC '15), were making customer support software to easily handle big volumes of customer requests.
Were using machine-learning to automatically group requests, suggest the right responses and show only the relevant information for the customer support agent to take swift action on repetitive tasks. Were also building integrations with 3rd party software and aim to provide the best API in this space. All of this packaged with a simple UI that saves time to customer support agents.
Watch our demo day pitch here.
You should join us if you care deeply about:
- Building quality software for customer support agents and improving the overall experience for the end customer. Enough with *** customer-service!
- Carefully designing, consuming and implementing the API facing our customers.
- Writing rock-solid Flask apps with clear APIs and workers that handle all the data syncing/dataset generation, etc..
- Moving fast and hacking which translates to: Trying, Failing, Refactoring, Testing, Profiling and Debugging the living *** out of our code while most importantly Shipping fast!
- Being a great team player and enabling other people in the team with your skills and jokes
A big bonus for us would be if also like:
- Making simple interfaces that are both powerful and flexible using JS and enough bootstrap to survive.
- You know your way around *nix tools and use them proficiently.
- Have a good base in machine-learning and NLP specifically.
Who youll work with:
- Alex, CTO — full stack developer and has experience in Machine Learning. Youll be working with him mostly.
- Romain, CEO — handling the business side of things
Our stack:
- Langs: Python and JS primarily. A little bit of Golang.
- Libs: Flask for APIs, React/Redux for the UI, scikit-learn, gensim and keras for ML.
- DB: Postgres
- Task Queue: Rabbitmq + Celery
- Hosting: AWS (with enough credits to launch those sweet GPU instances)
About usWeve built a Chrome Extension to write emails faster with shortcuts. It has 10.000 users, growing 7% a week.
Weve developed a macro suggestion tool for Zendesk. We have several Enterprise customers paying for it.
- Have a huge impact on an ambitious product
- Competitive salary & equity according to profile
- Free lunch / transportation


text:
This privacy policy sets out how DShofer Inc. ("DShofer") uses and protects any information that you give DShofer when you use this website or the DShofer Application. DShofer is committed to ensuring that your privacy is protected. Should we ask you to provide certain information by which you can be identified when using this website, then you can be assured that it will only be used in accordance with this privacy statement.
DShofer may change this policy from time to time.. You should check this page from time to time to ensure that you are happy with any changes. This policy is effective from 07/01/2014.
We require information to understand your needs and provide you with a better service. We use it for internal record keeping. We may periodically send promotional emails about new products, special offers or other information which we think you may find interesting using the email address which you have provided.
We are committed to ensuring that your information is secure. In order to prevent unauthorized access or disclosure, we have put in place suitable physical, electronic and managerial procedures to safeguard and secure the information we collect online.
We use traffic log cookies to identify which pages are being used. This helps us analyze data about web page traffic and improve our website in order to tailor it to customer needs. We only use this information for statistical analysis purposes and then the data is removed from the system.
You can choose to accept or decline cookies. Most web browsers automatically accept cookies, but you can usually modify your browser setting to decline cookies if you prefer. This may prevent you from taking full advantage of the website.
Our website may contain links to other websites of interest. However, once you have used these links to leave our site, you should note that we do not have any control over that other website. Therefore, we cannot be responsible for the protection and privacy of any information which you provide whilst visiting such sites and such sites are not governed by this privacy statement. You should exercise caution and look at the privacy statement applicable to the website in question.
You may request details of personal information which we hold about you by writing to or emailing us at email@example.com. We will not sell, distribute or lease your personal information to third parties unless required by law to do so. If you believe that any information we are holding on you is incorrect or incomplete, please write to or email us as soon as possible, at the above address. We will promptly correct any information found to be incorrect.


text:
The Anguilla Tennis Academy ("ATA") is a nonprofit organization established under the laws of Anguilla. Since 1996, the ATA has been providing tennis service to the island of Anguilla as well as other surrounding countries. The ATA is a non-profit grassroots program that started small and has grown into a major force for development on the island and in the region. From its humble beginnings in 1996, a camp was started with thirty-five (35) students on two public tennis courts built by the Anguilla Social Security Board on the James Ronald Webster Park, The Valley, Anguilla.
The ATA, has seen over 4,000 participants go through the program and benefit from tennis. The program has inspired many tennis players, college coaches, television producers and musical artists to share in this worthwhile endeavor and to work towards making the project a reality.
The Anguilla Tennis Academy is dedicated to providing the highest quality tennis instruction to Anguillian, Caribbean and International youth in a competitive environment, while encouraging exemplary sportsmanship.
- To make tennis athletic scholarships available for children who excel in the training programs.
- To foster long lasting friendships through our cultural exchange and outreach programs.
- To promote a strong sense of community by recruiting and hiring graduates of the ATA to return as tennis coaches.
- To establish professional relationships with other local, regional, and international tennis programs.
The primary goal of the Anguilla Tennis Academy is to expose children to the joys, discipline and rigor of the lifelong sport of tennis, where they can acquire technical skills, experience competitive sportsmanship and develop a strong sense of community.
The Anguilla Tennis Academy is committed to developing healthy minds and providing educational opportunities for children through the sport of tennis. The academy was founded on the principle of using tennis as a vehicle to reach and empower children and to equip them with the skills and knowledge to become responsible citizens of their community.
The Anguilla Tennis Academy will continue to provide a nurturing environment where children will learn how to apply the principles of sacrifice, work, courage, and service towards building a successful life and becoming ambassadors of the sport of tennis.
Program Description
Currently at the ATA we have several programs for the youth. The programs of the ATA are structured to empower young people by using tennis as a vehicle for social transformation. The recruitment, enrollment, and instruction methodologies are designed to cut across economic and social handicaps that deny access to motivated and talented young persons interested in learning the sport.
Our award winning youth programs have achieved success and international attention among tennis professionals despite the fact that our primary operation started on two deteriorating public courts, and occasionally, on a few of the local hotel courts during the off-season. The programs are designed to challenge the students in three main areas: (1) Academically – to help students meet the requirements of accredited colleges; (2) technically – to help students reach exceptional standards in tennis and (3) Socially – to help students demonstrate self-discipline, anger management skills, team building and leadership.
The programs provide its graduates with an opportunity to pursue a college education through its scholarship program. The ATA has assisted three persons to achieve tennis athletic scholarships and is currently assisting two more potential candidates to attend college in the year 2015. The ATA is proud of the fact that some of its graduates have gone on to college on tennis scholarships facilitated by the program and others that remained at home have held the positions of directors of tennis at some of our leading resorts such as Malliouhana, Cuisinart Golf Resort and Spa and Viceroy Anguilla.
Our two main programs are the "After School Program" and "The Annual Summer Camp".
After School Program
The ATA started its After School Program to provide year-round tennis instruction for interested children. The After School Program runs concurrently with the school year from September 1st to July 5th each year. The Program starts the first week in September and ends the first week in July. The program initially ran on the two public courts on the James Ronald Webster Park. In 2007 the ATA moved its After School Program to its tennis facilities in Blowing Point. The program has grown from an attendance of about fifty-five (55) children between the ages of 5 – 17, to a registration of over eighty (80) children.
The After School Program has proved to be an instrumental part of the life of students who are excelling at the local schools in Anguilla. Many of the participants and their parents have indicated that prior to joining the After School Program, some students were struggling with school work due to an inability to focus and work in groups. After participating in the ATA's After School Program there has been an improvement in performance in school work, in group projects and an improvement in the life of the children as a whole. For the ATA, this is a fulfillment of its philosophy. Having recognized the importance of the After School Program in the lives of children in Anguilla, a scholarship program was introduced. The After School Program offers scholarships for students who are interested but do not have the means to pay the monthly fee of US$75. Our goal is to have at least 100 children participating in the program annually.
Annual Summer Program
During the month of July each year, the ATA conducts a summer camp which starts on the second week of July and runs for two weeks. Over 150 children participate in the Summer Camp regularly. Certified USPTA and college coaches are flown in from the USA and around the world to assist and help children grow in the sport. The summer camp is one of the biggest attractions for the ATA facility. The Summer Camp is also used as a recruiting tool for children to participate in the After School Program.
Mitchelle Lake is the founder and director of the Anguilla Tennis Academy. His undying devotion to his country speaks for itself and is tangible in the hearts of the many children he has aided in not only athletic prowess but character as well. His dream of bringing tennis to the island of Anguilla began while attending Gardner-Webb University in North Carolina. He realized that he was afforded an opportunity to receive an education free of charge based on the fact that he excelled at tennis. Anguilla has no university, therefore children must seek other avenues as not everyone can excel at academics and tennis like he has.
In the summer of 1996 Mr. Lake decided to give back to his fellow countrymen by dedicating three weeks of the Summer to provide a free summer tennis camp for children on the island who possessed an interest in tennis. Since the ATA's inception, the program has grown into what it is today. Although his dream was to give back to the community, the overwhelming support he received made him realize that the facilities were inadequate on the island. Therefore, he set his goals high and with much help from his country and members of the international community, the state of the art tennis facility was constructed. Mitchelle plans to keep the program as a
non-profit organization with all proceeds being donated to the Anguillian children.
Mr. Lake is truly an exceptional human being whose relentless devotion to his country is doing much for Anguilla's youth. He has been quoted as saying, "My life is what it is today because of tennis and all I want to do now is give back so that other young people can have similar experiences like mine. The Anguilla Tennis Academy is my lifelong dream and I am proud of the children and other Anguillians for supporting me in this worthwhile endeavor. The cause is greater than the cost and for that reason this project must be done."


text:
So should you handle Mother's Day? Do you celebrate the mothers-to-be? To me this is an easy YES! Even for those women who have relatively easy pregnancies, pregnancy is certainly not a walk in the park. From being extremely tired, uncomfortable, and having to make many lifestyle changes and sacrifices for your unborn child to the frequent bathroom trips it's not always fun!
So, if a woman is pregnant over Mother's Day, you can be sure that she will have no objection to being honored on this special day. But what does one gift a mom-to-be? How should you go about making her feel special? Of course it depends on how far along the pregnancy she might be, but these ideas are sure to fit one of those stages.
BODY PILLOW If the mom-to-be isn't having trouble getting comfortable while sleeping yet, don't worry…it is more than likely coming, and this will still be a good investment. This will help mom sleep comfortably and get the much deserved rest she and baby need. Plus she can use it beyond pregnancy!
PERSONALIZED JEWELRY Pregnant or not, jewelry is always a safe gift option for a woman. If she is far enough along in her pregnancy and you know the gender and a name has been decided upon, you can get a necklace with the baby's name on it. Many places allow you to take the piece of jewelry back in later and get the baby's birth date and/or birthstone put on it. If it's early on in the pregnancy you can get a piece of jewelry simply with the word Mom on it. Trust me, especially in the beginning, it the best feeling in the world to be referred to as Mom.
Read related: 5 Perfect Gifts for Mom
PRENATAL MASSAGE Give the special mom to-be a gift certificate for a prenatal massage. If you are really planning ahead, schedule one for her on Mother's Day and surprise her. You would be hard pressed to find a mama-to-be who would turn down an offer to get her aching body massaged. You could also sign her up to prenatal belly-dancing classes, which could be a massage for the baby!BREAKFAST IN BED Allow the mom to-be to sleep in on Mother's Day. When she awakes have breakfast in bed ready for her. If she's in the first trimester, the meal may only consist of saltines and ginger ale, but I assure you she will still appreciate the gesture!
1 2


text:
Smith's quest for meaning starts as an inner void created in part by incidents that felt to her like abandonments. She and her parents didn't understand each other. When she was a girl, her closest childhood bond was broken when her grandmother moved to the other side of Oregon. Later in life, her husband left. Do all spiritual journeys start with an element of loneliness, a yearning to feel connected?
- Smith had been teaching Anne Sexton's poem "Live" to a college English class days before the poet killed herself. Smith writes, "Had I, like her, felt that a husband, children, success, and friends were not enough? Did we both have a void in us that the world could not fill?" Do you look to the works of other writers for mirrors and guideposts in your life journey? Elaborate.
- Enlightenment can come slowly, insight by insight, as we let go our grip on deeply held beliefs. When Smith saw the Indian saint Satya Sai Baba produce ash out of thin air, she realized the physical world did not have to follow the rules of science. That shift opened her mind in a new way. What experience prompted you to feel a shift in your perceptions of yourself and the world?
- Disappointment is a part of all life paths. Smith experiences just that when she spends time with one Indian guru and sees that, rather than living a life of renunciation, he actually has great wealth. She can't reconcile the contradiction. Can you recall a disappointment on your spiritual path? Was it as important a part of your growth as when you encountered goodness, joy, or wisdom?
- Growing up among adults with affinities for different religious and spiritual traditions—from evangelical conversions to Edgar Cayce's psychic healings—left Smith with so wide a berth of options that she felt almost homeless in a spiritual sense. What role did your upbringing play in your spiritual development?
- Smith's journey toward wholeness includes wanting a relationship with a man, which she eventually finds in Charlie. To what extent do your spiritual proclivities impact your choice of love partner? Is it possible for two people with greatly different views of the divine and the cosmos to endure as lovers?
- Some spiritual communities require their members to conform. Smith encountered this in Christian Science, which would not allow her to swim laps or seek medical aid to help her ailing back. To what extent should a spiritual community allow its members to make their own decisions without interference?
- During her time with A Course in Miracles, Smith learns that so-called "special relationships" with people, food, alcohol, work, shopping, or some other obsession are a substitute for a real relationship with God. They are a way of keeping the ego satisfied while the spirit continues to languish. Have you experienced this phenomenon in your life?
- Smith entered the worlds of many different spiritual thought and belief systems in her life. Do they all really lead to the same place? Or does the particular road a person takes matter a lot?
- One day, while staying at Yoga Niketan in India and quietly reading a book about the South Indian saint Ramana Maharshi, Smith feels a moment of complete bliss that spreads from her heart through her whole body. And it holds for a long time. Are there times when enlightenment seeks us instead of us seeking it? If so, does it come only to those who have devoted time and energy in its pursuit?
- When will you know you have achieved spiritual success in your own life? When the urge to seek subsides and fades away? When you are happy?
Home » Discussion Questions


text:
You'll find that I use named ranges rather than cell references pretty much throughout. This is because I want to separate the usage of some of these functions from where the data is. I'm not saying that you have to use named ranges all the time, but I hope you'll see the value of creating them for data that may change or be referred to from multiple places. In any case, working through the examples should give you enough familiarity to make the right choices.
Services > Desktop Liberation - the definitive resource for Google Apps Script and Microsoft Office automation >


text:
BBQ With Veal Tomato
Played 1727 times
BBQ With Veal Tomato game information:
A delicious and light barbecue dish for a summers day. Play our cooking game and devour our BBQ Veal with Tomato recipe.
How to play:
This game is played with the mouse only
Add this game to your website or blog!
Popular Tags
Latest Games
- New Vampire Room Escape
- Finding Interior Designer Bag
- Army Trucks Hidden Letters
- Forgotten Academy Award Escape
- Knf Santa Claus Christmas Gift Escape
- Help The Santa
- Santa Double Adventure
- Liberation Of Santa
- Recover The Gift
- Memory Loss Santa
- Xmas Pass Over
- Perfect Winter Trendy
- Santa Arctic Adventure
- Knf Winter Wooden House Escape
- Santa Way 3
- Bart Shootout
- The Hulk Differences
- Princess doll house 2
- American Trucks Memory
- Sailor Ship Escape
- Defend Kindom Wars
- Deadpool Jigsaw
- Offroad Race Truck
- House Cleaning
- Kings Castle 20
- BMW F32 Jigsaw
- Art Gallery Escape
- Fairy Beauty Salon
- Daredevil Jigsaw
- Semi Truck Jigsaw


text:
Video: Designer Espen Øino discusses Galactica Super Nova
by Chris Jefferies
One of the most talked about yachts at Monaco Yacht Show 2016, Galactica Super Nova cut an impressive figure, dominating Port Hercules' Quai Ranier I.
During the show, Boat International caught up with the legendary yacht designer and naval architect Espen Øino who created the exterior of the 70 metre Heesen Yachts flagship. In this video, he explains his favourite features of Galactica Super Nova:
The design of Galactica Super Nova was very much informed by the owner's desire to cruise quickly, with a 30-knot minimum speed specified as a key requirement.
"The speed is unique," Øino said. "You don't see boats of this size going this fast, and that is a tremendous asset if you can afford it, to be able to reposition the boat overnight, go to completely new areas and cover much more ground in a short period of time."
The designer also picked out the top deck as one of his favourite areas, and the owner clearly agrees, as we are told that this is the most used space on board. Øino designed grey mullions for this deck, which make the yacht appear one deck lower than it actually is.
The spectacular beach club is another key feature on board Galactica Super Nova, with twin strips of glazing allowing light to filter through the main deck swimming pool into the area below.
Following her successful debut at the Monaco Yacht Show, Galactica Super Nova will now head to Florida where she will be one of the must-see new yachts at the 2016 Fort Lauderdale International Boat Show.


text:
*daily rates in Tel Aviv based on a 1 day rental (24hr period) and for guidance purposes only.
Hello, our reservation for Tel Aviv juct came through but it's not the car we booked, can you advise please?
Hello, thanks for getting in touch. All of our cars are booked on an 'or similar' basis. This means that we will supply a car of equal or higher specification / capacity to that shown on the quote stage. As we work with a number of rental agents who have complex fleet arrangements we are unable to say 100% the make and model we display will be supplied. However we do guarnatee that it'll be at least the same specification or higher, of course at no additional cost.
Driving in Tel Aviv - Need to know
Road Driving Side
Urban speed Limit
Rural Speed Limit
Motorway Speed Limit
Current Petrol Price
Drink Drive Limit
Min Rental Age
Min Driving Age
Next Upcoming Holiday
Monday 10 Feb 2020
Tu Bishvat - Observance, Hebrew
We specialise in car rentals throughout Israel fo find you the best price and that's a promise...
+44 (0)845 508 9845
Read our Frequently Asked Questions
We welcome and actively invite all of our customers to review us on independent review platforms, see what they have to say...
What our customers say


text: I record a room that has a lot of dead air without audio, and want to be able to edit out the non-audio portions. Is there a way to pan back in the player to more easily find where audio starts up? Or to jump to when there is audio? Thanks.


text:
Monday, November 09, 2009
Fave Four
With the way the games shook out yesterday, I simply had no choice but to drop a Barkley/T-Mobile reference in the title. It wasn't a "Fave Five", though, as 4 of the 6 games saw the favorite cover, and Sacramento, one of the dogs that covered, probably should have been a favorite to begin with. Oklahoma City was the one true dog that won yesterday, in a day that saw the public prevail in two lopsided betting contests.
In the morning affair, Phoenix manhandled Washington to the delight of the betting Joe Q's, then the Lakers handled theirs in the night game, once again lining the pockets of the average man. It stings, because I thought yesterday had 3-0 written all over it when I saw those games. Instead, Washington and New Orleans BOTH shot under 40% from the field (Washington doing so against the Phoenix Suns, who play as much defense as a drunk stripper), and we got extremely unlucky once again.
Still, this is a GRIND, which means sticking with it is the real lesson here. Looking back, I would have made the same plays, and a couple weeks from now, I bet they both win. Last night, though, they were stinkers, and we concluded an extremely unlucky week with a 1-2 night.
Sports Wagering
Sixers/Suns - Phoenix is on the second night of a back-to-back, again, and we're seeing an early morning pick on this one with a total of 214. Once again, the line on Phoenix is either showing a lack of respect, or oddsmakers are trying to set another trap for the public. The Sixers can't guard anything right now, and are coming home after getting trounced in an afternoon game in Detroit yesterday. Phoenix actually had the easier travel schedule, though they have been on the road for a while, and you wonder if it might start to take its toll. Let's keep an eye on how this line moves, since you KNOW the public will hop right back on the Suns, and if this line stays anywhere between the current mark (a pick), and Phoenix by 1.5, I'd say it's safe to say it's a trap line. We cannot be deterred by yesterday's Phoenix triumph that killed the books. Oddsmakers always have a reason behind setting a line where they do, and they feel like they can take some money from Suns fans on the road right now. The total of 214 is pretty low for a battle of two teams that like to run. We have seen some lower-scoring Suns games this year, and maybe...just maybe...they might be pondering a little defense. Time will tell.
Knicks/Jazz - This is another game that has the public in an uproar -- the Knicks are getting 4 points at home to the Jazz with a total of 210. The first thing that jumps out at me is how both of these teams like to run a quick offense. The second thing, though, is that the Knicks haven't been able to shoot the ball all season, and have looked like the worst team in the NBA more often than not. The Jazz have problems of their own, this year, and the source isn't quite clear. They haven't really been playing defense, and as a result, got beat on their home court by the Sacramento Kings. I have a strong lean to the Over at 210, since we really only need both teams to shoot the ball "okay" to clear 100 points at the pace, which should be pretty quick. In terms of the side, I get the feeling that most people will look at this one and remember the Jazz teams of the recent past that defended and played gritty basketball, but they're not the same this year. I don't know if Carlos Boozer is neglecting defense so he can keep his trade value high, but Jerry Sloan cannot be happy with his team's effort so far. This side looks frightening, but the sharps are due, so I'd offer a slight lean to the Knicks.
Spurs/Raptors - Spurs by 6.5 at home with a total of 202. The Raptors got spanked by the Mavericks in their last game, but it's tough to put all of that on Toronto -- Dallas shot a remarkable 63% for the GAME, and when your opponent pulls off that kind of stunt, it's just not your day. Expect Toronto to play a better game tonight, and not lose by almost 30 points. The Spurs, like the Jazz, have some issues, but they do generally start a little slowly, with some old legs needing a month to get into the swing of things. Duncan is Duncan, but Tony Parker has been hurt this year, and Manu is still trying to get his legs back. New additions are learning the defensive schemes, and in the meantime, the Spurs are playing some of their worst defense this decade. They've shot the ball much, much better at home, however, which makes me think the Over 202 is the best bet available in this game. The Raptors won't be terrible two nights in a row with all of their talent, so I think the 6.5 points is a pretty fair spread, but with Toronto's fast pace, and the Spurs defensive issues, this total will be 207.
Warriors/Wolves - Warriors are getting 7 points at home to the Timberwolves with a total of 211. This line looks way, way too high for a Warriors team that has been blown out in two consecutive games. They are a common disaster, and it's extremely difficult to see them opening up a huge lead on anyone right now. Of course, this line is going to lend itself to some money on the Wolves, and it affords us a nice opportunity to see how this line moves about. It feels exceptionally high, and we need to be careful not to get sucked into the "other" kind of trap line. These teams are both pretty bad, so it's not as though Minnesota is a lock to keep any game close. The total of 211 would befit the Warriors running style, and I have to believe we'll see a mark pretty close to this one. Minnesota's defense isn't anything to write home about, though they will try to slow things down just to disrupt the offense. The Warriors are discouraged, and Stephen Jackson is still in a Golden State uniform, so Minnesota might have some success in that regard. Slight early leans to Minny with the points and the Under, but these will likely change over the course of the day.
Clippers/Hornets - The Clippers have won THREE STRAIGHT! If the presses have been adequately stopped, we can take a look at this line. Clippers are laying a point at home to the, achem, sucktacular Hornets. New Orleans has done zip to impress me, and after blowing a chance to show some moxie last night and getting blown out by the Lakers, they have to come right back to the scene of the crime tonight for another game at Staples with a different logo at center-court. Early indications are that the Hornets are going to garner a good portion of the money, as early-season struggles don't seem to outweigh decades of Clippers futility in the bettors' minds. My first thought when I saw this was that we're getting a DEAL with the Clippers. The other LA team is playing with confidence right now, and while they've been beating up on the dregs of the Western Conference, the Hornets are a sad, depressed bunch, not making shots, not rebounding well, and not helping their floor leader at all. If they can't get up to play the Lakers, what makes anyone think they can get up to play the Clippers? The total of 197 is too high. The Hornets are shooting the ball terribly, and the Clippers play a slower game, relying on Marcus Camby at the high post and Baron Davis to create shots for their teammates. I cap this total at 190. Leans on this one to Clippers and the Under.
Fantasy Advice
Ben Wallace - Big Ben had 16 boards, 3 steals and 3 blocks in a dominant performance, and being a Piston has definitely jostled Wallace awake. He has, though, been good ONLY AT HOME. Look at the games, and if you want to play him on your fantasy team, play him in games at the Palace at Auburn Hills.
Within this Article: Basketball, Wallace
No comments:
Subscribe to: Post Comments (Atom)


text:
The Totally Tamron Website Is Back! Visit Today For All Things Tamron
A quick view of rshanthini's recent activity.
No topics found.
No topics found.
thank you
- Posted on rajasekar's profile
- 15 Jan 2013 9:42AM
Out of the ordinary - excellent series. Gt something to learn from. Thanks for your comments on my photo on a "butterfly to be".
- Posted on CarolG's profile
- 21 Dec 2010 10:13AM
You are a photo genius. And the frames are just excellent. I like all your photos. I am contemplating over getting a D90 for a while. After seeing your showcase, i have made up my mind to buy it. I hope I may get some pictures half as creative as yours. Specially the missing frame is mind boggling. How could you think so unconventionally? Thanks for posting and educating me on photography.
- Posted on prabhusinha's profile
- 24 Jun 2010 7:32AM
I have been trying to photograph butterflies. It is very educational to visit your portfolio. What amazing shots of butterflies and everyday life. Head reeling to look at them.
- Posted on celestun's profile
- 31 May 2010 8:25PM


text:
The meanings of 'TDMI-S', 'JZF-S' and 'T2F-S'
Article ID: 103488165
Published date: 13 Feb 2018
Last updated: -
Applies to: Classic
What do 'TDMI-S', 'JZF-S' and 'T2F-S' stand for?
The ARM7 through ARM11 family processor names carry a variety of suffixes such as those shown in the question.
T : supports both ARM (32-bit) and Thumb (16-bit) instruction sets
An instruction set is a list of binary patterns, or 'opcodes', that represent the different logical operations a processor can perform. Software programs can be written at different levels of abstraction, from low level 'assembly code' where each written instruction typically maps onto one corresponding opcode, up to high-level languages where the written program (source code) needs to be processed by a compiler, which typically converts each written instruction into a whole sequence of opcodes.
ARM processors support one or more instruction sets.
The original ARM instruction set consists of 32-bit opcodes. Therefore, the binary pattern for each possible operation is four bytes long.
To improve code density, a new, smaller instruction set called 'Thumb' was developed, implementing the more commonly used parts of the ARM instruction set but encoding these in a 16-bit or 2-byte pattern (or occasionally, a pair of such opcodes).
ARM7TDMI-S supports both ARM and Thumb instruction sets, with a defined mechanism for switching between instruction sets at natural program boundaries. This instruction set architecture is called ARMv4T.
Newer ARM processors support enhanced and extended versions of one or both of these instruction sets in ARMv5, ARMv6, and ARMv7 architectures, or may support a new 32-bit instruction set for a 64-bit datapath architecture in ARMv8, either instead of or alongside ARM- and Thumb-compatible instruction sets.
D : Contains Debug extensions
The debug extensions provide the mechanism by which normal operation of the processor can be suspended for debug, including the input signal ports to trigger this behavior. For example, this could be a signal to allow a breakpoint to be indicated and a signal to allow an external debug request to be indicated.
M : Enhanced (relative to earlier ARM cores) 32x8 Multiplier block
Earlier ARM processors (before ARM7TDMI) used a smaller, simpler multiplier block that required more clock cycles to complete a multiplication. The introduction of this more complex 32x8 multiplier reduced the number of cycles required for a multiplication of two registers (32-bit * 32-bit) to a few cycles (data dependent). Modern ARM processors are generally capable of calculating at least a 32-bit product in a single cycle, although some of the smallest Cortex-M processors provide an implementation choice of a faster (single-cycle) or a smaller (32 cycle) 32-bit multiplier block.
I : EmbeddedICE macrocell
The EmbeddedICE macrocell consists of on-chip logic to support debug operations. In the ARM7TDMI-S processor, this includes two instruction breakpoint and data watchpoint comparators, an Abort status register, and a debug communications channel to pass data between the target and the host. The EmbeddedICE interacts with the debug extensions, for example to signal a halt to the processor when a breakpoint is met.
-S : synthesizable (that is, distributed as RTL rather than a hardened layout)
ARM7TDMI (without the "-S" extension) was initially designed as a hard macro, meaning that the physical design at the transistor layout level was done by ARM, and licensees took this fixed physical block and placed it into their chip designs. This was the prevalent design methodology at the time. Subsequently, demand increased for a more flexible and configurable solution, so ARM moved towards delivering processor designs as a behavioral description at the 'register transfer level' (RTL) written in a hardware description language (HDL), typically Verilog HDL. The process of converting this behavioral description into a physical network of logic gates is called 'synthesis', and several major EDA companies sell automated synthesis tools for this purpose. A processor design distributed to licensees as an RTL description (such as ARM7TDMI-S) is therefore described as 'synthesizable'.
Processor designs newer than the ARM9TDMI generally provide basic or upgraded versions of all the features represented by this suffix, but the suffix itself was dropped from the names so that these features are implied rather than explicit in the naming scheme. This allowed more distinctive features to be represented in the suffixes of ARM11 processor names without the name suffixes becoming too cumbersome.
E: Enhanced DSP instruction set support
Supports an extended set of DSP-related functions, such as saturating arithmetic and Single Instruction Multiple Data (SIMD) vector-style instructions, for example adding two 32-bit registers as four parallel 8-bit additions rather than a single 32-bit addition.
J : Java bytecode execution support
Native execution of some Java bytecodes without requiring translation into the ARM or Thumb instruction sets.
F : Hardware floating-point support
The processor includes an extended instruction set to process floating-point arithmetic.
T2 : Supports the Thumb-2 technology extension
Extends the original Thumb instruction set by adding more double-opcode instructions, to enable a complete system to be implemented using only Thumb instruction mode.
Z : TrustZone
Supports ARM TrustZone software security implemented in the processor hardware. This is based on separating memory and resources into Secure and Non-secure worlds, and providing a tightly controlled procedure for transitioning between the Non-secure and Secure security states.
Subsequent to the ARM11 family, this entire naming scheme was retired and replaced with the three profiles ( A - Application, R - Real-time and M - Microcontroller ) of the 'Cortex' processor family.
Related information


text:
Monday, July 9, 2012
15 comments:
I think I love your job too. ;)ReplyDelete
WOW. Those look good. I wish I lived closer/that cake was an easier thing to mail.ReplyDelete
And the finishes/new starts pic looks pretty delicious too.
And I am seriously impressed by the organization of your threads.
So glad to know that I'm not the only one who loves your job...those look fabulous!ReplyDelete
Your macaron are gorgeous! I made them on the long weekend with a friend and they were a total disaster. Cracks everywhere! I've never had that happen, but I think it was the rain and the fact that the eggs were really fresh. What method do you use? I've always used Italian meringue but I've seen recipes that use French. And one more question - do you have a good white chocolate ganache? Most Pierre Herme recipes use valrhona's white chocolate, which I can't afford or get easily here. It's way thicker melted than Lindt or callebaut so his recipes don't sub well. Oh man, babbling pastry geek here!ReplyDelete
oh I want to learn to make macarons!! LOVE them!ReplyDelete
Did you go to Seattle Yarn? :) I need to go buy some perle cotton soon.ReplyDelete
P.S. I am in awe of your baking wonders! I'm not sure I could manage making a macaron, but I can definitely eat one. ;)
Oh, everything is gorgeous, but those macarons, wow! I love to bake and got a book on macarons for christmas but still haven't taken the plunge. I've always wondered about your pastry chef description in your bio, so glad you finally addressed it!ReplyDelete
these pretty cookies are part of your job?! you are one lucky girl!!! sorting is always so satisfying isn't it?ReplyDelete
Looks like some fun projects - I love all the new floss soooo fun to organize!ReplyDelete
Those macaroons are so beautiful! Hope you had a fun camping trip - we just got back from one of our own yesterday :)ReplyDelete
i used to have an insane collection of embroidery floss, all sorted and labeled and awesome. for friendship bracelets, back in elementary school! i should really try and find it, i'm sure it's in a box at my parents' house someplace.ReplyDelete
anyways... loving yours! have fun sorting :D
Wow that is a lot of floss! you must have bought enough to last you a year surely?ReplyDelete
Looks like some interesting projects there. I'll be watching out for updates.
Those macaroons look yummy!! =D
Ooh, look at that cute little pile of floss (yes, my collection might be fairly large, but cross stitch used to be my main hobby).ReplyDelete
I love your job too. I love baking, do a lot of it and make all my work mates eat it. I can't tell you how many times I've been told I should do it for my job. Tempting. But retraining.... (I have no delusions that I wouldn't need the full training). So I'll stick to it as a hobby. But good to know someone to come to for tips :)
I've never had macaroons!! Is that a tragedy?! Should you send me a recipe ;)ReplyDelete
They look delicious!
The projects look great too and nice thread organising! x
those macaroons look fantastic and like Lucy have never had them!!! how sad! just wanted to say thanks for you tutorial on hand piecing the petals for the retro flower qal thingy. I do a lot of english paper piecing and sometimes my machine and I don't agree with curved piecing so last night I tried out your instructions and got on great. I will machine piece the petals together but the curves turned out great by hand! awesome xReplyDelete


text:
The state and income redistribution: a study of the social wage and taxation in New Zealand 1949-1975
Permanent Linkhttp://hdl.handle.net/10092/10351
Degree GrantorUniversity of Canterbury
Degree LevelMasters
Degree NameMaster of Arts
This thesis examines the role of the state in redistributing income between social classes in New Zealand during the years 1949-1975. It applies an innovative methodology, developed by E. Ahmet Tonak, to a set of data drawn from New Zealand's national accounts and estimates a quantity labelled 'net-tax', defined as the taxes that the working class cede to the state less the expenditure that the working class receives from the state in the form of a social wage. A detailed theoretical discussion precedes the empirical analysis. Insofar as Tonak's method requires that the social wage (the portion of state expenditure consumed by the working class) be identified as an empirical quantity, the argument that all taxes, and hence all state expenditures, originate from surplus value is confronted. The views of the main representatives of this contemporary school of thought are subjected to detailed scrutiny. They are rejected in favour of the views of a school which considers the portion of taxes funding the state expenditure that constitutes the social wage to originate in 'wages'. A model which theoretically 'grounds' the comparison of taxes paid to state expenditure received, effected in the remaining chapters of this study, is then formulated. In the empirical analysis, the empirical referent of the 'net-tax' concept is calculated for the years 1949-1975. The net-tax data set is then used to construct a transference ratio, which indicates the degree and direction of income redistribution effected by the state. The main finding to emerge is that, in all but one of the twenty-seven years surveyed in this study, the working class has surrendered more wealth in taxes to the state than it has received back from the state as a social wage. In light of these results, it can be concluded that the welfare state has not materially benefitted the working class in New Zealand. Moreover, insofar as income has consistently been redistributed from the working class to 'non-labour' (the capitalist class and the state itself), the state can be considered to owe the working class a debt in the amount of 3671.26 million (constant 1975) dollars.