Sciweavers

644 search results - page 92 / 129
» Precedence Automata and Languages
Sort
View
CASES
2009
ACM
15 years 6 months ago
Optimal loop parallelization for maximizing iteration-level parallelism
This paper solves the open problem of extracting the maximal number of iterations from a loop that can be executed in parallel on chip multiprocessors. Our algorithm solves it opt...
Duo Liu, Zili Shao, Meng Wang, Minyi Guo, Jingling...
IJCNLP
2005
Springer
15 years 5 months ago
A Method of Recognizing Entity and Relation
The entity and relation recognition, i.e. (1) assigning semantic classes to entities in a sentence, and (2) determining the relations held between entities, is an important task in...
Xinghua Fan, Maosong Sun
EMNLP
2010
14 years 9 months ago
A Multi-Pass Sieve for Coreference Resolution
Most coreference resolution models determine if two mentions are coreferent using a single function over a set of constraints or features. This approach can lead to incorrect deci...
Karthik Raghunathan, Heeyoung Lee, Sudarshan Ranga...
INLG
2010
Springer
14 years 9 months ago
Towards an Extrinsic Evaluation of Referring Expressions in Situated Dialogs
In the field of referring expression generation, while in the static domain both intrinsic and extrinsic evaluations have been considered, extrinsic evaluation in the dynamic doma...
Philipp Spanger, Ryu Iida, Takenobu Tokunaga, Asuk...
FSMNLP
2005
Springer
15 years 5 months ago
Algorithms for Minimum Risk Chunking
Abstract. Stochastic finite automata are useful for identifying substrings (chunks) within larger units of text. Relevant applications include tokenization, base-NP chunking, name...
Martin Jansche