Sciweavers

3653 search results - page 402 / 731
» On Recognizable Timed Languages
Sort
View
LREC
2010
148views Education» more  LREC 2010»
15 years 8 months ago
Tag Dictionaries Accelerate Manual Annotation
Expert human input can contribute in various ways to facilitate automatic annotation of natural language text. For example, a part-of-speech tagger can be trained on labeled input...
Marc Carmen, Paul Felt, Robbie Haertel, Deryle Lon...
DLT
2004
15 years 8 months ago
An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars
There is a close relationship between formal language theory and data compression. Since 1990's various types of grammar-based text compression algorithms have been introduced...
Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
DLT
2003
15 years 8 months ago
NFA Reduction Algorithms by Means of Regular Inequalities
We present different techniques for reducing the number of states and transitions in nondeterministic automata. These techniques are based on the two preorders over the set of st...
Jean-Marc Champarnaud, Fabien Coulon
DAM
2007
85views more  DAM 2007»
15 years 6 months ago
Testing primitivity on partial words
Primitive words, or strings over a finite alphabet that cannot be written as a power of another string, play an important role in numerous research areas including formal language...
Francine Blanchet-Sadri, Arundhati R. Anavekar
IWC
2007
100views more  IWC 2007»
15 years 6 months ago
Usefulness of VRML building models in a direction finding context
This paper describes an experiment which aims to examine the effectiveness and efficiency of a Virtual Reality Modelling Language (VRML) building model compared with equivalent ar...
Pietro Murano, Dino Mackey