DOCSLIB.ORG

A Bibliography of Books, Theses, Articles, and Technical Reports in Or on Head-Driven Phrase Structure Grammar

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
A Bibliography of Books, Theses, Articles, and Technical Reports in Or on Head-Driven Phrase Structure Grammar A Bibliography of Books, Theses, Articles, and Technical Reports in or on Head-Driven Phrase Structure Grammar Compiled by Mike Calcagno, Andreas Kathol, and Carl Pollard Version of September 1993 Adger, David. 1989. Sign-Based Morphology: Applications to Noun-Incorporation. Master's thesis, Uni- versity of Edinburgh. Arnold, Doug and Louise Sadler. 1992. Non-Modifying Adjectives in HPSG. In Working Papers in Language Processing 35. Department of Languages and Linguistics, University of Essex. Backofen, Rolf, Harald Trost, and Hans Uzskoreit. 1991. Linked Typed Feature Formalisms and Termino- logical Knowledge Representation Languages in Natural Language Front Ends. DFKI Research Report 91-28. Balari, Sergio. 1991. Why German is not a Null-Subject Language. CLAUS Report 12, University of the Saarland, Saarbriicken. Balari, Sergio. 1991. Information-Based Linguistics and Head-Driven Phrase Structure. In Miguel Filgueiras, Lufs Damas, Nelma Moreira, and Ana Paula Tomas, eds., Natural Language Processing. Berlin: Springer, 55-101. Balari, Sergio. 1992. Feature Structures, Linguistic Information, and Grammatica/ Theory. Doctoral dissertation, Autonomous University of Barcelona. Balari, Sergio. 1992 .. Agreement and 0-roles: Towards an Account of Null Subjects in HPSG, CLAUS Report 25, University of the Saarland, Saarbriicken. Balari, Sergio. In press. Sujetos nulos en HPSG. In Carlos Martin Vide, ed., Proceedings of the VII Cong~so de Lenguajes N aturales y Lenguajes Forma/es. Barcelona: Vic. Balari, Sergio. In press. Two Types of Agreement. In Catalan Working Papers in Linguistics 2. Au- tonomous University of Barcelona. Bird, Steven. 1990. Constraint-Based Phonology. Doctoral 1issertation, University of Edinburgh. (To be published in Studies in Language, Logic, and Information.) Bird, Steven. 1992. Finite-State Phonology iii HPSG. In Proceedings ofCOLING 92, 74-80. Bird, Steven and Ewan Klein. 1993. Enriching HPSG Phonology. Research Paper EUCCS/RP-56. Centre for Cognitive Science, University of Edinburgh. Block, Christie. 1993. Null Objects in Mandarin Chinese. In Kathol and Pollard, eds. Borsley, Robert. 1987. A Note on HPSG. Bangor Papers in Linguistics 1. University College of North Wales. Borsley, Robert. 1987. Subjects and Complements in HPSG. Report 87-107. Stanford: Center for the Study of Language and Information. Borsley, Robert. 1989. Phrase-Structure Grammar and the Barriers Conception of Clause Structure. Linguistics 27: 843-863. 227 Horsley, Robert. 1989. An HPSG Approach to Welsh. Journal of Linguistics 25: 333-354. Horsley, Robert. 1990. Welsh Passives. In Martin J. Ball, James Fife, Erich Poppe and Jenny Rowland, eds., Celtic Linguistics: Readings in the Brythonic Languages, a Festschrift for T. Arwyn Watkins. Philadelphia.and Amsterdam: Benjamins, 89-107. Horsley, Robert. 1990. A Category-Driven Computational Grammar of English. IBM UKSC Report 223. IBM UK Scientific Center, Winchester. Horsley, Robert. 1991. Syntactic Theory: a Unified Approach. New York: E. Arnold. (Distributed in the USA by Routledge, Chapman and Hall.) Horsley, Robert. Forthcoming. Heads in HPSG. In G. Corbett, N. Fraser, and S. McGlashan, eds. Heads in Grammatical Theory. Calcagno, Mike. 1993. Toward a Linearization-Based Approach to Word Order Variation in Japanese. In Kathol and Pollard, eds. · Carpenter, Bob. 1990. Typed Feature Structures: Inheritance, (In)Equations, and Exterisionality. In Pro- ceedings of the First International Workshop on Inheritance in Natural Language Processing. Tilburg, The Netherlands, 9-13. Carpenter, Bob. 1991. The ·Generative Power of Categorial Grammars and Head-driven Phrase Structure Grammars with Lexical Rules. In Computational Linguistics 17.3: 301-314. Carpenter, Bob. 1991. Typed Feature Structures: an Extension of First-order Terms. In V. Saraswat and K. Ueda, eds, Proceedings of the International Symposium on Logic Programming, Cambridge: MIT Press, 187-201. Carpenter, Bob. 1991. Linguistic Knowledge Representation and Reasoning with Hybrid Constraints. In Proceedings of the AAAI Fall Symposium on Hybrid Reasoning, Asilomar. · Carpenter, Bob. 1991. Skeptical and Credulous Unification with Applications to Templates and Inheritance. In Proceedings of the ACQUILEX Workshop on Defaults in the Lexicon, Cambridge, England. Carpenter, Bob. 1992. ALE User's Guide. Laboratory for Computational Linguistics Report 92-1, Carnegie Mellon University. Carpenter, Bob. 1992. The Logic of Typed Feature Structures with Applications to Unification-based Grammars, Logic Prog'ramming and Constraint Resolution. Cambridge Tracts in Theoretical Com- puter Science 32. New York: Cambridge University Press. Carpenter, Bob and Carl Pollard. 1991. Inclusion, Disjointness, and Choice: the Logic of Linguistic Classification. In Proceedings of AGL 91, 9-16. Carpenter, Bob, Carl Pollard, and Alex Franz. 1991. The Specification and Implementation of Constraint- Based Unification Grammars. In Proceedings of the Second International Workshop on Parsing Tech- nology, Cancun, Mexico, 143-153. Cha, Jong-Yul. 1992. Haykecwungsim J(wukwucomunpepepeyseuy Unyu Haysekmohyeng Kwuc_wuk [Con- struction of Metaphro Interpretation Model in HPSG]. Master's thesis, Soong Sil University. Chang, Suk-Jin. 1987. HPSG: Thongsawa Uymiuy Thonghapkiswul [Unified Description of Syntax and Semantics]. Festschrift for Dr. Jun-Ki Choe. Hanyang University, Seoul, 1001-1029. Chang, Suk-Jin. 1989. Hanyengetongsauy Hawipemcwuhwawa Tayungey kwanhan Yenkwu [Subcatego- rization and Correspondence between Korean and English Verbs]. Report ETRI1989. Taytek: ETRI. Chang, Suk-Jin. 1989. Cayenenecheli lul wihan Thonghapmwunpep: Hawipemcwuhwawa Ehwicek lngye- seng [Unificational Grammar for NLP: Subcategorization and Lexical Redundancy]. Festschrift for· Prof. Hye-Suk Lee. Seoul: Hanshin, 307-328. 228 Chang, Suk-Jin. 1990. Hwamaykkwa Mwunpep [Context and Grammar]. Yene [Language] 15: 499-538. Seoul: Linguistic Society of Korea. Chang, Suk-Jin. 1993. Cengpokipan Hankwukemwunpep [Information-based Korean Grammar]. Seoul: Language & Information. Chang, Suk-Jin and Kim,Young-Taek, and Shin, Soo-Song. 1989. Cayenenecheliuy Kichoyenkwu [Basic Research for Natural Language Processing]. Report KOSEF86207. Tayek: KOSEF. Chang, Suk-Jin and Jae-Woong Choe. 1992. Toward Understanding Discourse Structure: Flow of Contex- tual Information in Spoken Korean. In Proceedings oi Seoul International Conference on Lfoguistics- 1992, 1043-1058. Chang, Sung Woo. 1992. Hayke Cwungsim l(wukwucomwunpepuy Pwusa [Adverbs in Head-Driven Phrase Structure Grammar]. Master's thesis, Soong Sil University, Seoul. Chon, Wi-Tae. 1991. HPSG-uy Sakyeksenguy Yenkwu [On Obliqueness in HPSGJ. Doctoral dissertation, Kyunghee University, Seoul. Chung, Chan. 1993. A Lexical Approach to Inalienable Possession Constructions in Korean. In Kathel and Pollard, eds. Chung, Chan. To appear. Korean Auxiliary Verb Constructions Without VP-Nodes. In Susumo Kuno, et al. eds., Harvard Studies in Korean Linguistics V: Proceedings of the 1993 Workshop on Korean Linguistics. Chung, Chan. To appear. Scrambling in K.orean and its Effect on Anaphor Binding: An Alternative to Movement Approaches. In Proceedings ofESCOL 10. Cornell University. Cooper, Richard. 1990. Classification-Based Phrase Structure Grammar: An Extended Revised Version of HPSG. Doctoral dissertation, University of Edinburgh. Cooper, Richard. 1990. Specifiers, Complements and Adjuncts in HPSG. Research Paper EUCCS/RP-42, Centre for Cognitive Science, University of Edinburgh. Creary, Lewis G. and Carl Pollard. 1985. A Computational Semantics for Natural Language. In Proceedings of AGL 85, 172-179. Culy, Chris. 1990. The Syntax and Semantics oflnternally Headed Relative Clauses. Doctoral dissertation, Stanford University. Engeikamp, Judith, Gregor Erbach, and Hans Uszkoreit. 1992. Handling Linear Precedence Constraints by Unification. In Proceedings of AGL 92, 201-208. Erbach, Gregor. 1992. Head-Driven Lexical Representation of Idioms in HPSG. In Martin Everaert, Erik-Jan van der Linden, Andre Schenk and Rob Schreuder, eds. Proceedings of the International Conference on IdiQms. ITK, Tilburg, The Netherlands. Erbach, Gregor and Brigitte Krenn. In press. Idioms and Support-Verb Constructions. In Nerbonne et al., eds. Flickinger, Daniel. 1987. Lexical Rules in the Hierarchical Lexicon. Doctoral dissertation, Stanford Uni- versity. Flickinger, Daniel and John Nerbonne. 1992. Inheritance and Complementation: A Case Study of Easy Adjectives and Related Nouns. In Walter Dalemans and Gerald Gazdar, eds., Inheritance and Natural Language Processing, special issue of Computational Linguistics 19.3: 269-309. Flickinger, Daniel, Carl Pollard, and Thomas Wasow. 1985. Structure Sharing in Lexical Representation. In Proceedings ofAGL 85, 262-267. 229 Fodor, Janet D. 1992. Islands, Leamability and the Lexicon. In Helen Goodluck and Michael Rochemont, eds. Island Constraints: Theory, Acquisition and Processing. Dordrecht: Kluwer. Frank, Anette and Uwe Reyle. 1992. How to cope with scrambling and scope. ln·G. Gorz, ed., Proceedings of I(ONVENS 1992, Berlin: Springer. Franz, Alex. 1990. A Parser for HPSG. Laboratory for Computational Linguistics Report 90-3, Carnegie Mellon University. Fukushima, Kazuhiko. 1991. Phrase Structure Grammar, Montague Semantics, and Floating Quantifiers. in Japanese. Linguistics and Philosophy 14: 581-628. Fukushima, Kazuhiko. 1990. VP-Embedding Control Structures in Japanese. In Katarzyna Dziwirek, Patrick Farrell, and Errapel Mejias-Bikandi, eds. Grammatical
Load more

Recommended publications
  • Lexical Rules in Constraint-Based Grammars
    Lexical Rules in Constraint-based Grammars Ted Briscoe* Ann Copestake t University of Cambridge CSLI, Stanford University Lexical rules have been used to cover a very diverse range of phenomena in constraint-based grammars. Examination of the full range of rules proposed shows that Carpenter's (1991) postu- lated upper bound on the length of list-valued attributes such as SUBCAT in the lexicon cannot be maintained, leading to unrestricted generative capacity in constraint-based formalisms utilizing HPSG-style lexical rules. We argue that it is preferable to subdivide such rules into a class of semiproductive lexically governed genuinely lexical rules, and a class offully productive unary syntactic rules. We develop a restricted approach to lexical rules in a typed default feature structure (TDFS) framework (Lascarides et al. 1995; Lascarides and Copestake 1999), which has enough expressivity to state, for example, rules of verb diathesis alternation, but which does not allow arbitrary manipulation of list-valued features. An interpretation of such lexical rules within a probabilistic version of a TDFS-based linguistic (lexical and grammatical) theory allows us to capture the semiproductive nature of genuinely lexical rules, steering an intermediate course between fully generative or purely abbreviatory rules. We illustrate the utility of this approach with a treatment of dative constructions within a linguistic framework that borrows insights from the constraint-based theories: HPSG, UCG, (Zeevat, Klein, and Calder 1987) and construction grammar (Goldberg 1995). We end by outlin- ing how our approach to lexical rules allows for a treatment of passive and recursive affixation, which are generally assumed to require unrestricted list manipulation operations.
    [Show full text]
  • Effective Statistical Models for Syntactic and Semantic Disambiguation
    EFFECTIVE STATISTICAL MODELS FOR SYNTACTIC AND SEMANTIC DISAMBIGUATION a dissertation submitted to the department of computer science and the committee on graduate studies of stanford university in partial fulfillment of the requirements for the degree of doctor of philosophy Kristina Nikolova Toutanova September 2005 c Copyright by Kristina Nikolova Toutanova 2005 All Rights Reserved ii I certify that I have read this dissertation and that, in my opinion, it is fully adequate in scope and quality as a dissertation for the degree of Doctor of Philosophy. Christopher D. Manning (Principal Adviser) I certify that I have read this dissertation and that, in my opinion, it is fully adequate in scope and quality as a dissertation for the degree of Doctor of Philosophy. Andrew Y. Ng I certify that I have read this dissertation and that, in my opinion, it is fully adequate in scope and quality as a dissertation for the degree of Doctor of Philosophy. Daniel Jurafsky Approved for the University Committee on Graduate Studies. iii iv Abstract This thesis focuses on building effective statistical models for disambiguation of so- phisticated syntactic and semantic natural language (NL) structures. We advance the state of the art in several domains by (i) choosing representations that encode domain knowledge more effectively and (ii) developing machine learning algorithms that deal with the specific properties of NL disambiguation tasks { sparsity of training data and large, structured spaces of hidden labels. For the task of syntactic disambiguation, we propose a novel representation of parse trees that connects the words of the sentence with the hidden syntactic struc- ture in a direct way.
    [Show full text]
  • Tilburg University Evaluation of Lexical Representation Formalisms
    Tilburg University Evaluation of lexical representation formalisms Daelemans, W.M.P.; van der Linden, H.J.B.M. Publication date: 1992 Document Version Publisher's PDF, also known as Version of record Link to publication in Tilburg University Research Portal Citation for published version (APA): Daelemans, W. M. P., & van der Linden, H. J. B. M. (1992). Evaluation of lexical representation formalisms. (ITK Research Memo). Institute for Language Technology and Artifical IntelIigence, Tilburg University. General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal Take down policy If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim. Download date: 26. sep. 2021 CBM ~~J R ~`~~ ~J~i 8419 ~ ,~~ ; ~~~ 1992 ~o~~~~~~~~~P~~ IIIInI~uuIIII II 14 J ~ I NINIIIVIII~IINllllll~l 1 INST!TUTE FOR LANGUAGE TECHNOLOGY AND ARTIFICIAL INTELLIGENCE INSTITUUT VOOR TAAL- EN KENNISTECHNOLOGIE ITK Research Memo february 1992 Evaluation of Lexical Representation Formalisms Walter Daelemans 8z Erik-Jan van der Linden No. 14 We wish to thank Hans Bcers with whom we worked on DATR.
    [Show full text]
  • 2018 Canliidocs 10575 2018 Canliidocs 10575 LEGAL KNOWLEDGE and INFORMATION SYSTEMS 2018 Canliidocs 10575
    2018 CanLIIDocs 10575 2018 CanLIIDocs 10575 LEGAL KNOWLEDGE AND INFORMATION SYSTEMS 2018 CanLIIDocs 10575 Frontiers in Artificial Intelligence and Applications The book series Frontiers in Artificial Intelligence and Applications (FAIA) covers all aspects of theoretical and applied Artificial Intelligence research in the form of monographs, selected doctoral dissertations, handbooks and proceedings volumes. The FAIA series contains several sub-series, including ‘Information Modelling and Knowledge Bases’ and ‘Knowledge-Based Intelligent Engineering Systems’. It also includes the biennial European Conference on Artificial Intelligence (ECAI) proceedings volumes, and other EurAI (European Association for Artificial 2018 CanLIIDocs 10575 Intelligence, formerly ECCAI) sponsored publications. The series has become a highly visible platform for the publication and dissemination of original research in this field. Volumes are selected for inclusion by an international editorial board of well-known scholars in the field of AI. All contributions to the volumes in the series have been peer reviewed. The FAIA series is indexed in ACM Digital Library; DBLP; EI Compendex; Google Scholar; Scopus; Web of Science: Conference Proceedings Citation Index – Science (CPCI-S) and Book Citation Index – Science (BKCI-S); Zentralblatt MATH. Series Editors: J. Breuker, N. Guarino, J.N. Kok, J. Liu, R. López de Mántaras, R. Mizoguchi, M. Musen, S.K. Pal and N. Zhong Volume 313 Recently published in this series Vol. 312. T. Endrjukaite, A. Dudko, H. Jaakkola, B. Thalheim, Y. Kiyoki and N. Yoshida (Eds.), Information Modelling and Knowledge Bases XXX Vol. 311. M. Coeckelbergh, J. Loh, M. Funk, J. Seibt and M. Nørskov (Eds.), Envisioning Robots in Society – Power, Politics, and Public Space – Proceedings of Robophilosophy 2018 / TRANSOR 2018 Vol.
    [Show full text]
  • Cv Website.Pdf (151.44
    Aur´elieHerbelot Center for Mind / Brain Sciences, University of Trento [email protected] Research interests Computational linguistics: formal semantics, distributional semantics, reference phenomena, models of quantification and genericity, integration of perception and language in semantics. Education 2006{2010 PhD in computer science, University of Cambridge, UK. Supervisor: Ann Copestake Dissertation Title: Underspecified quantification 2005{2006 MPhil in Computer Speech, Text and Internet Technology, University of Cambridge, UK. Supervisor: Ann Copestake Dissertation Title: Acquiring ontological relationships from corpora 2000{2005 BSc Hons in Information Technology and Computing (1:1), Open University, UK. 1997{1998 MA in Literature and Linguistics (`Mention tr`esbien'), Universit´e de Savoie, France. Awarded with `F´elicitationsdu jury' (praise of the committee). 1994{1997 BA in Literature and Linguistics, Universit´ede Savoie, France. Grants and scholarships 2018 NVIDIA recipient of a hardware grant for a TESLA GPU. 2017 Marie Curie Individual Fellowship (24 months, e158,121.60). Success rate 15%. Project score: 95:6%. 2016 Mozilla `MOSS mission partner' award for my open-source project PeARS (Peer-to-peer Agent for Reciprocated Search). $15,500. 2016 NVIDIA recipient of a hardware grant for a TESLA GPU. 2011-2013 Humboldt Research Fellowship for Postdoctoral Researchers from the Alexander von Humboldt Foundation, Germany. ≈ e65,000. 2005{2010 Full MPhil and PhD scholarships from the Engineering and Physical Sciences Research Council (EPSRC), UK. 1 Positions held / industry work Academic positions 2018- Assistant professor (ricercatore), Centre for Mind/Brain Sciences, University of Trento, Italy. 2017-2018 Marie Curie-Sk lodowska Fellow, Department of Translation and Language Sciences, Universitat Pompeu Fabra, Barcelona, Spain.
    [Show full text]
  • Multiword Expressions a Pain in the Neck For
    This document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore. Title Multiword expressions : a pain in the neck for NLP. Sag, Ivan A.; Baldwin, Timothy.; Bond, Francis.; Author(s) Copestake, Ann.; Flickinger, Dan. Sag, I. A., Baldwin, T., Bond, F., Copestake, A., & Flickinger, D. (2002). Multiword expressions: A pain in the neck for NLP. Proceedings of Computational Linguistics Citation and Intelligent Text Processing: Third International Conference: CICLing-2002, Lecture Notes in Computer Science, 2276, 1-15. Date 2002 URL http://hdl.handle.net/10220/6828 © 2002 Springer. This is the author created version of a work that has been peer reviewed and accepted for publication by Proceedings of Computational Linguistics and Intelligent Text Processing: Third International Conference: CICLing-2002, LNCS, Springer. It Rights incorporates referee’s comments but changes resulting from the publishing process, such as copyediting, structural formatting, may not be reflected in this document. The published version is available at: [DOI: http://dx.doi.org/10.1007/3-540-45715-1_1]. Multiword Expressions: A Pain in the Neck for NLP? Ivan A. Sag1, Timothy Baldwin1, Francis Bond2, Ann Copestake3, and Dan Flickinger1 1 CSLI, Ventura Hall, Stanford University Stanford, CA 94305 USA fsag,tbaldwin,[email protected] 2 NTT Communication Science Labs., 2-4 Hikaridai Seika-cho, Soraku-gun, Kyoto, Japan 619-0237 [email protected] 3 University of Cambridge, Computer Laboratory, William Gates Building JJ Thomson Avenue, Cambridge CB3 OFD, UK [email protected] Abstract. Multiword expressions are a key problem for the develop- ment of large-scale, linguistically sound natural language processing tech- nology.
    [Show full text]
  • DATR: a Language for Lexical Knowledge Representation
    DATR: A Language for Lexical Knowledge Representation Roger Evans* Gerald Gazdar t University of Brighton University of Sussex Much recent research on the design of natural language lexicons has made use of nonmonotonic inheritance networks as originally developed for general knowledge representation purposes in Artificial Intelligence. DATR is a simple, spartan language for defining nonmonotonic inher- itance networks with path~value equations, one that has been designed specifically for lexical knowledge representation. In keeping with its intendedly minimalist character, it lacks many of the constructs embodied either in general-purpose knowledge representation languages or in contemporary grammar formalisms. The present paper shows that the language is nonetheless sufficiently expressive to represent concisely the structure of lexical information at a variety of levels of linguistic analysis. The paper provides an informal example-based introduction to DATR and to techniques for its use, including finite-state transduction, the encoding of DA Gs and lexical rules, and the representation of ambiguity and alternation. Sample analyses of phenomena such as inflectional syncretism and verbal subcategorization are given that show how the language can be used to squeeze out redundancy from lexical descriptions. 1. Introduction Irregular lexemes are standardly regular in some respect. Most are just like regular lexemes except that they deviate in one or two characteristics. What is needed is a natural way of saying "this lexeme is regular except for this property." One obvious approach is to use nonmonotonicity and inheritance machinery to capture such lexical irregularity (and subregularity), and much recent research into the design of represen- tation languages for natural language lexicons has thus made use of nonmonotonic inheritance networks (or "semantic nets") as originally developed for more general representation purposes in Artificial Intelligence.
    [Show full text]
  • Chapter 2 the Evolution of HPSG Dan Flickinger Stanford University Carl Pollard Ohio State Universtiy Tom Wasow Stanford University
    Chapter 2 The evolution of HPSG Dan Flickinger Stanford University Carl Pollard Ohio State Universtiy Tom Wasow Stanford University HPSG was developed to express insights from theoretical linguistics in a precise formalism that was computationally tractable. It drew ideas from a wide variety of traditions in linguistics, logic, and computer science. Its chief architects were Carl Pollard and Ivan Sag, and its most direct precursors were Generalized Phrase Structure Grammar and Head Grammar. The theory has been applied in the con- struction of computational systems for the analysis of a variety of languages; a few of these systems have been used in practical applications. This chapter sketches the history of the development and application of the theory. Introduction From its inception in 1983, HPSG was intended to serve as a framework for the formulation and implementation of natural language grammars which are (i) lin- guistically motivated, (ii) formally explicit, and (iii) computationally tractable. These desiderata are reflective of HPSG’s dual origins as an academic linguis- tic theory and as part of an industrial grammar implementation project with an eye toward potential practical applications. Here (i) means that the grammars are intended as scientific theories about the languages in question, and thatthe analyses the grammars give rise to are transparently relatable to the predictions Dan Flickinger, Carl Pollard & Tom Wasow. 2018. The evolution of HPSG. in Stefan Müller, Anne Abeillé, Robert D. Borsley & Jean- Pierre Koenig (eds.), Head-Driven Phrase Structure Grammar: The handbook, 7–40. Berlin: Lan- guage Science Press. DOI:⁇ Dan Flickinger, Carl Pollard & Tom Wasow (empirical consequences) of those theories.
    [Show full text]
  • Applying Natural Language Processing Techniques to Speech Prostheses
    From: AAAI Technical Report FS-96-05. Compilation copyright © 1996, AAAI (www.aaai.org). All rights reserved. Applying Natural Language Processing Techniques to Speech Prostheses Ann Copestake Center for the Study of Language and Information (CSLI) Ventura Hall, Stanford University, Stanford, CA94305-4115 aac@csli,stanford, edu Abstract simply because of the time which is taken but because the delays completely disrupt the usual processes of In this paper, we discuss the application of Natural Language Processing (NLP) techniques to improving turn-taking. Thus the other speaker finds it hard to speechprostheses for people with severe motordisabil- avoid interrupting the prosthesis user. ities. Manypeople whoare unable to speak because of This problem can be alleviated in two ways: by im- physical disability utilize text-to-speech generators as proving the design of the interface (keyboard, head prosthetic devices. However,users of speech prosthe- stick, head pointer, eye tracker etc) or by minimizing ses very often have moregeneral loss of motor control the input that is required for a given output. Wewill and, despite aids such as word prediction, inputting concentrate on the latter aspect here, although there the text is slow and difficult. For typical users, cur- is some interdependence and we will briefly mention rent speechprostheses have output rates whichare less some aspects of this below. than a tenth of the speed of normalspeech. Weare ex- Techniques which have been used for minimizing in- ploring various techniques whichcould improverates, put include the following: without sacrificing flexibility of content. Here we de- scribe the statistical wordprediction techniques used in a communicatordeveloped at CSLIand someexper- Abbreviations, icons and alternative languages iments on improving prediction performance.
    [Show full text]