224 search results - page 17 / 45 » Natural Language Multiprocessing: A Case Study |
144
click to vote
LICS
2009
IEEE
15 years 8 months ago
2009
IEEE
Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In ...
153
click to vote
WWW
2011
ACM
14 years 8 months ago
2011
ACM
The multimedia information retrieval community has dedicated extensive research effort to the problem of content-based image retrieval (CBIR). However, these systems find their ma...
IASTEDSE
2004
15 years 3 months ago
2004
This paper describes a case study on application of natural language processing in very early stages of the requirements engineering. In our previous work [7] we have shown how na...
123
click to vote
ACTA
2006
15 years 1 months ago
2006
Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural family of canonical infinite automata representing their...
109
Voted
ACL
1998
15 years 3 months ago
1998
Determining the attachments of prepositions and subordinate conjunctions is a key problem in parsing natural language. This paper presents a trainable approach to making these att...