by Angel Suet Yi Tse. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1996. / Includes bibliographical references (leaves 126-130). / Abstract / Acknowledgements / Table of Contents / List of Tables / List of Figures / Plagiarism Declaration / Chapter Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Overview --- p.1 / Chapter 1.2 --- Motivation --- p.2 / Chapter 1.3 --- Applications of NP parsing --- p.4 / Chapter 1.4 --- The Hybrid Approach of NP Partial Parsing with Rule Set Derived from de NPs --- p.5 / Chapter 1.5 --- Organization of the Thesis --- p.7 / Chapter Chapter 2 --- Related Work --- p.9 / Chapter 2.1 --- Overview --- p.9 / Chapter 2.2 --- Chinese Versus English Languages --- p.10 / Chapter 2.3 --- Traditional Versus Contemporary Parsing Approaches --- p.15 / Chapter 2.3.1 --- Linguistics-based and Corpus-based Knowledge Acquisition --- p.15 / Chapter 2.3.2 --- Basic Processing Unit --- p.16 / Chapter 2.3.3 --- Related Literature --- p.17 / Chapter 2.4 --- Sentence / Free Text Parsing --- p.18 / Chapter 2.4.1 --- Linguistics-based --- p.18 / Chapter 2.4.2 --- Corpus-based --- p.21 / Chapter 2.5 --- NP Processing --- p.22 / Chapter 2.5.1 --- NP Detection --- p.22 / Chapter 2.5.2 --- NP Partial Parsing --- p.26 / Chapter 2.6 --- Summary --- p.27 / Chapter Chapter 3 --- Knowledge Elicitation for General NP Partial Parsing from De NPs --- p.28 / Chapter 3.1 --- Overview --- p.28 / Chapter 3.2 --- Background --- p.29 / Chapter 3.3 --- Research in De Phrases --- p.33 / Chapter 3.3.1 --- Research of de Phrases in Pure Linguistics --- p.33 / Chapter 3.3.2 --- Research in de Phrases in Computational Linguistics --- p.36 / Chapter 3.4 --- Significance of De Phrases --- p.37 / Chapter 3.4.1 --- Implication to General NP Parsing --- p.37 / Chapter 3.4.2 --- Embedded Knowledge for General NP Parsing --- p.37 / Chapter 3.5 --- Summary --- p.39 / Chapter Chapter 4 --- Knowledge Acquisition Approaches for General NP Partial Parsing --- p.40 / Chapter 4.1 --- Overview --- p.40 / Chapter 4.2 --- Linguistic-based Approach --- p.41 / Chapter 4.3 --- Corpus-based Approach --- p.43 / Chapter 4.3.1 --- Generalization of NP Grammatical Patterns --- p.44 / Chapter 4.3.2 --- Pitfall of Generalization --- p.47 / Chapter 4.4 --- The Hybrid Approach --- p.47 / Chapter 4.4.1 --- Combining Strategies --- p.50 / Chapter 4.4.2 --- Merging Techniques --- p.53 / Chapter 4.5 --- CNP3- The Chinese NP Partial Parser --- p.55 / Chapter 4.5.1 --- The NP Detection and Extraction Unit (DEU) --- p.56 / Chapter 4.5.2 --- The Knowledge Acquisition Unit (KAU) --- p.56 / Chapter 4.5.3 --- The Parsing Unit (PU) --- p.57 / Chapter 4.5.4 --- Internal Representation of Chinese NPs and Grammar Rules --- p.57 / Chapter 4.6 --- Summary --- p.58 / Chapter Chapter 5 --- "Experiments on Linguistics-, Corpus-based and the Hybrid Approaches" --- p.60 / Chapter 5.1 --- Overview --- p.60 / Chapter 5.2 --- Objective of Experiments --- p.61 / Chapter 5.3 --- Experimental Setup --- p.62 / Chapter 5.3.1 --- The Corpora --- p.62 / Chapter 5.3.2 --- The Standard and Extended Tag Sets --- p.64 / Chapter 5.4 --- Overview of Experiments --- p.67 / Chapter 5.5 --- Evaluation of Linguistic De NP Rules (Experiment 1 A) --- p.70 / Chapter 5.5.1 --- Method --- p.71 / Chapter 5.5.2 --- Results --- p.72 / Chapter 5.5.3 --- Analysis --- p.72 / Chapter 5.6 --- Evaluation of Corpus-based Approach (Experiment IB) --- p.74 / Chapter 5.6.1 --- Method --- p.74 / Chapter 5.6.2 --- Results --- p.75 / Chapter 5.6.3 --- Analysis --- p.76 / Chapter 5.6.4 --- Generalization of NP Grammatical Patterns (Experiment 1B'） --- p.76 / Chapter 5.6.5 --- Results after Merging of Rule Sets (Experiment 1C) --- p.77 / Chapter 5.6.6 --- Error Analysis --- p.79 / Chapter 5.7 --- Phase II Evaluation: Test on General NP Parsing (Experiment 2) --- p.82 / Chapter 5.7.1 --- Method --- p.83 / Chapter 5.7.2 --- Results --- p.85 / Chapter 5.7.3 --- Error Analysis --- p.86 / Chapter 5.8 --- Summary --- p.92 / Chapter Chapter 6 --- Reliability Evaluation of the Hybrid Approach --- p.94 / Chapter 6.1 --- Overview --- p.94 / Chapter 6.2 --- Objective --- p.95 / Chapter 6.3 --- The Training and Test Corpora --- p.96 / Chapter 6.4 --- The Knowledge Base --- p.98 / Chapter 6.5 --- Convergence Sequence Tests --- p.99 / Chapter 6.5.1 --- Results of Close Convergence Tests --- p.100 / Chapter 6.5.2 --- Results of Open Convergence Tests --- p.104 / Chapter 6.5.3 --- Conclusions with Convergence Tests --- p.106 / Chapter 6.6 --- Cross Evaluation Tests --- p.106 / Chapter 6.6.1 --- Results --- p.109 / Chapter 6.6.2 --- Conclusions with Cross Evaluation Tests --- p.112 / Chapter 6.7 --- Summary --- p.113 / Chapter Chapter 7 --- Discussion and Conclusions --- p.115 / Chapter 7.1 --- Overview --- p.115 / Chapter 7.2 --- Difficulties Encountered --- p.116 / Chapter 7.2.1 --- Lack of Standard in Part-of-speech Categorization in Chinese Language --- p.116 / Chapter 7.2.2 --- Under or Over-specification of Tag Class in Tag Set --- p.118 / Chapter 7.2.3 --- Difficulty in Nominal Compound NP Analysis --- p.119 / Chapter 7.3 --- Conclusions --- p.120 / Chapter 7.4 --- Future Work --- p.122 / Chapter 7.4.1 --- Full Automation of NP Pattern Generalization --- p.122 / Chapter 7.4.2 --- Incorporation of Semantic Constraints --- p.123 / Chapter 7.4.3 --- Computational Structural Analysis of Nominal Compound NP --- p.124 / References --- p.126 / Appendix A The Extended Tag Set --- p.131 / Appendix B Linguistic Grammar Rules --- p.135 / Appendix C Generalized Grammar Rules --- p.138

<p>Portable stream programming language (PSPL) is a language for baseband application</p><p>programming on reconfigurable architectures. The first step in its development has been</p><p>completed. A parser has been provided for the front end of the PSPL compiler. The syntax</p><p>of the language has been fixed to allow for easy parses. The scanner and the parser</p><p>where generated using automatic tools (scanner and parser generators) which rely on</p><p>complex mathematical algorithms for their generation. Abstract syntax (data structures</p><p>that preserve the source program so that program structure is evident) was implemented</p><p>for the parser using a syntax separate from interpretation style of programming. Tests were</p><p>carried out to ensure that the correct data structures were generated. The final outcome</p><p>is a parser that other phases of the compiler can depend on for onward transmission of</p><p>the source program in an unambiguous manner. The development of subsequent phases</p><p>of the compiler will form the next logical step in the processes of transforming PSPL to</p><p>a stand alone language.</p>

This article summarizes and extends recent results linking deterministic parsing to observed "locality principles" in syntax. It also argues that grammatical theories based on explicit phrase structure rules are unlikely to provide comparable explanations of why natural languages are built the way they are.

This paper outlines a three-step plan for generating English text from any semantic representation by applying a set of syntactic transformations to a collection of kernel sentences. The paper focuses on describing a program which realizes the third step of this plan. Step One separates the given representation into groups and generates from each group a set of kernel sentences. Step Two must decide based upon both syntactic and thematic considerations, the set of transformations that should be performed upon each set of kernels. The output of the first two steps provides the "TASK" for Step Three. Each element of the TASK corresponds to the generation of one English sentence, and in turn may be defined as a triple consisting of: (a) a list of kernel phrase markers; (b) a list of transformations to be performed upon the list of kernels; (c) a "syntactic separator" to separate or connect generated sentences. Step Three takes as input the results of Step One and Step Two. The program which implements Step three "reads" the TASK, executes the transformations indicated there, combines the altered kernels of each set into a sentence, performs a pronomialization process, and finally produces the appropriate English word string. This approach subdivides a hard problem into three more manageable and relatively independent pieces. It uses linguistically motivated theories at Step Two and Step Three. As implemented so far, Step Three is small and highly efficient. The system is flexible; all the transformations can be applied in any order. The system is general; it can be adapted easily to many domains.

No description available.

Portable stream programming language (PSPL) is a language for baseband application programming on reconfigurable architectures. The first step in its development has been completed. A parser has been provided for the front end of the PSPL compiler. The syntax of the language has been fixed to allow for easy parses. The scanner and the parser where generated using automatic tools (scanner and parser generators) which rely on complex mathematical algorithms for their generation. Abstract syntax (data structures that preserve the source program so that program structure is evident) was implemented for the parser using a syntax separate from interpretation style of programming. Tests were carried out to ensure that the correct data structures were generated. The final outcome is a parser that other phases of the compiler can depend on for onward transmission of the source program in an unambiguous manner. The development of subsequent phases of the compiler will form the next logical step in the processes of transforming PSPL to a stand alone language.

The Internet and web service have become the most popular platform and application of the Client-Server model due to the universality of the network recently years. Its growth is beyond the imagination, many traditional service have changed into web service stage by stage, and the load of the servers become more and more heavy. In the situation the server architecture must be adapted oppositely. The web cluster architecture that has the advantages of scalability, reliability and high performance requirement, is used extensively. In our lab developed and implemented a mechanism termed Content-aware Distributor, which is a software module for kernel-level extension, to effectively support content-based routing. Based on the achievement of the software-based Content-aware Distributor; we design and implementation a content management system for backend servers. The content management system provides a user friendly management console to allow a administrator to manage the whole cluster system. The content management system also monitors backend servers periodically, when server is awarded to be overloaded, the content management system will replicate popular content to other servers automatically. By this way cluster system can balance load of back end servers and increase system performance and throughput.

Thesis (Ph. D.)--University of California, San Diego, 2002. / Vita. Includes bibliographical references (leaves 136-144).

Thesis (Ph. D.)--University of Texas at Austin, 2002. / Vita. Includes bibliographical references. Available also from UMI Company.

Not available / text