scholarly journals A Graph Retrieval Architecture and System for Online Sign Language Dictionary- with an application to Taiwanese Sign Language

Author(s):  
Chang-Ling Hsu ◽  
Yen-Ju Tsai ◽  
Ray-I Chang

Emerging applications for an online sign language dictionary require that retrieval systems retrieve a target vocabulary through visual symbols. However, when people encounter an unknown vocabulary in sign language during communication, they require the online dictionary to retrieve the vocabulary with higher recall-rate and smaller-sized graph through a mobile device. Still, three situations show that the current online dictionary needs an extension. First, previous works lack of retrieving the target graph of a vocabulary through its complete visual symbol-portfolio. Secondly, they often respond a large number of possible images; however, their precisions and recall rates remain very low. Thirdly, previous works of sign language gloves can convert the visual symbols into the graphic features, but only part of the symbols, ignoring the symbols of expression and relative direction. Therefore, the aim of this study is, based on Taiwanese Sign Language, to design a new graph retrieval architecture for sign-language (GRAS), and to implement a new graph retrieval system for sign-language (GRSS) based on this architecture. Finally, we invite users to evaluate GRSS. The experimental results show that GRSS gets convincing performance. And, GRSS adopting RDF technology can improve the performance of GRSS without adopting RDF technology.

Author(s):  
Yanji Chen ◽  
Mieczyslaw M. Kokar ◽  
Jakub J. Moskal

AbstractThis paper describes a program—SPARQL Query Generator (SQG)—which takes as input an OWL ontology, a set of object descriptions in terms of this ontology and an OWL class as the context, and generates relatively large numbers of queries about various types of descriptions of objects expressed in RDF/OWL. The intent is to use SQG in evaluating data representation and retrieval systems from the perspective of OWL semantics coverage. While there are many benchmarks for assessing the efficiency of data retrieval systems, none of the existing solutions for SPARQL query generation focus on the coverage of the OWL semantics. Some are not scalable since manual work is needed for the generation process; some do not consider (or totally ignore) the OWL semantics in the ontology/instance data or rely on large numbers of real queries/datasets that are not readily available in our domain of interest. Our experimental results show that SQG performs reasonably well with generating large numbers of queries and guarantees a good coverage of OWL axioms included in the generated queries.


2014 ◽  
Vol 22 (2) ◽  
pp. 291-319 ◽  
Author(s):  
SHUDONG HAO ◽  
YANYAN XU ◽  
DENGFENG KE ◽  
KAILE SU ◽  
HENGLI PENG

AbstractWriting in language tests is regarded as an important indicator for assessing language skills of test takers. As Chinese language tests become popular, scoring a large number of essays becomes a heavy and expensive task for the organizers of these tests. In the past several years, some efforts have been made to develop automated simplified Chinese essay scoring systems, reducing both costs and evaluation time. In this paper, we introduce a system called SCESS (automated Simplified Chinese Essay Scoring System) based on Weighted Finite State Automata (WFSA) and using Incremental Latent Semantic Analysis (ILSA) to deal with a large number of essays. First, SCESS uses ann-gram language model to construct a WFSA to perform text pre-processing. At this stage, the system integrates a Confusing-Character Table, a Part-Of-Speech Table, beam search and heuristic search to perform automated word segmentation and correction of essays. Experimental results show that this pre-processing procedure is effective, with a Recall Rate of 88.50%, a Detection Precision of 92.31% and a Correction Precision of 88.46%. After text pre-processing, SCESS uses ILSA to perform automated essay scoring. We have carried out experiments to compare the ILSA method with the traditional LSA method on the corpora of essays from the MHK test (the Chinese proficiency test for minorities). Experimental results indicate that ILSA has a significant advantage over LSA, in terms of both running time and memory usage. Furthermore, experimental results also show that SCESS is quite effective with a scoring performance of 89.50%.


2021 ◽  
Author(s):  
Jakob Marolt ◽  
Nenad Kosanić ◽  
Tone Lerher

