3 Pages

P92-1038

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

Word Count: 2031

Document Preview

THE ON INTONATION OF MONO- AND DI-SYLLABIC WORDS WITHIN THE DISCOURSE FRAMEWORK OF CONVERSATIONAL GAMES Jacqueline C. Kowtko* Human Communication Research Centre University of Edinburgh 2 Buccleuch Place Edinburgh EH8 9LW SCOTLAND Internet: J.Kowtko@edinburgh.ac.uk Abstract Recent studies on the analysis of intonational function examine a r a n ~ of materials from cue phrases in monologue (Litman and Hirschberg,...

Register Now

Unformatted Document Excerpt

Coursehero >> Pennsylvania >> UPenn >> P 92

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.
THE ON INTONATION OF MONO- AND DI-SYLLABIC WORDS WITHIN THE DISCOURSE FRAMEWORK OF CONVERSATIONAL GAMES Jacqueline C. Kowtko* Human Communication Research Centre University of Edinburgh 2 Buccleuch Place Edinburgh EH8 9LW SCOTLAND Internet: J.Kowtko@edinburgh.ac.uk Abstract Recent studies on the analysis of intonational function examine a r a n ~ of materials from cue phrases in monologue (Litman and Hirschberg, 1990) and dialogue (Hirschberg and Litman, 1987; Hockey, 1991) to longer utterances in both monologue and dialogue (McLemore, 1991). Results match specific intonational tunes to certain discourse functions which are more or less well defined. Although these results make a convincing case that intonation does signal a change in discourse structure, the specification of discourse function remains vague. A suitable taxonomy is needed to fine-tune the relationship between intonation and discourse function. A recent analysis of dialogue (Kowtko et al., 1991) provides a framework of conversational games which allows more fine-grained examination of prosodic function. The current paper introduces an intonational analysis of monoand di-syllabic words based upon such a framework and compares results in progress with previous work on intonation. Introduction Recent approaches to the analysis of intonational function within dialogue include an examination of the tunes carried by single-word cue phrases (e.g. now (Hirschberg and Litman, 1987), okay (Hockey, 1991), and others (Litman and Hirschberg, 1990)) across different discourse situations. The literature also includes a more sweeping approach toward classifying phrase-final tunes which presents broadly generalized discourse functions for each of three types of intonational tune: phrase-final r/se, level, and fall (McLemore, 1991). Since there is currently no workable grammar of discourse, these studies devise their own relevant discourse categories. Hockey (1991, p. 1) reflects upon the problem, with reference to cue phrases. She states that * A U K Overseas Research Student Award provides partial support. T h a n k s to my advisors Stephen Isaxd and D. Robert Ladd for comments on drafts. cue phrases ...convey information about the structure of a discourse rather than contributing to the semantic content of a sentence . . . . Context and prosody are major factors contributing to differences in interpretation among various instances of a cue phrase. In order to investigate the connection between prosodic features and uses of a cue phrase, uses must be identified. The above is partly a response to Himchberg and Litman (1987; Litman and Hirschberg, 1990) who limit their description to a binary discourse/sentential distinction. Litman and Hirschberg (1990) leave the analysis of cue phrase function to the interpretation of various specific discourse approaches and instead focus on validating their (1987) prosodic model of cue phrase use with additional data from monologue. The model specifies that a cue phrase in discourse use will occur either alone in a phrase (with unspecified tune) or initially in a larger phrase (deaccented or with a low tone). Thus, Litman and Hirschberg leave open the question of how their prosodic model could further specify discourse function. McLemore (1991) approaches discourse as structured by topics and interruptions. Her data includes announcements given at Texas sorority meetings and conversation between members. She finds that phrase-final tunes indicate certain general functions: rising tune connects, level tune continues, and falling tune segments. The specifics about how each of these tunes operates depends upon the context. For instance, phrase-final rise which indicates non-finality or connection manifests itself as turn-holding in one context, phrase subordination in another, and intersentential cohesion in yet another context. Likewise, the other tunes perform slight variations on the function of continue and segment according to context, which is left up to the reader to determine. Hockey (1991) admits to settling upon an arbitrary discourse classification and letting her data 282 speak for itself, after attempting to adopt a system of analysis based upon a somewhat similar set of speech data 1. She focuses on task oriented dialogue and attempts to specify discourse function of the cue phrase okay. She presents her results in terms of intonational contours and their corresponding discourse categories, finding that they correlate with McLemore's (1991) results: 89% of rising contour occurs where the speaker was passing up a turn and letting the other person continue; 86% of level contour serves to continue an instruction; 88% of falling contour marks the end of a subtask. But her categorization of discourse is still weak. Admittedly, there are a limited number of intonational tunes (low rise, high rise, level, fall, etc.). But limitation in intonational tune should not force a limitation in discourse category. Detailed understanding of intonational function is necessarily linked to a more robust view of discourse structure. These previous studies provide good intonational analysis but within weak discourse structures. Conversational Games in Dialogue The analysis offered by Kowtko, Isard, and Doherty (1991) provides an independently defined taxonomy of discourse structure which allows a closer examination of how intonation signals speaker intention within task oriented dialogue. In the analysis, linguistic exchanges termed c o n v e r s a t i o n a l games (from a tradition of literature originating in Power (1974)) embody the initiationresponse-feedback patterns which relate to underlying non-linguistic goals. It is through the framework of games and their components, conversational moves, that the intonation of mono- and di-syllabic words can be compared with their discourse function, as intended by the speaker. A conversational game is defined as consisting of the turns necessary to accomplish a conversational goal or sub-goal. The initiating utterance determines which game is being played and is similar to the core speech act in Traum and Allen (1991). The ensuing response and feedback moves function as presentation and acceptance phases, in the terms of Clark and Schaefer (1987). Implicit, mutually agreed rules dictate the shape of a game and what constitutes an acceptable move within a game. These rules embody procedural, as opposed to declarative, knowledge which speakers employ in everyday conversation. ~Hockey had hoped to map discourse categories of okay based upon data collected from conversation at a library reference desk to that arising from a task in which one person described a design for another person to make out of paper clips. The repertoire of games and moves in Kowtko, Isard and Doherty (1991) is based upon a map task (see Anderson et al., 1991, for a detailed description): One person is given a map with a path marked on it has and to tell another person how to draw the path onto a similar map. Neither participant can see the other's map. The nature of the map task is such that from the conversations the speaker's intentions remain fairly obvious. Kowtko, Isard, and Doherty (1991) report that one expert and three naive judges agree on an average of 83% of the moves classified in two map task dialogues. Six games appear in the dialogues: Instruction, Confirmation, Question-YN, Question-W, Explanation, and Alignment. They are initiated by the following moves: INSTRUCT (Provides instruction), CHECK (Elicits confirmation of known information), QUERY-YN (Asks yes-no question for unknown information), QUERY-W (Asks content, wh-, question for unknown information), EXPLAIN (Gives unelicited description), and ALIGN (Checks alignment of position in task). Six other moves provide response and additional feedback: CLARIFY (Clarifies or rephrases given information), REPLY-Y (Responds affirmatively), REPLY-N (Responds negatively), REPLYW (Responds with requested information), ACKNOWLEDGE (Acknowledges and requests continuation), and READY (Indicates intention to begin a new game). Since the map task involves instructing one player on how to draw a path, the conversation naturally consists of many Instruction games. The structure of games allows for nesting of games and looping of response and feedback moves within games ~ The prototypical game consists of two or three moves: Initiation, Response, and optionally Feedback. The large majority of games (84% from a sample of 3 dialogues, n = 65) match the simple prototype. Games that do not match the prototype are still well-formed, having extra responsefeedback loops, nested games, or extra moves. Very few games (less than 2%) break down as a result of a misunderstanding or other problem. Here is an example of a prototypical Instruction game. The vertical bar indicates the boundary of a move: A: B: Right,[[ just draw round it. READY I[ INSTRUCT Okay. ACKNOWLEDGE 2As a comparison with Clark and Schaefer (1987) embedded games often coincide with instances of embedded contributions in the acceptance phase. 283 Conversational game structure, offers a taxonomy which specifies both the function and context of an utterance, as move z within game y. This facilitates the study of the function of intonational tune, since the tune reflects an utterance's conversational role. Intonation in Games Using data from map task dialogues (Anderson et at., 1091), I have been analyzing mono- and disyllabic words which compose single moves within themselves: right, okay, yes, no, mmhmm, and nhhuh. In addition, I am categorizing the cases where these words form part of a move. They typically surface as 5 of the 12 moves in the games analysis (Kowtko et at., 1991): READY, ACKNOWLEDGE, ALIGN, REPLY-Y, and REPLY-N. The current data set consists of 68 utterances spoken by 3 of the 4 conversants in 2 dialogues. In order to compare my results with those of McLemore (1991) and Hockey (1991), I have tried to collapse moves and their contexts into the three general categories: ACKNOWLEDGE move following INSTRUCT serves to connect; READY, ACKNOWLEDGE (and other) moves which interrupt an INSTRUCT (i.e. precede a continued INSTRUCT move) continue; REPLY-Y, REPLYN, ACKNOWLEDGE after EXPLAIN, and ACKNOWLEDGE after a response move (specifically elicited moves) segment. The data yield the following results s: 42% of rises (5 of 11) appear as connecting moves, 30% of levels (13 of 44) as continuing moves, and 69% of falls (9 of 13) as segmenting moves. Only one category approaches a match to other published results. It is possible that my decisions of which moves collapse together would not be corroborated and cause some of the disagreement. It is also possible that dialectal variation would account for some of the difference (The map task contains Scottish as opposed to American English), but it would be folly to wave such a hand of dismissal. These results reflect an intonation-based approach. Information may be lost in the process of collapsing various discourse contexts into three intonational categories (McLemore, 1991) and then limiting discourse categories to match those three existing intonational categories (Hockey, 1991). Separate discourse categories, in a discourse-based approach, should facilitate clearer results. When categorized according to move and discourse context, the data begins to speak on its 3p > .20 for each result, according to the Kolmogorov-Smirnov One-sample Test, indicates statistical non-significance. 284 own. Granted, the numbers for each category are currently small and not statistically reliable, but some trends are striking and suggest that more data will prove to yield interesting results. For example, of 15 REPLY-Y/N moves, 12, or 80%, are levels, the 3 others being falls in a single category, REPLY-Y after QUERY-YN. All 4 cases of REPLYY after ALIGN are high levels, while REPLY-Y/N after QUERY-YN are mostly low levels (6 of 8). Work is progressing on other dialogues, amassing enough pitch trace data to allow clear patterns to emerge for each type of move in each game context. The goal is, given a discourse context, to be able to predict an utterance's function or move, given the intonation, and, conversely, predict intonational tune, given the type of move. References Anderson, Anne H., Miles Bader, Ellen G. Bard, Elizabeth Boyle, Gwyneth Doherty, Simon Carrod, Stephen Isard, JacqueUne Kowtko, Jan MeAllister, Jim Miller, Catherine Sotillo, Henry Thompson, and Regina Weinert (1991). The HCRC Map Task Corpus. Language and Speech, 34(4):351-366. Clark, Herbert H. and Edward F. Schaefer (1987). Collaborating on contributions to conversations. Language and Cognitive Processes, 2(1):19-41. Hirsehberg, Julia and Diane Litman (1987). Now let's talk about n o ~ Identifying cue phrases intonationally. Proceedings of the ~5th annual Meeting of the Association for Computational Linguistics, Stanford, 163-171. Hockey, Beth Ann (1991). Prosody and the interpretation of "okay". Presented at the A A A I Fall Symposium, Monterey, CA, November. Kowtko, Jacqueline, Stephen Isard and Gwyneth Doherty (1991). Conversational games within dialogue. Proceedings of the ESPRIT Workshop on Discourse Coherence, Edinburgh, April. To appear as an HCRC Research Report, Human Communication Research Centre, Edinburgh, 1992. Litman, Diane and Julia Hirschberg (1990). Disambiguating cue phrases in text and speech. COLING-90 Proceedings, Helsinki, 251-256. McLemore, Cynthia A (1991). The Pragmatic Interpretation of English Intonation: Sorority Speech. Ph.D. dissertation, University of Texas at Austin. Power, Richard (1974). A Computer Model of Conversation. Ph.D. dissertation, University of Edinburgh. Traum, David R. and James F. Allen (1991). Conversation Actions. Proceedings of the AAA1 Fall Symposium, Monterey, CA, November, 114-119.
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 - HCMG - 05
COST-BENEFIT AND COSTEFFECTIVENESS ANALYSIS HCMG 901/301 Lecture #2 A Examples of CE AnalysisDaniel PolskySeptember 15, 2005Abdominal Aortic Aneurysm (AAA) An abdominal aortic aneurysm (AAA) is an abnormal expansion of the abdominal portion of t
UPenn - ISPOR - 05
COMPARISON OF COSTS AND EFFECTSCOST-EFFECTIVENESS RATIOS OR NMB?!Cost-effectiveness ratios)C / )Q !Net monetary benefit100N = 39 9275 % of studiesRc)Q - )C where Rc equals willingness to pay WERE COSTS AND EFFECTS COMPARED?5025 8
UPenn - ISPOR - 03
GLOSSARY OF STATA COMMANDS USED IN PROGRAMS append: appends data from saved file (i.e., adds observations) to dataset in active memory bsample: low level bootstrap algorithm; it draws a random sample with replacement from the dataset in active memory
UPenn - SCT - 06
Designing Economic Evaluations in Randomized TrialsSociety for Clinical Trials 27th Annual Meeting May 2006 Henry Glick and Jalpa Doshi www.uphs.upenn.edu/dgimhsrCost-Effectiveness History Traditionally used decision analytic models decision tre
UPenn - ISPOR - 06
Statistical Considerations in Economic Evaluations ISPOR 11th Annual International Meeting May 21, 2006 Agenda 1:00 - 1:10 1:10 - 2:10 2:10 - 3:50 Introductions Economic Evaluation in Randomized Trials, Henry Glick Evaluating Patient Level Costs, Jal
UPenn - ISPOR - 06
Designing Economic Evaluations in Randomized TrialsStatistical Considerations in Economic EvaluationsISPOR 11th Annual International Meeting May 2006 Henry Glick, Daniel Polsky, Jalpa Doshi www.uphs.upenn.edu/dgimhsrGood Value for the Cost Cutti
UPenn - ISPOR - 06
ANALYZING TREATMENT COSTS IN RANDOMIZED TRIALS Jalpa Doshi, Henry Glick, and Daniel Polsky University of Pennsylvania Health System Statistical Considerations in Economic Evaluations ISPOR 11th Annual International Meeting May 21, 2006 www.uphs.upenn
UPenn - MDM - 05
EVALUATING TREATMENT COSTS IN RANDOMIZED TRIALS Jalpa Doshi, Henry Glick, and Daniel Polsky University of Pennsylvania Health System Economic Assessment in Clinical Trials SMDM 27th ANNUAL MEETING October 22, 2005 www.uphs.upenn.edu/dgimhsr OUTLINE
UPenn - MDM - 05
EVALUATING TREATMENT COSTS IN RANDOMIZED TRIALS Jalpa Doshi, Henry Glick, and Daniel Polsky University of Pennsylvania Health System Economic Assessment in Clinical Trials SMDM 27th ANNUAL MEETING October 22, 2005 www.uphs.upenn.edu/dgimhsrAppendix
UPenn - ISPOR - 07
ANALYZING TREATMENT COSTS IN RANDOMIZED TRIALSJalpa Doshi, PhD, Henry Glick, PhD, and Daniel Polsky, PhD University of Pennsylvania School of Medicine www.uphs.upenn.edu/dgimhsrOutline Univariate Analysis Statistical Tests General Advice Multi
UPenn - CARMA - 04
COST EFFECTIVENESS ANALYSIS AND NEW METHODOLOGICAL APPROACHES Henry Glick University of Pennsylvania www.uphs.upenn.edu/dgimhsrDEMONSTRATING THAT A TECHNOLOGY IS "GOOD VALUE FOR THE COST" (I)!10-15 years ago, most likely would have supported th
UPenn - CIT - 597
JUnitApr 10, 2009Test suitesObviously you have to test your code to get it working in the first place You can do ad hoc testing (running whatever tests occur to you at the moment), or You can build a test suite (a thorough set of tests that
UPenn - CIT - 597
Aspect-Oriented ProgrammingApr 10, 2009Programming paradigmsProcedural programming Executing a set of commands in a given sequence Fortran, C, Cobol Evaluating a function defined in terms of other functions Lisp, ML, OCaml Proving a theorem
UPenn - CIT - 591
JUnitApr 10, 2009Test suitesObviously you have to test your code to get it working in the first place You can do ad hoc testing (running whatever tests occur to you at the moment), or You can build a test suite (a thorough set of tests that
UPenn - CIT - 597
ServletsApr 10, 2009ServersA server is a computer that responds to requests from a clientTypical requests: provide a web page, upload or download a file, send emailA server is also the software that responds to these requests; a clien
UPenn - P - 414
Physics 414/521 Lecture 1Professor Joseph Kroll Dr. Jose Vithayatil University of PennsylvaniaOutline Standard units Discussion of uncertainties statistical systematic reminder about propagation of uncertainties Mean & VarianceWe do not u
UPenn - P - 364
Checklist for Physics 364 Lab #3: ac Circuits=1. Verifying that Kirchhoff's laws are satisfied for complex impedance o They should have schematic of the circuit and a description of where they placed the oscilloscope probes. The schematic
UPenn - P - 364
yytkrty7@2ee&te l { d q h h d f d q h p t o o l h 3~qx3Q7Qgrwrj{zQ7Q`rTyh`w%ct(3rxywj!g!d h% r!gx!YCSkrQwj!rwx%mr!gQj`QSlYjQx!%`rh d f f s on l h d } d f { d q h fd s q s
UPenn - P - 364
(Wi}s7@2t& z A " E A H B 6 $ " E 4 A E d x d h g xp h z z y d d g }mifSUsn%&5!bjuWYtjTs3tS2rmI!msfVe!j u ex xy u p il d y u ~ dx g l d i d d x d uYkIk!Qt!WfxijesWgiQ!t5YVWjlYim!5Ybfe3fj!jW(vflmn
UPenn - P - 364
Physics 364: Some General Remarks about the Laboratory 17 Sep. 2001 Prof. Kroll Please read this information before coming to the rst laboratory session on 17 September 2001. Information about the laboratories (schedule, lab write-ups, etc.) can be f
UPenn - P - 364
Physics 364 Fall 2001 Laboratories Prof. Kroll_ | | | | | | | | | | | | |BARBOUR,SAMUEL 10103593 | | | | | | | | | | | | |_|_|_|_|_|
UPenn - P - 364
Max,For the first three homework problems, I would like you to check oneof the problems carefully (specified below) and then see if theyattempted the other problems. The problems I would like to see checkedcarefully areProblem Set #1: Problem
UPenn - P - 364
Kirchhos Voltage Law (KVL): the sum of voltages around any closed loop is zero, that is, voltage gains equal voltage losses. Kirchhos Current Law (KCL): the sum of currents into a node is zero, that is, the sum of currents into the node equals the su
UPenn - P - 364
Dear Class,If you are receiving this message, it is because you are currently enrolledto take Physics 364 or 521 this Fall semester. I am writing to you to provideyou with some important information about the class. There is a web page for the
UPenn - DPF - 2006
Observation of B0s B0s OscillationsThe CDF CollaborationJoseph Kroll University of Pennsylvania1st St. Ocean City, NJ, Feb. 7, 2003, H2O 350 FDPF Waikiki, HI 2 Nov 2006Results presented today are contained in two papers:) on ti ra o ab 6 )
UPenn - DOE - 2005
Penn CDF B Physics OverviewJoseph Kroll Penn DOE Site Visit 8 August 2005Topics Bs & B0 Flavor oscillations ( ms) leadership Kroll, Jones, Oldeman flavor tagging Jones, Usynin, Kroll lifetime resolution Heijboer trigger monitoring & innov
UPenn - DOE - 2005
CDF OverviewJoseph Kroll Penn DOE Site Visit 8 9 August 2005Context of this presentationPast 4 years CDF II has moved from construction & commissioning maintaining & analyzing Penn CDF Group has made major contributions to CDF II & made a major
UPenn - UCC - 1
1-105. Territorial Application of the Act; Parties Power to ChooseApplicable Law and Judicial Forum(a) Unless the law determining the rights and obligations of parties with respect to anyaspect of a transaction governed by this Act has been se
UPenn - N - 03
Statistical Phrase-Based Translation Proceedingsof HLT-NAACL 2003 Main Papers , pp. 48-54 Edmonton, May-June 2003Philipp Koehn, Franz Josef Och, Daniel Marcu Information Sciences Institute Department of Computer Science University of Southern Cal
UPenn - C - 96
H M M - B a s e d Word Alignment in Statistical TranslationStephan Vogel Hermann Ney Christoph Tillmann L e h r s t u h l ffir I n f o r m a t i k V, R W T H A a c h e n D-52056 Aachen, Germany {vogel, n e y , t illmann}@inf ormat ik. rwth-aachen, d
UPenn - P - 03
Chunk-based Statistical TranslationTaro Watanabe, Eiichiro Sumita and Hiroshi G. Okuno {taro.watanabe, eiichiro.sumita}@atr.co.jp ATR Spoken Language Translation Department of Intelligence Science Research Laboratories and Technology 2-2-2 Hikarida
UPenn - C - 00
ABL: Alignment-Based LearningMenno van Zaanen School of C o m p u t e r S t u d i e s University of Leeds LS2 9 J T L(~eds UK menno@scs, l e e d s , a c . ukAbstract This ])al)er introdu(:es a new tyl)e of grammar learning algorithm, iilst)ired l)
UPenn - P - 00
An Information-Theory-Based Feature Type Analysis for the Modelling of Statistical ParsingSUI Zhifang , ZHAO Jun , Dekai WU Hong Kong University of Science & Technology Department of Computer Science Human Language Technology Center Clear Water B
UPenn - P - 03
A spoken dialogue interface for TV operations based on data collected by using WOZ methodJun Yeun-Bae Goto Kim NHK STRL NHK STRL Human Science Human Science Tokyo 157-8510 Tokyo 157-8510 Japan Japangoto.j-fw @nhk.or.jp kimu.y-go @nhk.or.jpMasaru
UPenn - P - 03
Loosely Tree-Based Alignment for Machine TranslationDaniel Gildea University of Pennsylvania dgildea@cis.upenn.eduAbstractWe augment a model of translation based on re-ordering nodes in syntactic trees in order to allow alignments not conforming
UPenn - C - 90
Toward Memory-based TranslationSatoshi S A T O and Ma.koto N A G A O Dept. of Electrical Engineering, K y o t o University Y o s h i d a - h o n m a c h i , Sa.kyo, K.yoto, 606, Ja.pan sa.to@kuee.kyoto-u.ac.jpAbstractAn essential problem of examp
UPenn - J - 93
Machine Translation: A Knowledge-Based Approach Sergei Nirenburg, Jaime Carbonell, Masaru Tomita, and Kenneth Goodman(Carnegie Mellon University) San Mateo, CA: Morgan Kaufmann Publishers, 1992, xiv + 258 pp. Hardbound, ISBN 1-55860-128-7, $39.95T
UPenn - C - 00
Automatic Corpus-Based Thai Word Extraction with the C4.5 Learning AlgorithmVIRACH SORNLERTLAMVANICH, TANAPONG POTIPITI AND THATSANEE CHAROENPORN National Electronics and Computer Technology Centel, National Science and Technology Development Agency
UPenn - C - 90
Reversible Unification Based M a c h m . FranslatlonGertjan van Noord OTS RUU Trans 10 3,512 JK Utrecht Valmoord~hutruu59.BH~netMarch 28, 1990Abstract[n this paper it will be shown how unification g r a m m a r s can be used to build a reversib
UPenn - C - 00
Chart-Based Transfer Rule Application in Machine TranslationAdam MeyersNew York University meyers@cs.nyu.edu M i c h i k o Kosaka Monlnouth University kosaka@monmouth.eduR a l p h GrishInanNew York University grishman@cs.nyu.eduAbstract35"ans
UPenn - P - 99
Corpus-Based Identification of Non-Anaphoric N o u n PhrasesD a v i d L. B e a n and E l l e n R i l o f fD e p a r t m e n t of C o m p u t e r Science University of U t a h Salt Lake City, U t a h 84112 {bean,riloff}@cs.utah.eduAbstract Corefer
UPenn - P - 90
ZERO MORPHEMES IN UNIFICATION-BASED COMBINATORY CATEGORIAL GRAMMAR Chinatsu Aone The University of Texas at Austin & MCC 3500 West Balcones Center Dr. Austin, TX 78759 (aone@mcc.com) ABSTRACT In this paper, we report on our use of zero morphemes in U
UPenn - P - 96
A N e w Statistical Parser Based on B i g r a m Lexical D e p e n d e n c i e sCollins* Dept. of Computer and Information Science University of Pennsylvania P h i l a d e l p h i a , P A , 19104, U . S . A . mcollins@gradient, cis.upenn, eduMichae
UPenn - P - 99
Designing a Task-Based Evaluation M e t h o d o l o g y for a Spoken Machine Translation S y s t e mKavita Thomas L a n g u a g e Technologies I n s t i t u t e Carnegie Mellon University 5000 Forbes Avenue P i t t s b u r g h , PA 15213, USAkavita
UPenn - P - 03
An Ontology-based Semantic Tagger for IE systemNarj` s Boufaden e Department of Computer Science Universit de Montr al e e Quebec, H3C 3J7 Canada boufaden@iro.umontreal.caAbstractIn this paper, we present a method for the semantic tagging of word
UPenn - C - 96
NL Domain Explanations in Knowledge Based MATGalia Angelova, Kalina Bontcheva 1Bulgarian Academy of Sciences, Linguistic Modelling Laboratory A c a d . G, B o n c h e v Str. 2 5 A , 1113 S o f i a , B u l g a r i a , { galja,kalina} @ b g c i c t .
UPenn - P - 03
Deverbal Compound Noun Analysis Based on Lexical Conceptual StructureTeruo Koyama Koichi Takeuchi Kyo Kageura Human and Social Information Research Division National Institute of Informatics 2-1-2 Hitotsubashi, Chiyodaku, Tokyo 101-8430, Japan koich
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.