Sciweavers

656 search results - page 97 / 132
» Marrying Words and Trees
Sort
View
ICDT
2007
ACM
118views Database» more  ICDT 2007»
15 years 3 months ago
Approximate Data Exchange
Abstract. We introduce approximate data exchange, by relaxing classical data exchange problems such as Consistency and Typechecking to their approximate versions based on Property ...
Michel de Rougemont, Adrien Vieilleribière
DAGM
2008
Springer
15 years 1 months ago
Natural Language Understanding by Combining Statistical Methods and Extended Context-Free Grammars
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...
Stefan Schwärzler, Joachim Schenk, Frank Wall...
LREC
2010
151views Education» more  LREC 2010»
15 years 1 months ago
FastKwic, an "Intelligent" Concordancer Using FASTR
In this paper, we introduce the FastKwic (Key Word In Context using FASTR), a new concordancer for French and English that does not require users to learn any particular request l...
Véronika Lux-Pogodalla, Dominique Besagni, ...
LREC
2010
147views Education» more  LREC 2010»
15 years 1 months ago
Interacting Semantic Layers of Annotation in SoNaR, a Reference Corpus of Contemporary Written Dutch
This paper reports on the annotation of a corpus of 1 million words with four semantic annotation layers, including named entities, coreference relations, semantic roles and spati...
Ineke Schuurman, Véronique Hoste, Paola Mon...
IJCAI
2007
15 years 1 months ago
Dynamically Weighted Hidden Markov Model for Spam Deobfuscation
Spam deobfuscation is a processing to detect obfuscated words appeared in spam emails and to convert them back to the original words for correct recognition. Lexicon tree hidden M...
Seunghak Lee, Iryoung Jeong, Seungjin Choi