Abstract This paper studies multiple-deep automated vehicle storage and retrieval systems (AVS/RS) known for their high throughput performance and flexibility. Compared to a single-deep system, multiple-deep AVS/RS has a better space area utilisation. However, a relocation cycle occurs, reducing the throughput performance whenever another stock-keeping unit (SKU) blocks a retrieving SKU. The SKU retrieval sequence is undetermined, meaning that the arrangement is unknown, and all SKUs have an equal probability of retrieval. In addition to the shuttle carrier, a satellite vehicle is attached to the shuttle carrier and is used to access storage locations in multiple depths. A discrete event simulation of multiple-deep AVS/RS with a tier captive shuttle carrier was developed. We focused on the dual command cycle time assessment of nine different storage and relocation assignment strategies combinations in the simulation model. The results of a simulation study for (i) Random, (ii) Depth-first and (iii) Nearest neighbour storage and relocation assignment strategies combinations are examined and benchmarked for five different AVS/RS case study configurations with the same number of storage locations. The results display that the fivefold and sixfold deep AVS/RS outperform systems with fewer depths by utilising Depth-first storage and Nearest neighbour relocation assignment strategies.


2011 ◽  
Vol 204-210 ◽  
pp. 2171-2175
Author(s):  
Zi Yu Liu ◽  
Dong Li Zhang ◽  
Xue Hui Li

Domain ontology can effectively organize the knowledge of that domain and make it easier to share and reuse. We can build domain ontology on thesaurus and thematic words and index document knowledge using domain ontology. Under which this paper designs a semantic retrieval system for the document knowledge based on domain ontology, and the system consists of four main components: ontology query, semantic precomputation for document and the concept similarity, semantic extended search and reasoning search. Finally, this paper makes an experiment on high-speed railway domain. The experimental results show that the developed semantic retrieval system can reach the satisfied recall and precision.


Author(s):  
Junyeong Yang ◽  
Sanghyuk Park ◽  
Hacheon Seong ◽  
Hyeran Byun ◽  
YeongKyu Lim

2013 ◽  
Vol 712-715 ◽  
pp. 2706-2711
Author(s):  
Xiao Qing Yu ◽  
Wen Gen Wang ◽  
Jian Hua Shi ◽  
Yun Hui Wang

Information retrieval is the activity to organize information in a certain way, and according to the users demand to find out the related information from a collection of resources. Retrieval process and technology can be based on metadata or full-text indexing. Most of the relevant information retrieval systems are devised on the computer. However, with the highly development of the embedded technology, some popular application have been developed on the platform. In this paper, we will introduce an information retrieval system on the iOS platform which is more convenient, practical, and effective compared with the traditional system. And we will introduce an application based on this system design. The experiments shown that this system was exactly effective utilized to retrieval audio information.


2011 ◽  
Vol 109 ◽  
pp. 612-616 ◽  
Author(s):  
Dun Li ◽  
Wei Tu ◽  
Lei Shi

New word identification is one of the difficult problems of the Chinese information processing. This paper presents a new method to identify new words. First of all, the text is segmented using N-Gram; then PPM is used to identify the new words which are in the text; finally, the new identified words are added to update the dictionary using LRU. Compared with three well-known word segmentation systems, the experimental results show that this method can improve the precision and recall rate of new word identification to a certain extent.


1995 ◽  
Vol 38 (2) ◽  
pp. 477-489 ◽  
Author(s):  
Charlotte M. Reed ◽  
Lorraine A. Delhorne ◽  
Nathaniel I. Durlach ◽  
Susan D. Fischer

One of the natural methods of tactual communication in common use among individuals who are both deaf and blind is the tactual reception of sign language. In this method, the receiver (who is deaf-blind) places a hand (or hands) on the dominant (or both) hand(s) of the signer in order to receive, through the tactual sense, the various formational properties associated with signs. In the study reported here, 10 experienced deaf-blind users of either American Sign Language (ASL) or Pidgin Sign English (PSE) participated in experiments to determine their ability to receive signed materials including isolated signs and sentences. A set of 122 isolated signs was received with an average accuracy of 87% correct. The most frequent type of error made in identifying isolated signs was related to misperception of individual phonological components of signs. For presentation of signed sentences (translations of the English CID sentences into ASL or PSE), the performance of individual subjects ranged from 60–85% correct reception of key signs. Performance on sentences was relatively independent of rate of presentation in signs/sec, which covered a range of roughly 1 to 3 signs/sec. Sentence errors were accounted for primarily by deletions and phonological and semantic/syntactic substitutions. Experimental results are discussed in terms of differences in performance for isolated signs and sentences, differences in error patterns for the ASL and PSE groups, and communication rates relative to visual reception of sign language and other natural methods of tactual communication.


Sign in / Sign up

Export Citation Format

Share Document