10 results on '"Bouma, Gosse"'
Search Results
2. Enriching a Scientific Grammar with Links to Linguistic Resources: The Taalportaal
- Author
-
van der Wouden, Ton, Bouma, Gosse, van de Camp, Matje, Koppen, Marjo van, Landsbergen, Frank, Odijk, Jan, Hessen, Arjan van, LS Nederlandse taalkunde, LS OZ Taal en spraaktechnologie, ILS LLI, LS Nederlandse taalkunde, LS OZ Taal en spraaktechnologie, and ILS LLI
- Subjects
language ,Grammar ,Computer science ,media_common.quotation_subject ,Linguistics ,Prime (order theory) ,Language and Linguistics ,Rule-based machine translation ,grammar ,Afrikaans Frisian Dutch linguistic research database grammar language ,Afrikaans ,Frisian ,linguistic research ,Dutch ,database ,media_common ,Computer Science(all) - Abstract
Scientific research within the humanities is different from what it was a few decades ago. Forinstance, new sources of information, such as digital grammars, lexical databases and largecorpora of real-language data offer new opportunities for linguistics. The Taalportaal gram-matical database, with its links to other linguistic resources via the CLARIN infrastructure,is a prime example of a new type of tool for linguistic research.
- Published
- 2017
- Full Text
- View/download PDF
3. Modeling math word problems with augmented semantic networks
- Author
-
Liguda, Christian, Pfeiffer, Thies, Bouma, Gosse, Ittoo, Ashwin, Métais, Elisabeth, and Wortmann, Hans
- Subjects
Theoretical computer science ,Computer science ,Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing) ,Solver ,language.human_language ,Semantic network ,Word problem (mathematics education) ,German ,Artificial Intelligence ,language ,Math problem ,Language model ,Mathematical structure ,Natural language - Abstract
Modern computer-algebra programs are able to solve a wide range of mathematical calculations. However, they are not able to understand and solve math text problems in which the equation is described in terms of natural language instead of mathematical formulas. Interestingly, there are only few known approaches to solve math word problems algorithmically and most of employ models based on frames. To overcome problems with existing models, we propose a model based on augmented semantic networks to represent the mathematical structure behind word problems. This model is implemented in our Solver for Mathematical Text Problems (SoMaTePs) [1], where the math problem is extracted via natural language processing, transformed in mathematical equations and solved by a state-of-the-art computer-algebra program. SoMaTePs is able to understand and solve mathematical text problems from German primary school books and could be extended to other languages by exchanging the language model in the natural language processing module.
- Published
- 2012
4. The IMIX Demonstrator: an Information Search Assistant for the Medical Domain
- Author
-
Hofs, D.H.W., van Schooten, B.W., op den Akker, Hendrikus J.A., van den Bosch, Antal, and Bouma, Gosse
- Subjects
World Wide Web ,EWI-20808 ,Computer science ,Human–computer interaction ,IR-80541 ,Speech input ,Information Retrieval ,Question answering ,Dialog box ,Question Answering ,Domain (software engineering) ,METIS-289631 - Abstract
In the course of the IMIX project a system was developed to demonstrate how the research performed in the various subprojects could contribute to the development of practical multimodal question answering dialog systems. This chapter describes the IMIX Demonstrator, an information search assistant for the medical domain. The functionalities and the architecture of the system are described, as well as its role in the IMIX project.
- Published
- 2011
5. Text-to-text generation for question answering
- Author
-
Bosma, W.E., Marsi, Erwin, Krahmer, Emiel, Theune, Mariet, van den Bosch, Antal, Bouma, Gosse, van den Bosch, A., Bouma, G, Language and Communication, and Language, Communication and Cognition
- Subjects
Information retrieval ,Computer science ,business.industry ,IR-78522 ,EWI-20800 ,Information needs ,computer.software_genre ,METIS-281563 ,Fluency ,Text generation ,Question answering ,Graph (abstract data type) ,Artificial intelligence ,tf–idf ,business ,computer ,Natural language processing ,Sentence ,Selection system - Abstract
In this chapter, we describe our efforts in text-to-text generation within the IMOGEN project. In particular, we describe two focus areas of research to improve the quality of the answer: (a) graph-based content selection to improve the answer in terms of usefulness, and (b) sentence fusion to improve the answer in terms of formulation. We use sentence fusion to join together multiple sentences in order to eliminate overlapping parts, thereby reducing redundancy. The results of this work have been applied in the IMIX system. This system uses a question answering system to pinpoint fragments of text which are relevant to the information need expressed by the user. A content selection system then uses these fragments as entry points in the text to formulate a more complete answer. Sentence fusion is applied to manipulate the result in order to increase the fluency of the text.
- Published
- 2011
- Full Text
- View/download PDF
6. Vidiam: Corpus-based Development of a Dialogue Manager for Multimodal Question Answering
- Author
-
van Schooten, B.W., op den Akker, Hendrikus J.A., van den Bosch, Antal, and Bouma, Gosse
- Subjects
Typology ,Multi-modal dialogue management ,business.industry ,Computer science ,iterative question answering ,Base (topology) ,Dialogue management ,computer.software_genre ,METIS-286266 ,Development (topology) ,EWI-20809 ,Question answering ,Corpus based ,IR-80467 ,Artificial intelligence ,business ,computer ,Natural language processing - Abstract
This chapter describes the Vidiam project, which covered the development of a dialogue management system for multimodal question answering (QA) dialogues, as carried out in the IMIX project. The approach followed was datadriven, i.e., corpus-based. Since research in QA dialogue of multimodal information retrieval is still new, no suitable corpora were available to base a system on. This chapter reports on the collection and analysis of three QA dialogue corpora, involving textual follow-up utterances, multimodal follow-up questions, and speech dialogues. Based on the data, a dialogue act typology was created, which helps translate user utterances to practical interactive QA strategies.
- Published
- 2011
- Full Text
- View/download PDF
7. SWHi System Description: A Case Study in Information Retrieval, Inference, and Visualization in the Semantic Web
- Author
-
Fahmi, Ismail, Zhang, Junte, Ellermann, Henk, Bouma, Gosse, Franconi, E, Kifer, M, May, W, Logic and Computation (ILLC, FNWI/FGw), and Language and Computation (ILLC, FNWI/FGw)
- Subjects
Ontology Inference Layer ,inference ,Information retrieval ,business.industry ,Computer science ,computer.internet_protocol ,Search engine indexing ,Semantic search ,Ontology (information science) ,Social Semantic Web ,OWL-S ,semantic web ,Semantic Web Stack ,ontology ,information retrieval ,business ,Semantic Web ,computer ,visualization - Abstract
Search engines have become the most popular tools for finding information on the Internet. A real-world Semantic Web application can benefit from this by combining its features with some features from search engines. In this paper, we describe methods for indexing and searching a populated ontology by using an information retrieval tool; its results are enriched with inference. For visualization purposes, all of the retrieved ontology instances are clustered based on their classes; and the clusters are linked using instance properties. The approach is illustrated using our SWHi (Semantic Web for History) prototype as a case study.
- Published
- 2007
8. Question Answering for Dutch Using Dependency Relations.
- Author
-
Peters, Carol, Gey, Fredric C., Gonzalo, Julio, Müller, Henning, Jones, Gareth J. F., Kluck, Michael, Magnini, Bernardo, Rijke, Maarten, Giampiccolo, Danilo, Bouma, Gosse, Mur, Jori, Noord, Gertjan, Plas, Lonneke, and Tiedemann, Jörg
- Abstract
Joost is a question answering system for Dutch which makes extensive use of dependency relations. It answers questions either by table look-up, or by searching for answers in paragraphs returned by IR. Syntactic similarity is used to identify and rank potential answers. Tables were constructed by mining the CLEF corpus, which has been syntactically analyzed in full. [ABSTRACT FROM AUTHOR]
- Published
- 2006
- Full Text
- View/download PDF
9. Semi-Automatic Construction of Text-to-SQL Data for Domain Transfer
- Author
-
Tianyi Li, Mark Steedman, Sujian Li, Oepen, Stephan, Sagae, Kenji, Tsarfaty, Reut, Bouma, Gosse, Seddah, Djamé, and Zeman, Daniel
- Subjects
SQL ,Information retrieval ,Parsing ,Computer science ,InformationSystems_DATABASEMANAGEMENT ,Construct (python library) ,Asset (computer security) ,computer.software_genre ,Pipeline (software) ,Domain (software engineering) ,Annotation ,Multiple time dimensions ,computer ,computer.programming_language - Abstract
Strong and affordable in-domain data is a desirable asset when transferring trained semantic parsers to novel domains. As previous methods for semi-automatically constructing such data cannot handle the complexity of realistic SQL queries, we propose to construct SQL queries via context-dependent sampling, and introduce the concept of topic. Along with our SQL query construction method, we propose a novel pipeline of semi-automatic Text-to-SQL dataset construction that covers the broad space of SQL queries. We show that the created dataset is comparable with expert annotation along multiple dimensions, and is capable of improving domain transfer performance for SOTA semantic parsers.
- Published
- 2021
- Full Text
- View/download PDF
10. Polarity preference of verbs: What could verbs reveal about the polarity of their objects?
- Author
-
Stefanos Petrakis, Manfred Klenner, University of Zurich, Bouma, Gosse, Ittoo, Ashwin, Métais, Elisabeth, Wortmann, Hans, and Klenner, Manfred
- Subjects
Computer science ,Polarity (physics) ,business.industry ,Verb ,410 Linguistics ,000 Computer science, knowledge & systems ,computer.software_genre ,Linguistics ,Preference ,Noun ,10105 Institute of Computational Linguistics ,Artificial intelligence ,1700 General Computer Science ,business ,2614 Theoretical Computer Science ,computer ,Natural language processing - Abstract
The current endeavour focuses on the notion of positive versus negative polarity preference of verbs for their direct objects. This preference has to be distinguished from a verb's own prior polarity - for the same verb, these two properties might even be inverse. Polarity preferences of verbs are extracted on the basis of a large and dependency-parsed corpus by means of statistical measures. We observed verbs with a relatively clear positive or negative polarity preference, as well as cases of verbs where positive and negative polarity preference is balanced (we call these bipolar-preference verbs). Given clear-cut polarity preferences of a verb, nouns, whose polarity is yet unknown, can now be classified. We reached a lower bound of 81% precision in our experiments, whereas the upper bound goes up to 92%.
- Published
- 2012
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.