4 Pages

P03-2035

Course: P 03, Fall 2009
School: UPenn
Rating:
 
 
 
 
 

Word Count: 2149

Document Preview

Compound Deverbal Noun Analysis Based on Lexical Conceptual Structure Teruo Koyama Koichi Takeuchi Kyo Kageura Human and Social Information Research Division National Institute of Informatics 2-1-2 Hitotsubashi, Chiyodaku, Tokyo 101-8430, Japan koichi,kyo,t koyama @nii.ac.jp Abstract This paper proposes a principled approach for analysis of semantic relations between constituents in compound nouns based on...

Register Now

Unformatted Document Excerpt

Coursehero >> Pennsylvania >> UPenn >> P 03

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
Compound Deverbal Noun Analysis Based on Lexical Conceptual Structure Teruo Koyama Koichi Takeuchi Kyo Kageura Human and Social Information Research Division National Institute of Informatics 2-1-2 Hitotsubashi, Chiyodaku, Tokyo 101-8430, Japan koichi,kyo,t koyama @nii.ac.jp Abstract This paper proposes a principled approach for analysis of semantic relations between constituents in compound nouns based on lexical semantic structure. One of the difculties of compound noun analysis is that the mechanisms governing the decision system of semantic relations and the representation method of semantic relations associated with lexical and contextual meaning are not obvious. The aim of our research is to clarify how lexical semantics contribute to the relations in compound nouns since such nouns are very productive and are supposed to be governed by systematic mechanisms. The results of applying our approach to the analysis of noun-deverbal compounds in Japanese and English show that lexical conceptual structure contributes to the restrictional rules in compounds. 1 Introduction The difculty of compound noun analysis is that the effective way of describing the semantic relations in compounds has not been identied. The description should not remain just a kind of categorization. Rather, it should take into account the construction of the analysis model. The previous work proposed semantic approaches based on semantic categories (Levi, 1978; Isabelle, 1984; Iida et al., 1984) had proposed detailed analysis of relations between constituents in compound nouns. Some of approaches (Fabre, 1996; Johnston and Busa, 1998) take the framework of Gen- erative Lexicon (GL) (Pustejovsky, 1995). Semantic approaches are especially well designed but they should still clarify the complete lexical factors needed for analysis model. Probabilistic approaches (Lauer, 1995; Lapata, 2002) have been proposed to disambiguate semantic relations between constituents in compounds. Their experimental results show a high performance, but only for shallow analysis of compounds using semantically tagged corpora. To be fully effective, they also need to incorporate factors that are effective in disambiguating semantic relations. It is therefore necessary to clarify what kinds of factors are related to the mechanisms that govern the relations in compounds. Against this background, we have carried out a research which aims at clarifying how lexical semantics contribute to, independently of languages, the relations in compound nouns. This paper proposes a principled approach for the analysis of semantic relations between constituents in compound nouns based on the theoretical framework of lexical conceptual structure (LCS), and shows that the framework originally developed on the basis of Japanese compound noun data works well for both Japanese and English compound nouns. 2 The Basic Framework 2.1 The Relation between Modier and Deverbal Head The relation between constituents in deverbal compounds 1 can rst be divided into two: (i) the modier becomes an internal argument (Grimshaw, 1990) and (ii) the modier functions as an adjunct. We as1 In the case of English the equivalent is nominalizations, but for simplicity we use deverbal compounds. sume these two kinds of relations are the target of our analysis model because argument/adjunct relations are basic but extensible to more detailed semantic relations by assuming more complex semantic system. Besides these relations related to argument structure of verbs are the boundary between syntax and semantics, then our approach must be extendable to be incorporated into sytactic analysis. 2.2 LCS-based Disambiguation Model We assume that the discrimination between argument and adjunct relations can be done by the combination of the LCS (we call TLCS) on the side of deverbal heads and the consistent categorization of modier nouns on the basis of their behavior vis-` a vis a few canonical TLCS types of deverbal heads. Figure 1 shows examples of disambiguating relations using TLCS for the deverbal heads sousa (operate) and honyaku (translate). In TLCSes, the words written in capital letters are semantics predicates, x denotes the external argument, and y and z denote the internal arguments (see Section 3). straightforwardly because they do not give extensive semantic predicates for LCS. Therefore we construct an original LCS, called TLCS, based on the LCS framework with a clear set of LCS types and basic predicates. We use the acronym TLCS to avoid the confusion with other LCS-based schemes. Table 1 shows the current complete set of TLCSes types we elaborated.2 The following list is for Japanese deverbals, but the same LCS types are applied for nominalizations in English. 3 Table 1: List of TLCS types 1 [x ACT ON y] enzan (calculate), sousa (operate) 2 [x CONTROL[BECOME [y BE AT z]]] kioku (memorize), honyaku (translate) 3 [x CONTROL[BECOME [y NOT BE AT z]]] shahei (shield), yokushi (deter) 4 [x CONTROL [y MOVE TO z]] densou (transmit), dempan (propagate) 5 [x=y CONTROL[BECOME [y BE AT z]]] kaifuku (recover), shuuryou (close) 6 [BECOME[y BE AT z]] houwa (become saturated) bumpu (be distributed) 7 [y MOVE TO z] idou (move), seni (transmit) 8 [x CONTROL[y BE AT z]] iji (maintain), hogo (protect) 9 [x CONTROL[BECOME[x BE WITH y]]] ninshiki (recognize), yosoku (predict) 10 [y BE AT z] sonzai (exist), ichi (locate) 11 [x ACT] kaigi (hold a meeting), gyouretsu (queue) 12 [x CONTROL[BECOME [ [FILLED]y BE AT z]]] shomei (sign-name) Figure 1: Disambiguation of relations between noun and deverbal head The approach we propose consists of three elements: categorization of deverbals and nominalizations, categorization of modier noun and restriction rules for identifying relations. 3 TLCS The number attached to each TLCS type in Table 1 will be used throughout the paper refer to specic TLCS types. In Table 1, the capital letters (such as ACT and BE) are semantic predicates, which are 11 types. x denotes an external argument and y and z denote an internal argument (see (Grimshaw, 1990)). 4 2 Basicaly these 12 types are set by the combination of argument structure and aspect analysis that is telic or atelic. After applying all the combination, we arrange the TLCS patterns by deleting patterns that does not appear and subcategorizing certain patterns. 3 At the moment, there are about 500 deverbals in Japanese and 40 nominalizations in English. 4 In this paper, we limit the types of arguments are three, i.e. x (Agent), y (Theme) and z (Goal). The framework of LCS (Hale and Keyser, 1990; Rappaport and Levin, 1988; Jackendoff, 1990; Kageyama, 1996) has shown that semantic decomposition based on the LCS framework can systematically explain the word formation as well as the syntax structure. However existing LCS frameworks cannot be applied to the analysis of compounds 4 Categorization of Modier Noun 5 Procedure of Compound Noun Analysis 4.1 Categorization by the Accusativity of Modiers In Japanese compounds, some of modiers can not take an accusative case. This is an adjectival stem and it does not appear with inections. Therefore, the modier is always the adjunct in the compounds. So we introduce the distinction -ACC of (unaccusative) and +ACC (accusative). ACC kimitsu (secrecy) and kioku (memory) are +ACC, and sougo (mutual-ity) and kinou (inductiv-e/ity) are -ACC. In English, they correspond to adjective modier such as -ent of recurrent or -al of serial. 4.2 Categorization by the Basic Components of TLCS If, as argued by some theoretical linguists, the LCS representation can contribute to explaining these phenomena related to the arguments and aspect structure consistently, and if the combination of LCS and noun categorization can explain properly these phenomena related to argumet/adjunct, then there should be a level of consistent noun categorization which matches the LCS on the side of deverbals. We used the predicates of some TLCS types to explore the noun categorizations. In the preliminary examination, we have found that some TLCS types can be formed into the groups that correspond to modier categories in Table 2. Below are examples of modier nouns categorized as negative or positive in terms of each of these TLCS groups. ON koshou (fault) and seinou (performance) are +ON, and heikou (parallel) and rensa (chain) are -ON. (ON stands for the predicate in ACT ON.) EC imi (semantic) and kairo (circuit) are +EC, and kikai (machine) and densou (transmission) are -EC. (EC stands for an External argument Controls an internal argument.) AL fuka (load) and jisoku (ux) are +AL, and kakusan (diffusion) and senkei (linearly) are -AL. (AL stands for alternation verbs.) UA jiki (magnetic) and joutai (state) are +UA, and junjo (order) and heikou (parallel) are -UA. (UA stands for UnAccusative verbs.) The noun categories introduced in Section 4 can be used for disambiguating the intra-term relations in deverbal compounds with various deverbal heads that take different TLCS types. The range of application of the noun categorizations with respect to TLCS groups is summarized in Table 2. The number in the TLCS column corresponds to the number given in Table 1. Step 1 If the modier has the category -ACC, then declare the relation as adjunct and terminate. If not, go to next. Step 2 If the TLCS of the deverbal head is 10, 11, or 12 in Table 1, then declare the relation as adjunct and terminate. If not, go to next. Step 3 The analyzer determines the relation from the interaction of lexical meanings between a deverbal head and a modier noun. In the case of -ON, -EC,-AL or -UA, declare the relation as adjunct and terminate. If not, go to next. Step 4 Declare the relation as internal argument and terminate. With these rules and categories of nouns, we can analyze the relations between words in compounds with deverbal heads. For example, when the modier kikai (machine) is categorized as -EC but +ON, the modier in kikai-honyaku (machine-translation) is analyzed as adjunct (that means translation by a machine), and the modier in kikai-sousa (machine-operation) is analyzed as internal argument (that means operation of a machine), both correctly. 6 Experiments and Evaluations We applied the method to 1223 two-constituent compound nouns with deverbal heads in Japanese. 809 of them are taken from a dictionary of technical terms (Aiso, 1993), and 414 from news articles in a newspaper. We also applied the method to 200 compound nouns of technical terms (Aiso, 1993) in English. They are extracted randomly. According to the manual evaluation of the experiment, 99.3% (1215/ 1223) of the results were correct in Japanese, and 97% (194/200) in English. The performance is very high. Table 2 shows the details of how the rules are applied to disambiguating the relations between constituents in the deverbal compounds. These results indicate that our set of LCS and categorization of modiers has the enough to disambiguate the relationships we assumed. Table 2: Combination of modiers and TLCS of deverbal heads,and statistics of the correct analysis role adjunct mod. cat. TLCS -ACC any any 10,11,12 -ON 1 -EC 2,3,4 -AL 5 -UA 6,7 total mod. cat. TLCS +ACC 8, 9 +ON 1 +EC 2,3,4 +AL 5 +UA 6,7 total Jap.(%) 263 (36.7) 88 (12.3) 95 (13.3) 186 (25.9) 26 (3.6) 59 (8.2) 717 Jap.(%) 74 (14.9) 89 (17.9) 249 (50.0) 57 (11.4) 29 (5.8) 498 Eng. (%) 84 (75.0) 4 (3.6) 10 (8.9) 14 (12.5) 0 (0.0) 0 (0.0) 112 Eng.(%) 15 (18.3) 19 (23.2) 43 (52.4) 3 (3.7) 2 (3.4) 82 ture we call it TLCS. The results of experiment for Japanese compounds and English compounds show our approach is highly promising, also the contribution of the lexical factor to disambiguation rule. References Hideo Aiso. 1993. Dictionary of Technical Terms of Information Processing (Compact edition). Ohmusha. (in Japanese). Cecile Fabre. 1996. Interpretation of Nominal Compounds: Combining Domain-Independent and Domain-Specic Information. In Proceedings of COLING-96, pages 364369. Jane Grimshaw. 1990. Argument Structure. MIT Press. Ken Hale and Samuel J. Keyser. 1990. A View from the Middle Lexicon (Lexicon Project Working Papers 10). MIT. Jin Iida, Kentaro Ogura, and Hirosato Nomura. 1984. Analysis of Semantic Relations and Processing for Compound Nouns in English. In Proceedings of Information Processing Society of Japan, SIG Notes,NL,464 (in Japanese), pages 18. Pierre Isabelle. 1984. Another Look at Nominal Compounds. In Proceedings of COLING-84, pages 509 516. Ray Jackendoff. 1990. Semantic Structures. MIT Press. Michael Johnston and Federica Busa. 1998. The Compositional Interpretation of Nominal Compounds. In E. Viegas, editor, Breadth and Depth of Semantics Lexicons. Kluwer. Taro Kageyama. 1996. Verb Semantics. Kurosio Publishers. (In Japanese). Maria Lapata. 2002. The Disambiguation of Nominalization. Association for Computational Liguistics, 28(3):357388. Mark Lauer. 1995. Designing Statistical Language Learners: Experiments on Noun Compounds. Ph.D. thesis, Department of Computing, Macquarie University. Judith N. Levi. 1978. The Syntax and Semantics of Complex Nominals. Academic Press. James Pustejovsky. 1995. The Generative Lexicon. MIT Press. Malka Rappaport and Beth Levin. 1988. What to do with -roles. In W. Wilkins, editor, Thematic Relations (Syntax and Semantics 21), pages 736. Academic Press. role int. argu. 7 Discussion Roughly speaking, our LCS-based approach can be available both Japanese and English deverbal nouns. Comparing with the results between Japanese compounds and English compounds, the factor -ACC looks effective to disambiguate relations. The reason is that the most of modiers indicate adjective function by adding sufxes in English. While in Japanese, adjectival nouns of modiers have no inecitons, then the semantic-based approach is needed for Japanese compound noun analysis. We found that a small number of modier nouns deviate from our assumptions. The most typical case is that our analysis model fails in a word with multiple semantics. For example, right justify is misunderstood as internal argument relation because of ambiguity of the word right which has both meanings of an adjective and a noun. We consider dealing with them as each different words like right adj, right noun in future work. 8 Conclusion This paper proposes a principled approach for analysis of semantic relations between constituents in compound nouns based on lexical conceptual struc-
Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

UPenn - D - 07
Large-Scale Named Entity Disambiguation Based on Wikipedia DataSilviu CucerzanMicrosoft Research One Microsoft Way, Redmond, WA 98052, USA silviu@microsoft.comAbstractThis paper presents a large-scale system for the recognition and semantic disa
UPenn - P - 01
A Syntax-based Statistical Translation ModelKenji Yamada and Kevin Knight Information Sciences Institute University of Southern California 4676 Admiralty Way, Suite 1001 Marina del Rey, CA 90292 kyamada,knight @isi.edu AbstractWe present a syntax-b
UPenn - C - 02
Semantics-based Representation for Multimodal Interpretation in Conversational SystemsJoyce ChaiIBM T. J. Watson Research Center 19 Skyline Drive Hawthorne, NY 10532, USA{jchai@us.ibm.com}Abstract To support context-based multimodal interpretati
UPenn - A - 92
A Simple Rule-Based Part of Speech TaggerEric Brill * D e p a r t m e n t of C o m p u t e r S c i e n c e University of Pennsylvania P h i l a d e l p h i a , P e n n s y l v a n i a 19104U.S.A.brill@unagi.cis.upenn.edu Abstract Automatic part o
UPenn - P - 05
A Hierarchical Phrase-Based Model for Statistical Machine TranslationDavid Chiang Institute for Advanced Computer Studies (UMIACS) University of Maryland, College Park, MD 20742, USA dchiang@umiacs.umd.eduAbstractWe present a statistical phrase-b
UPenn - P - 06
Investigations on Event-Based SummarizationMingli Wu Department of Computing The Hong Kong Polytechnic University Kowloon, Hong Kong csmlwu@comp.polyu.edu.hkAbstractWe investigate independent and relevant event-based extractive mutli-document su
UPenn - N - 06
Thai Grapheme-Based Speech RecognitionPaisarn Charoenpornsawat, Sanjika Hewavitharana, Tanja SchultzInteractive Systems Laboratories, School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 {paisarn, sanjika, tanja}@cs.cmu.eduA
UPenn - P - 01
An Algebra for Semantic Construction in Constraint-based GrammarsAnn Copestake Computer Laboratory University of Cambridge New Museums Site Pembroke St, Cambridge, UKaac@cl.cam.ac.ukAlex Lascarides Division of Informatics University of Edinburgh
UPenn - C - 02
Machine Translation Based on NLG from XML-DBYohei Seki Aoyama Gakuin / Department of Informatics, University The Graduate University for Advanced Studies (Sokendai) Abstract Ken'ichi Harada Department of Computing Science Keio UniversityThe purpos
UPenn - E - 06
Word Sense Induction: Triplet-Based Clustering and Automatic EvaluationStefan Bordag Natural Language Processing Department University of Leipzig Germany sbordag@informatik.uni-leipzig.deAbstractIn this paper a novel solution to automatic and uns
UPenn - P - 89
Unification-BasedSemantic InterpretationRobert C. Moore Artificial Intelligence Center SRI International Menlo Park, CA 94025 AbstractWe show how unification can be used to specify the semantic interpretation of natural-language expressions, inc
UPenn - N - 04
Feature-based Pronunciation Modeling for Speech RecognitionKaren Livescu and James Glass MIT Computer Science and Articial Intelligence Laboratory Cambridge, MA 02139, USA {klivescu, glass}@csail.mit.eduAbstractWe present an approach to pronuncia
UPenn - J - 92
Class-Based n-gram Models of Natural LanguageP e t e r F. B r o w n " P e t e r V. d e S o u z a * R o b e r t L. Mercer* IBM T. J. Watson Research Center V i n c e n t J. D e l l a Pietra* J e n i f e r C. Lai*We address the problem of predicting
UPenn - J - 95
Transformation-Based Error-Driven Learning and Natural Language Processing: A Case Study in Part-of-Speech TaggingEric Brill*The Johns Hopkins UniversityRecently, there has been a rebirth of empiricism in the field of natural language processing.
UPenn - E - 06
Adaptive Transformation-based Learning for Improving Dictionary TaggingBurcu Karagol-Ayan, David Doermann, and Amy Weinberg Institute for Advanced Computer Studies (UMIACS) University of Maryland College Park, MD 20742 {burcu,doermann,weinberg}@umia
UPenn - E - 06
Phrase-Based Backoff Models for Machine Translation of Highly Inected LanguagesMei Yang Department of Electrical Engineering University of Washington Seattle, WA, USA yangmei@ee.washington.edu Katrin Kirchhoff Department of Electrical Engineering Un
UPenn - P - 04
Towards a Semantic Classication of Spanish Verbs Based on Subcategorisation InformationEva Esteve Ferrer Department of Informatics University of Sussex Brighton, BN1 9QH, UK E.Esteve-Ferrer@sussex.ac.uk AbstractWe present experiments aiming at an a
UPenn - N - 03
A Phrase-Based Unigram Model for Statistical Machine TranslationChristoph Tillmann and Fei Xia IBM T.J. Watson Research Center Yorktown Heights, NY 10598 {ctill,feixia}@us.ibm.comAbstractIn this paper, we describe a phrase-based unigram model fo
UPenn - CIS - 610
TensorTextures: Multilinear Image-Based RenderingM. Alex O. Vasilescu and Demetri Terzopoulos University of Toronto, Department of Computer Science New York University, Courant Institute of Mathematical SciencesFigure 1: Frames from the Treasure C
UPenn - P - 84
Features and ValuesLauri Karttunen University of Texas at Austin Artificial Intelligence Center SRI International and Center for the Study of Language and Information Stanford UniversityAbstractThe paper discusses the linguistic aspects of a new
UPenn - T - 87
Unification a n d the n e w g r a m m a t i s m Steve Pulman University of Cambridge Computer Laboratory Corn Exchange Street Cambridge C B 2 3QG, UK.Whatare w e talking about?The prototypical unification grammar consists of a context-free skel
UPenn - H - 01
Guidelines for Annotating Temporal InformationInderjeet Mani, George WilsonThe MITRE Corporation, W640 11493 Sunset Hills Road Reston, Virginia 20190-5214, USA +1-703-883-6149Lisa FerroThe MITRE Corporation, K329 202 Burlington Road, Rte. 62 Bed
UPenn - C - 86
The computational complexity of sentence derivation in functional unification grammarGraeme Ritchie Department of Artificial Intelligence University of Edinburgh Edinburgh EHI IHNAbstract Functional unification (FU) grammar is a general linguisti
UPenn - E - 87
DECLARATIVE k VIEVNOOEL FOR DEPENDENCY PARSING INTO BLACKBOARD METHOOOLOGY-Vatkonen, K., J i p p i n e n , H., L e h t o t a , A. and Ytltammi, KIELIKOHE-pr~ject, SITRA Foundation P.O.Box 329, S F - 0 0 1 2 1 H e t s i n k i FinLand t e L . i n
UPenn - A - 97
Layout & Language: Preliminary experiments in assigning logical structure to table cellsMatthew Hurst and Shona Douglas Language Technology Group, Human Communication Research Centre, University of Edinburgh, Edinburgh EH8 9LW UK { M a t t h e w . H
UPenn - C - 88
AN I N T E G R A T E D MODEL F O R T H E TREATMENT OF TIME I N MT- SYSTEMSM. Meya Siemens CDS c/Luis Muntadas,5 CORNELLA, 08940-BARCELONA SpainJ. Vidul EUROTRA-E Ctra. Vallvidriera, 25.27 08017-BARCELONAAbstractOne of the ways to achieve a goo
UPenn - C - 90
Towards a Unification-Based PhonologyRichard Wiese Seminar f'dr Allgem. Spraehwissenschaft Heinrich-Heine-Univer sit,it DUsseldorf D-4000 Di.isseldorf 1 wiesedd0rud81.bitnet 1 Introduction. The Problem Phonological theory has undergone a number cf m
UPenn - C - 86
ASAELEMENTARY CONTRACTS PRAGMATIC BASIS OF LANGUAGEINTERACTIONE.L. Pershina A[ Laboratory, Computer Center Siberian Division of the USSR Ae. Sei. Novosibirsk 630090, USSR ABSTRACT Language interaction (LI) as a part of interpersonal communica
UPenn - E - 85
ON THE REPRESENTATION OF QUERY TERM RELATIONS BY SOFT BOOLEAN oPERATORSGerard Salton D e p a r t m e n t o f Computer S c i e n c e Cornell University Ithaca, NY 14853, USAABSTRACT The l a n g u a g e a n a l y s i s component i n m o s t t e x t
UPenn - C - 86
ConceptualLexicon Using an Object-OrientedLanguageShoiehi Y O K O Y A M A Electrotechnical Laboratory Tsukuba, Ibaraki, JapanKenji H A N A K A T A Universitat Stuttgart Stuttgart, F. R. G e r m a n yAbstractThis paper d e s c r i b e s the
UPenn - E - 91
STRUCTURAL NON-CORRESPONDENCE IN TRANSLATION Henry S. Thompson, Human Communication Research Centre, University of Edinburgh, 2 Buccleuch Place, Edinburgh, EH8 9LW, UIC ht@uk.ac.ed.cogsciLouisa Sadler, Dept. of Language and Linguistics, University
UPenn - C - 82
ADAPTIVE DIALOGUE - THE BASIS FOR PERSONAL COMPUTER SYSTEMVictor Briabrin Computing C e n t e r , Academy o f S c i e n c e s , Hosoow, USSR1. P e r s o n a l Computer S y s t e m s (POS) r e p r e s e n t nowadays a s i g n i f t e a u t t r e n
UPenn - C - 90
Complex Features in Description of Chinese LanguageFeng Zhiwei Imtitute of Applied Linguistics Chinese Academy of Social Sciences 51 Chaoyangmen Nanxiaojie 100010 Beijing, ChinaAbstract In this paper, the similarity of" multi-vahw label fimction" a
UPenn - C - 96
CHINESE STRING SEARCHING USING TtIE K M P ALGORITHMRobert W.P. LukDepartment of Computing, Hong Kong Polytechnic University,Kowloon,Hong Kong E-mail: csrluk@comp.polyu.edu.hkAbstract This paper is about the modification of KMP (Knuth, Morris and
UPenn - CIT - 591
ArraysApr 10, 2009A problem with simple variablesOne variable holds one valueThe value may change over time, but at any given time, a variable holds a single value If you want to keep track of many values, you need many variables All
UPenn - CIT - 591
Numbers and ArraysWidening and narrowing Numeric types are arranged in a continuum: Wider double float long int short byte,char Narrower You can easily assign a narrower type to a wider type: doublewide; intnarrow; wide=narrow; But if you want
UPenn - STAT - 112
Stat 112Review Notes for Chapter 4, Lecture Notes 6-91. Best Simple Linear Regression: Among the variables X 1 , K , X K , the variable which best predicts Y based on a simple linear regression is the variable for which the simple linear regressi
Auburn Montgomery - MATH - 190
Decimal Expansion of FractionsBrent MurphyP QProblem: Under What conditions will the decimal expansion of p/q terminate? Under what conditions will it repeat? p/q can be investigated as p*(1/q).Terminating When placing 1 over q as a fraction t
Auburn Montgomery - MATH - 190
Project 1.2 Decimal Expansions of Rational NumbersJacob Brozenick Anthony Mayle Kenny Milnes And Tim SweetserProblem Descriptions1. Determine which values of q in the expression p/q will cause the termination of the resulting decimal expansion.
Auburn Montgomery - MATH - 190
Calculus Project 1.2By Dorothy McCammon, Tammy Boals, George Reeves, Robert StevensPart 1 When you have a fraction x/y, y can be divided into x to obtain that fraction in decimal form. There are two different types of decimal numbers you can obt
Auburn Montgomery - MATH - 190
PROBLEM 1: Under what conditions will the decimal expansion p/q terminate? Repeat? PROBLEM 2: Suppose that we are given the decimal expansion of a rational number. How can we represent the decimal in the rational form p/q? PROBLEM 3: Express each
UPenn - M - 95
STATISTICAL SIGNIFICANCE OF MUC-6 RESULT SNancy Chinchor, Ph.D.Science Applications International Corporatio n 10260 Campus Point Drive, M/S A2- F San Diego, CA 9212 1 chinchor@gso.saic.com (619) 458-261 4 INTRODUCTIONThe results of the MUC-6 eva
UPenn - D - 07
Improving Query Spelling Correction Using Web Search ResultsQing Chen Natural Language Processing Lab Northeastern University Shenyang, Liaoning, China, 110004 chenqing@ics.neu.edu.cn Ming Zhou Microsoft Research Asia 5F Sigma Center Zhichun Road, H
UPenn - M - 92
U,SC : MUC-4 Test Results and AnalysisD . Moldovan, S. Cha, M . Chung, K. Hendrickson, J . Kim, and S. Kowalsk iParallel Knowledge Processing Laborator y University of Southern Californi a Los Angeles, California 90089-256 2 moldovan@gringo .usc .
UPenn - H - 90
Recent Results from the A R M Continuous Speech Recognition ProjectM a r t i n Russell and K e i t h P o n t i n gSpeech Research Unit RSKE, Malvern, Worcs WR14 3PS, UKIntroductionThis paper describes some of the most recent work on continuous s
UPenn - M - 92
BBN PLUM : MUC-4 Test Results and Analysi sRalph Weischedel, Damaris Ayuso, Sean Boisen , Heidi Fox, Herbert Gish, Robert Ingria, BBN Systems and Technologie s 10 Moulton St . Cambridge, MA 0213 8 weischedel@bbn.com GOALSOur mid-term to long-term g
UPenn - M - 93
THE STATISTICAL SIGNIFICANCE OF THE MUC-5 RESULT SNancy Chinchor, Ph .D.Science Applications International Corporatio n 10260 Campus Point Drive, M/S A2- F San Diego, CA 9212 1 chinchor @gso .saic.com (619) 458-261 4INTRODUCTIONThe statistical
UPenn - M - 91
SRI INTERNATIONAL'S TACITUS SYSTEM : MUC-3 TEST RESULTS AND ANALYSI SJerry R . Hobb sSRI International Menlo Park, California 9402 5 hobsai .sri.corn (415) 859-222 9 RESULTSThis site report is intended as a companion piece to the System Summary a
UPenn - M - 92
CRL/NMSU and Brandeis MucBr'uce : MUC-4 Test Results and Analysi sJim Cowie, Louise Guthrie, Yorick WilksComputing Research Laboratory New Mexico State University James Pustejovsky Computer Science Department Brandeis UniversityINTRODUCTIO NThe
UPenn - C - 92
First R e s u l t s o f a French Linguistic Development EnvironmentL. Bouchard (GIREIL) L. Emirkanian (cIREIL) D. Estival 0ssco) C. Fay-Varnier (CRIN) C. Fouquer6 (LIBN) (]. Prigent (CNFT-L.~aon) P. Zweigenbaum (INSERM-U104)1 Introduction: EGL I n
UPenn - P - 06
Annotation Schemes and their Inuence on Parsing ResultsWolfgang Maier Seminar f r Sprachwissenschaft, Universit t T bingen u a u Wilhelmstr. 19, 72074 T bingen, Germany u wmaier@sfs.uni-tuebingen.deAbstractMost of the work on treebank-based stat
UPenn - M - 91
MCDONNELL DOUGLAS ELECTRONIC SYSTEMS COMPANY : MUC-3 Test Results and Analysi sDavid de Hilster and Amnon MeyersAdvanced Computing Technologies Lab McDonnell Douglas Electronics Systems Compan y 1801 East Saint Andrew Plac e Santa Ana, California
UPenn - M - 92
SRA SOLOMON : MUC-4 TEST RESULTS AND ANALYSI SChinatsu Aone, Doug McKee, Sandy Shinn, Hatte Bleje r Systems Research and Applications (SRA ) 2000 15th Street Nort h Arlington, VA 2220 1 aonec@sra.comINTRODUCTIONIn this paper, we report SRA's resu
UPenn - M - 91
BBN PLUM: MUC-3 Test Results and AnalysisRalph Weischedel, Damaris Ayuso, Sean Boisen , Robert Ingria, Jeff Palmucc iBBN Systems and Technologies 10 Moulton St . Cambridge, MA 0213 8 weischedel@bbn.comINTRODUCTIONPerhaps the most important fact
UPenn - M - 91
HUGHES TRAINABLE TEXT SKIMMER : MUC-3 TEST RESULTS AND ANALYSI S Charles P . Dolan Thomas V. Cuda Seth R . Goldman Alan M. Nakamur aHughes Research Laboratorie s 3011 Malibu Canyon Road M/S RL9 6 Malibu, CA 90265Test results Figure 1 gives the
UPenn - M - 92
MCDONNELL DOUGLAS ELECTRONIC SYSTEMS COMPAN Y MUC-4 TEST RESULTS AND ANALYSI SAmnon Meyers and David de Hilste rMcDonnell Douglas Electronic Systems Compan y Advanced Computing Technologies Lab 1801 E. St. Andrew Plac e Santa Ana, CA 92705-6520 (v
UPenn - H - 89
THE LINCOLN CONTINUOUS SPEECH RECOGNITION SYSTEM: RECENT DEVELOPMENTS AND RESULTS 1Douglas B. Paul Lincoln Laboratory, MIT Lexington, MA 02173 ABSTRACT The Lincoln stress-resistant HMM CSR has been extended to large vocabulary continuous speech for
UPenn - M - 91
ITP INTERPRETEXT SYSTEM : MUC-3 TEST RESULTS AND ANALYSI SKathleen Dahlgre n Carol Lord Hajime Wada Joyce McDowel l Edward P . Stabler, Jr.Intelligent Text Processing, Inc . 1310 Montana Avenue, Suite 20 1 Santa Monica, CA 90403 213-576-4910 In
UPenn - M - 91
ADVANCED DECISION SYSTEMS' CODEX: MUC-3 TEST RESULTS AND ANALYSI SLaura Blumer Balcom Richard M . Tong Advanced Decision System s 1500 Plymouth Stree t Mountain View, California 9404 3 INTRODUCTIO NADS has developed a general purpose message dat
UPenn - CIS - 501
Midterm Results CIS501 Introduction to Computer ArchitectureProf. Milo Martin Midterm Results Results were disappointing My expectation: 5 or 10 point higher average Average score: 43.5 of 80 Median score: 42 of 80 Giving you a chance to impro
UPenn - CSE - 240
Warning!This is a bottom-up course No secrets, no magic e.g., gates build on transistors, logic circuits from gates, etc.Chapter 4 The Von Neumann ModelBased on slides McGraw-Hill Additional material 2004/2005 Lewis/MartinBut This is a top-d