205 search results - page 6 / 41 » A CCG Approach to Free Word Order Languages |
MFCS
1998
Springer
13 years 11 months ago
1998
Springer
It is known that a language is context-free iff it is the set of borders of the trees of recognizable set, where the border of a (labelled) tree is the word consisting of its leaf ...
ICDAR
1999
IEEE
13 years 11 months ago
1999
IEEE
In this paper, a range free skew detection technique for machine printed Gurmukhi documents has been presented. This approach can easily be extended to other Indian language scrip...
UAI
1998
13 years 8 months ago
1998
People using consumer software applications typically do not use technical jargon when querying an online database of help topics. Rather, they attempt to communicate their goals ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Given a probability distribution over a set of n words to be transmitted, the Huffman Coding problem is to find a minimal-cost prefix free code for transmitting those words. The b...
DAGM
2008
Springer
13 years 8 months ago
2008
Springer
This paper introduces an novel framework for speech understanding using extended context-free grammars (ECFGs) by combining statistical methods and rule based knowledge. By only us...