3653 search results - page 52 / 731 » On Recognizable Timed Languages |
CPM
1999
Springer
15 years 2 months ago
1999
Springer
We present a very efficient, in terms of space and access speed, data structure for storing huge natural language data sets. The structure is described as LZ (Ziv Lempel) compresse...
ACL
1998
14 years 11 months ago
1998
Several methods are known for parsing languages generated by Tree Adjoining Grammars (TAGs) in O(n 6) worst case running time. In this paper we investigate which restrictions on T...
COLING
1992
14 years 11 months ago
1992
A proposal to deal with tenses in the framework of Discourse Representation Theory is presented, ms it has been implemented for a fragment at the IMS for the project LILOG. It is ...
IPL
1998
14 years 9 months ago
1998
We show how to accept a context-free language nondeterministically in O( n log n) time on a two-queue machine.
LREC
2010
14 years 11 months ago
2010
This paper investigates the effectiveness of online temporal language model adaptation when applied to a Thai broadcast news transcription task. Our adaptation scheme works as fol...