1519 search results - page 73 / 304 » The Domain Dependence of Parsing |
184
click to vote
ANLP
1997
15 years 7 months ago
1997
This paper describes a new finite-state shallow parser. It merges constructive and reductionist approaches within a highly modular architecture. Syntactic information is added at ...
148
click to vote
DCC
2004
IEEE
16 years 6 months ago
2004
IEEE
In the discrete filtering problem, a data sequence over a finite alphabet is assumed to be corrupted by a discrete memoryless channel. The goal is to reconstruct the clean sequenc...
195
click to vote
CVPR
1998
IEEE
16 years 8 months ago
1998
IEEE
A new approach to the recognition of temporal behaviors and activities is presented. The fundamental idea, inspired by work in speech recognition, is to divide the inference probl...
155
click to vote
UIST
2004
ACM
15 years 11 months ago
2004
ACM
A long standing challenge in pen-based computer interaction is the ability to make sense of informal sketches. A main difficulty lies in reliably extracting and recognizing the i...
135
click to vote
FLAIRS
2008
15 years 8 months ago
2008
For many educational applications such as learning tools for argumentation, structured diagrams are a suitable form of external representation. However, student-created graphs pos...