Sciweavers

2783 search results - page 100 / 557
» The Nature Of Near-Synonymic Relations
Sort
View
WG
2010
Springer
14 years 11 months ago
Efficient Algorithms for Eulerian Extension
Eulerian extension problems aim at making a given (directed) (multi-)graph Eulerian by adding a minimum-cost set of edges (arcs). These problems have natural applications in schedu...
Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mat...
ACL
2009
14 years 11 months ago
Correlating Human and Automatic Evaluation of a German Surface Realiser
We examine correlations between native speaker judgements on automatically generated German text against automatic evaluation metrics. We look at a number of metrics from the MT a...
Aoife Cahill
ACL
2009
14 years 11 months ago
System for Querying Syntactically Annotated Corpora
This paper presents a system for querying treebanks. The system consists of a powerful query language with natural support for cross-layer queries, a client interface with a graph...
Petr Pajas, Jan Stepánek
DLT
2009
14 years 11 months ago
Weighted versus Probabilistic Logics
While a mature theory around logics such as MSO, LTL, and CTL has been developed in the pure boolean setting of finite automata, weighted automata lack such a natural connection wi...
Benedikt Bollig, Paul Gastin
ESWS
2009
Springer
14 years 11 months ago
Concept Search
Concept Search extends syntactic search, i.e., search based on the computation of string similarity between words, with semantic search, i.e., search based on the computation of s...
Fausto Giunchiglia, Uladzimir Kharkevich, Ilya Zai...