Sciweavers

1052 search results - page 39 / 211
» The Regular Real-Time Languages
Sort
View
PRICAI
2004
Springer
15 years 8 months ago
An Anytime Algorithm for Interpreting Arguments
Abstract. The problem of interpreting Natural Language (NL) discourse is generally of exponential complexity. However, since interactions with users must be conducted in real time,...
Sarah George, Ingrid Zukerman, Michael Niemann
110
Voted
ANLP
1992
103views more  ANLP 1992»
15 years 4 months ago
Real-time linguistic analysis for continuous speech understanding
This paper describes the approach followed in the development of the linguistic processor of the continuous speech dialog system implemented at our labs. The application scenario ...
Paolo Baggia, Elisabetta Gerbino, Egidio P. Giachi...
164
Voted
ENTCS
2002
121views more  ENTCS 2002»
15 years 3 months ago
Regular Expression Types for Strings in a Text Processing Language
d Abstract) Naoshi Tabuchi Eijiro Sumii Akinori Yonezawa 1 Department of Computer Science, Graduate School of Information Science and Technology, University of Tokyo We present re...
Naoshi Tabuchi, Eijiro Sumii, Akinori Yonezawa
132
Voted
ITA
2007
101views Communications» more  ITA 2007»
15 years 3 months ago
Learning tree languages from text
We study the problem of learning regular tree languages from text. We show that the framework of function distinguishability as introduced by the author in Theoretical Computer Sc...
Henning Fernau
103
Voted
DBPL
2007
Springer
83views Database» more  DBPL 2007»
15 years 9 months ago
Succinctness of Pattern-Based Schema Languages for XML
Martens et al. defined a pattern-based specification language equivalent in expressive power to the widely adopted XML Schema definitions (XSDs). This language consists of rules...
Wouter Gelade, Frank Neven