Applying Natural Language Processing Techniques to Speech Prostheses

Total Page:16

File Type:pdf, Size:1020Kb

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. Wedis- Interfaces to speech prostheses commonlyallow text cuss the limitations of prediction on free text, and out- to be associated with particular abbreviations, func- line workwhich is in progress on utilizing constrained tion keys or on-screen icons. This is useful for text NLgeneration to makemore natural interactions pos- which is repeated frequently, but requires memoriza- sible. tion and does not allow muchflexibility. Somesys- tems use Minspeak (Baker, 1982), which allows short Introduction sequences of keystrokes to be used to produce whole utterances. Minspeakis compact and quite flexible, The Archimedes project at CSLI is concerned with but using it effectively requires considerable learn- developing computer-assisted communication for peo- ing. ple with disabilities, considering both their interaction with computers and with other individuals. We are Fixed text dialogues and stored narratives attempting to provide practical devices for immediate Alm et al (1992) describe an approach where needs, and also to carry out basic research on com- fixed text is stored and can be retrieved as ap- munication, which will lead to future improvements in propriate for particular stages of conversation, in these techniques. The work described in this paper particular: greeting, acknowledgement of inter- concerns the communication needs of people who have est/understanding, parting. Other work by the same unintelligible speech or wholack speech altogether be- group allows the retrieval of preconstructed utter- cause of motor disabilities. It is possible to build pros- ances and stories in appropriate contexts (Newell et thetic devices for such users by linking a suitable phys- al, 1995). A commercial implementation of this work ical interface with a speech generator, such as DecTalk, is Talk:About, produced by Don Johnson Incorpo- so that text or other symbolic input can be converted rated. This approach is important in that it empha- to speech. However, while speech rates in normal con- sizes the social role of conversation, but it allows the versation are around 150-200 words per minute (wpm), user little flexibility at the time the conversation is and reasonably skilled typists can achieve rates of 60 taking place. wpm,conditions which impair physical ability to speak Word (or phrase) prediction Many speech pros- usually cause more general loss of motor function and theses which take text rather than iconic input in- typically speech prosthesis users can only output about corporate some kind of word prediction, where the 10-15 wpm. This prevents natural conversation, not user is given a choice of a number of words, which 5 is successively refined as keystrokes are entered. We so that all the keys are mappedto the right hand side discuss prediction further below. since the user has very restricted right hand mobility Compansion Compansion is an approach which has and no left hand use. An interface to an eye-tracker been used in a prototype system (Demasco and Mc- is currently under development at CSLI to replace the Coy, 1992) but is not yet available commercially. It keyboard. The prediction techniques which the acces- allows the user to input only content words, to which sor currently utilizes are discussed below, followed by morphological information and function words are an outline of work in progress on a more complex sys- added by the system to produce a well-formed sen- tem. tence. A rather similar approach is described by Vaillant and Checler (1995), though they assume Statistical Prediction Techniques icons as input. Compansionis useful for individu- The basic technique behind word prediction is to give als who have difficulty with syntax, but as a tech- the user a choice of the words (or words and phrases) nique for improving speech rate for users with no which are calculated to be the most likely, based on cognitive disability it has limitations, since it still the previous input. The choices are usually displayed requires the user to input at least 60%of the num- as some sort of menu: if the user selects one of the ber of keystrokes which would be necessary to input items, that word is output, but if no appropriate choice the text normally. Furthermore, it involves natural is present, the user continues entering letters. For ex- language generation and requires considerable hand- ample, if ’t’ has been entered as the first letter of a coded linguistic knowledge (grammar, lexicon, some word, the system might show a menu containing the, information about word meaning). to, that, they, too, turn, telephone and thank you. If In the Archimedes project, we are concentrating in none of these are correct and the user enters ’a’, the particular on the needs of individuals who have degen- options might changeto take, table and so on. If table is erative muscular disorders, such as amyotrophic lat- then selected, it will be output (possibly with a trailing eral sclerosis (ALSor Lou Gehrig’s disease). Individ- space) and some effort has been saved. This approach uals with ALShave no cognitive or linguistic impair- is very flexible, since the user can input anything: the ment and have previously had full language use, so worst case is that the string is unknown,in which case solutions to the communicationproblem which restrict the system will not make any useful prediction. Predic- their range of expression are not acceptable. Such users tion ordering is based on the user’s previous input, and would prefer to continue using their original language, so the system can automatically adapt to the individ- rather than to learn an alternative symbol system. ual user. Unknownstrings are added to the database, Thus, of the techniques described above which are cur- thus allowing them to be predicted subsequently. rently available, the most suitable is text prediction Prediction systems have been used for at least 20 combined with single-key encoding of very frequently years (see Newell et al, 1995, and references therein). used phrases. Text input using a conventional key- The basic techniques are actually useful for any se- board maybe possible, but is usually slow and painful. quence of actions: for example, they can be used for ALSis a progressive disease and in its later stages only computer commands(e.g. Darragh and Witten, 1992). eye movementmay be possible, so it is important that However,we will concentrate on text input here, since any prosthetic system allows a range of physical input it is possible to improve prediction rates by using devices, since interfaces which are most suitable in the knowledge of language. For text input, the simplest earlier stages of the disease will becomeunusable later technique is to use the initial letters of a word as con- on. text, and to predict words on the basis of their frequen- We found that, in addition to the speed problems, cies. The prediction database is thus simply a wordlist existing commercial text-to-speech systems which in- with associated frequencies. This basic approach was corporated word prediction had a variety of drawbacks. implemented in the first version of the CSLI personal In particular, most are dedicated to speech output and accessor, using a wordlist containing about 3000 words cannot be used to aid writing text or email. There extracted from 26,000 words of collected data as start- are also problems of limitations in compatibility with ing data. particular software or hardware, and restrictions in We also built a testbed system in order to simulate the physical interfaces. One of the fundamental engi- the effects of various algorithms on the collected data neering principles underlying the Archimedesproject is in advance of trying them out with a user. We used that individuals should have Personal Accessors which a testing methodology where the data was split into take care of their personal needs with respect to phys- training and test sets, with the test set (10%of total ical input and which can be hooked up to any host data) treated as unseen. Weused the following scoring computer, with a small inexpensive adapter, replacing method: the conventional keyboard and mouse. A Personal Ac- (keystrokes + menuselections) * 100 cessor for one user with ALS has been developed at keystrokes needed without prediction CSLI, and now forms his main means of communica- tion.
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]
  • 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.
    [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]