FDL
2008
IEEE
13 years 7 months ago
2008
IEEE
Digital television (DTV) is an advanced broadcasting technology that is spreading fast today. It gives broadcasters the capability to send programs with a better picture and sound ...
EACL
2010
ACL Anthology
13 years 7 months ago
2010
ACL Anthology
Abstract. Data-to-text generation systems tend to be knowledge-based and manually built, which limits their reusability and makes them time and cost-intensive to create and maintai...
CICLING
2010
Springer
13 years 7 months ago
2010
Springer
This paper describes an effort towards building a Telugu Dependency Treebank. We discuss the basic framework and issues we encountered while annotating. 1487 sentences have been an...
CICLING
2010
Springer
13 years 7 months ago
2010
Springer
Named Entity Recognition and Classification is being studied for last two decades. Since semantic features take huge amount of training time and are slow in inference, the existing...
ICGI
2010
Springer
13 years 8 months ago
2010
Springer
Although MATLAB1 has become one of the mainstream languages for the machine learning community, there is still skepticism among the Grammatical Inference (GI) community regarding t...
ICGI
2010
Springer
13 years 8 months ago
2010
Springer
Angluin showed that the class of regular languages could be learned from a Minimally Adequate Teacher (mat) providing membership and equivalence queries. Clark and Eyraud (2007) sh...
ICGI
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. In this article, we propose the use of suffix arrays to efficiently implement n-gram language models with practically unlimited size n. This approach, which is used with ...
ICGI
2010
Springer
13 years 8 months ago
2010
Springer
We recapitulate regular one-shot learning from membership and equivalence queries, positive and negative finite data. We present a meta-algorithm that generalizes over as many sett...
ICGI
2010
Springer
13 years 8 months ago
2010
Springer
In this work, we give an algorithm that infers Regular Trace Languages. Trace languages can be seen as regular languages that are closed under a partial commutation relation called...
ICGI
2010
Springer
13 years 8 months ago
2010
Springer
This paper presents an efficient algorithm that identifies a rich subclass of multiple context-free languages in the limit from positive data and membership queries by observing wh...